+612 9045 4394
 
CHECKOUT
Symbolic Asymptotics : Algorithms and Computation in Mathematics - John R. Shackell

Symbolic Asymptotics

Algorithms and Computation in Mathematics

Hardcover Published: 2nd July 2004
ISBN: 9783540210979
Number Of Pages: 243

Share This Book:

Hardcover

RRP $420.99
$291.35
31%
OFF
or 4 easy payments of $72.84 with Learn more
Ships in 10 to 15 business days

Other Available Editions (Hide)

  • Paperback View Product Published: 9th December 2010
    $204.16

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.

From the reviews:

"This book is the first text book about symbolic asympotics, written by one of its major contributors. It deals with the question to calculate limits and asymptotic Expansions of real functions symbolically. ...

The book contains a wealth of information on symbolic asymptotics. It fills a gap in the literature and should be found in every library. The user of a computer algebra system who is interested to understand the output of a command like Maple's asympt finds much interesting information. Actually many users might not even be aware about the complexity of such a command."

Wolfram Koepf, Computeralgebra Rundbrief, October 2005, Issue 37

"This book comprises the research of Professor Shackell in this field over the last 20 years ... . it provides a new presentation which is easier to understand and overall comes highly recommended. ... this book makes a very good starting place indeed. ... Examples, are fairly plentiful, and usually very helpful, with a good level of detail in the working." (James C. Beaumont, SIGACT News, Vol. 38 (4), 2007)

Introduction
Zero Equivalence
Hardy Fields
Output Data Structures
Algorithms for Function Towers
Algebraic Differential Equations
Inverse Functions
Implicit Functions
Star-Product Expansions
Oscillating Functions
References
Index
Table of Contents provided by Publisher. All Rights Reserved.

ISBN: 9783540210979
ISBN-10: 3540210970
Series: Algorithms and Computation in Mathematics
Audience: Professional
Format: Hardcover
Language: English
Number Of Pages: 243
Published: 2nd July 2004
Publisher: Springer-Verlag Berlin and Heidelberg Gmbh & Co. Kg
Country of Publication: DE
Dimensions (cm): 23.5 x 15.5  x 1.91
Weight (kg): 1.2