France 17 , — French. Polylogarithms and special values , Res. Lebedev , Special functions and their applications , Revised English edition. Translated and edited by Richard A. Silverman, Prentice-Hall, Inc.
MR  M. Lothaire , Combinatorics on words , Encyclopedia of Mathematics and its Applications, vol.
MR  N. Computer Science and Applied Mathematics.
- Mapping Crime in Its Community Setting: Event Geography Analysis;
- Superasymptotic Series.
- The Devil's Invention: Asymptotic, Superasymptotic and Hyperasymptotic Series | SpringerLink;
MR  R. Paris , Hadamard expansions and hyperasymptotic evaluation , Encyclopedia of Mathematics and its Applications, vol. An extension of the method of steepest descents. MR  T. With a foreword by Richard Stanley. MR  H.
MR  H. MR  Henning Stichtenoth , Algebraic function fields and codes , 2nd ed. MR  S. Tanny , A probabilistic interpretation of Eulerian numbers , Duke Math. MR  C. Truesdell , On a function which occurs in the theory of the structure of polymers , Ann. Ursell, Integrals with a large parameter. London Math. Wilf, Generatingfunctionology.
San Diego, CA: Acad. Press Inc. Reine Angew. References  Tom M. Boyd, The devil's invention: asymptotic, superasymptotic and hyperasymptotic series , Acta Appl. Carlitz, D. Kurtz, R. Scoville, and O.arasbarnecham.gq
Asymptotic expansion - Wikipedia
Stackelberg, Asymptotic properties of Eulerian numbers , Z. Gebiete 23 , MR  L. Roselle, and R.
- Corporate Reporting and the Internet: Understanding and Using XBRL.
- Monsieur Pain!
- AMS :: Mathematics of Computation.
-  Superasymptotic and hyperasymptotic approximation to the operator product expansion.
Scoville, Permutations and sequences with repetitions by number of increases , J. Combinatorial Theory 1 , Keller, Eulerian number asymptotics , Proc. Graham, Donald E. France 17 , French. Lothaire, Combinatorics on words , Encyclopedia of Mathematics and its Applications, vol. Tanny, A probabilistic interpretation of Eulerian numbers , Duke Math. Truesdell, On a function which occurs in the theory of the structure of polymers , Ann.
Since a convergent Taylor series fits the definition of asymptotic expansion as well, the phrase "asymptotic series" usually implies a non-convergent series. Despite non-convergence, the asymptotic expansion is useful when truncated to a finite number of terms. The approximation may provide benefits by being more mathematically tractable than the function being expanded, or by an increase in the speed of computation of the expanded function.
Typically, the best approximation is given when the series is truncated at the smallest term. This way of optimally truncating an asymptotic expansion is known as superasymptotics.
The error is thus beyond all orders in the expansion parameter. It is possible to improve on the superasymptotic error, e. Such methods are often referred to as hyperasymptotic approximations. See asymptotic analysis and big O notation for the notation used in this article. First we define an asymptotic scale, and then give the formal definition of an asymptotic expansion.
L may be taken to be infinity. If f is a continuous function on the domain of the asymptotic scale, then f has an asymptotic expansion of order N with respect to the scale as a formal series. If one or the other holds for all N , then we write [ citation needed ]. Asymptotic expansions often occur when an ordinary series is used in a formal expression that forces the taking of values outside of its domain of convergence. Thus, for example, one may start with the ordinary series.