Abstract
This book is about the automatic computation of asymptotic behaviour of functions of a real variable, x. This means that we shall wish to compute limits, and also to give some measure of how rapidly a given function approaches its limit Throughout, we shall assume that our interest is in the behaviour as x → ∞. This is for convenience only, since other cases can be considered by using a transformation of one of the forms x → ±(x – x 0)-1. These give separate treatments of the cases when x tends to x 0 from above and below. We shall want our methods to be at least potentially implementable, and we shall, from time to time, give some consideration to actual implementations. However this book is really about algorithms and the mathematical principles that underlie them, rather than details of implementation.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Shackell, J.R. (2004). Introduction. In: Symbolic Asymptotics. Algorithms and Computation in Mathematics, vol 12. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-10176-6_1
Download citation
DOI: https://doi.org/10.1007/978-3-662-10176-6_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-05925-4
Online ISBN: 978-3-662-10176-6
eBook Packages: Springer Book Archive