Symbolic asymptotics/ John R. Shackell.
Series: Algorithms and computation in mathematics ; v. 12.Publication details: Berlin; New York: Springer, c2004.Description: xi, 243 p.; 25 cmISBN:- 3540210970 (hc : acid-free paper)
- 9783540210979 (hc : acid-free paper)
- 3642059252
- 9783642059254
- 511.8 S524s
Item type | Current library | Collection | Call number | Copy number | Status | Date due | Barcode |
---|---|---|---|---|---|---|---|
![]() |
Castorina Estantes Abertas (Open Shelves) | Livros (Books) | 511.8 S524s 2004 IMPA (Browse shelf(Opens below)) | 1 | Available | 39063000667207 |
Includes bibliographical references (p. [235]-240) and index.
Zero equivalence -- Hardy fields -- Output data structures -- Algorithms for function towers -- Algebraic differential equations -- Inverse functions -- Implicit functions -- Star-product expansions -- Oscillating functions.
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 .
There are no comments on this title.