Shackell, John R.  1943- <br/><br/>
Symbolic asymptotics/ 
John R. Shackell. 
 - Berlin;  New York:  Springer,  c2004. 
 - xi, 243 p.;  25 cm. 
 - Algorithms and computation in mathematics,  v. 12  1431-1550; .
 - Algorithms and computation in mathematics;  v. 12. .
<br/><br/>Includes bibliographical references (p. [235]-240) and index. 
<br/><br/> Zero equivalence --  Hardy fields --  Output data structures --  Algorithms for function towers --  Algebraic differential equations --  Inverse functions --  Implicit functions --  Star-product expansions --  Oscillating functions. 
<br/><br/> Symbolic asymptotics has recently undergone considerable theoretical development, especially in areas where power series are no longer an appropriate tool. This title looks at this developing field of mathematics at the intersection of algebra, analysis and computi . 
<br/><br/><label>ISBN: </label>3540210970 (hc : acid-free paper) 9783540210979 (hc : acid-free paper) 3642059252 9783642059254 
<br/><br/><label>LCCN: </label>2004045315 
<br/><br/><label>Nat. Bib. No.: </label>GBA4-X4633 04,A36,0624  dnb 04,N10,0736  dnb 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Asymptotic expansions.<br/>Algorithms.
<br/><br/><label>Dewey Class. No.: </label>511.8  / S524s