Symbolic asymptotics

Symbolic asymptotics has recently undergone considerable theoretical development, especially in areas where power series are no longer an appropriate tool. Implementation is beginning to follow. The present book, written by one of the leading specialists in the area, is currently the only one to treat this part of symbolic asymptotics. It contains a good deal of interesting material in a new, developing field of mathematics at the intersection of algebra, analysis and computing, presented in a lively and readable way. The associated areas of zero equivalence and Hardy fields are also covered. The book is intended to be accessible to anyone with a good general background in mathematics, but it nonetheless gets right to the cutting edge of active research. Some results appear here for the first time, while others have hitherto only been given in preprints. Due to its clear presentation, this book is interesting for a broad audience of mathematicians and theoretical computer scientists. TOC:1. Introduction.- 2. Zero Equivalence.- 3. Hardy Fields.- 4. Output Data Structures.- 5. Algorithms for Function Towers.- 6. Algebraic Differential Equations.- 7. Inverse Functions.- 8. Implicit Functions.- 9. Star-Product Expansions.- 10. Oscillating Functions.- References.- Index

Object Details

• Location: Deutsche Nationalbibliothek Frankfurt am Main
• ISBN: 9783540210979 ; 3540210970
• Dimensions: 24 cm
• Extent: XI, 243 S.
• Language: Englisch
• Notes: Literaturverz. S. 235 - 240

References and Relationships

• Bibliographic citation: Algorithms and computation in mathematics ; Vol. 12

Classification and Topics

• Classification: Mathematik
• Keyword: Reelle Funktion ; Asymptotik ; Computeralgebra

Contributors, Places and Time

• Event: Veröffentlichung
• (where): Berlin, Heidelberg, New York, Hong Kong, London, Milan, Paris, Tokyo
• (who): Springer
• (when): 2004
• Creator: Shackell, John R.

Further information

• Table of contents: https://d-nb.info/970130171/04
• Rights: Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
• Last update: 11.06.2025, 1:34 PM CEST