Dominik Gruntz
- 1.K.O. Geddes and G.H. Gonnet, A New Algorithm for Computing Symbolic Limits using Hierarchical Series, Proceedings of the International Symposium ISSAC 1988, Lecture Notes In Computer Science 358, pp. 490-495, 1988. Google Scholar
Digital Library
- 2.G.H. Gonnet and D. Gruntz, Limit Computalion in Compuler Algebra, Technical Report 187, Department for Computer Science, ETH Zfirich, 1992, (submitted to the JSC, available from the author).Google Scholar
- 3.G.H. Hardy, Orders of Infinity, Cambridge Tracts in Mathematics and Mathematical Physics, No. 12, 1910.Google Scholar
- 4.B.W. Char, K.O. Geddes, G.H. Gonnet, B.L. Leong, M.B. Monagan and S.M. Watt, Maple V Language~Reference Manual, Springer-Verlag, New York, 1991.Google ScholarCross Ref
- 5.M. Rosenlicht, The rank of a Hardy field, Trans. Amer. Math. Soc. 280, pp. 659-671, 1983.Google ScholarCross Ref
- 6.M. Rosenlicht, Growth properties of functions in Hardy fields, Trans. Amer. Math. Soc. 299, pp. 261-272, 1987.Google ScholarCross Ref
- 7.B. Salvy, Examples of Automatic Asymptotic Expansions, SIGSAM Bulletin 25, Nr. 2, pp. 4-17, 1991. Google ScholarDigital Library
- 8.B. Salvy, Asymptotique automatique et fonctions gdndratrices, Phd. Thesis, 1991.Google Scholar
- 9.J. Shackell, Growth Estimates for Exp-Log Functions, Journal of Symbolic Computation 10, pp. 611-632, 1990. Google ScholarDigital Library
- 10.J. Shackell, Rosenlzcht Fields, Preprint, to be published in Trans. Amer. Math. Soc.Google Scholar
- 11.J. Shackell, Computing Asymplolic Expansions of Hardy Fields, Technical Report, University of Kent at Canterbury, England, 1991.Google Scholar
- 12.J. Shackell, Extensions of Asymptotic Fields via Meromorphic Functions, Technical Report, University of Kent at Canterbury, England, 1991.Google Scholar
Index Terms
- A new algorithm for computing asymptotic series
Recommendations
Asymptotic and factorial expansions of Euler series truncation errors via exponential polynomials
A detailed analysis of the remainder obtained by truncating the Euler series up to the nth-order term is presented. In particular, by using an approach recently proposed by Weniger, asymptotic expansions of the remainder, both in inverse powers and in ...
Computing the zeros of a Fourier series or a Chebyshev series or general orthogonal polynomial series with parity symmetries
In recent years, good algorithms have been developed for finding the zeros of trigonometric polynomials and of ordinary polynomials when written in the form of a truncated Chebyshev polynomial or Legendre polynomial series. In each case, the roots can ...
Asymptotic Formulas for Zero-Balanced Hypergeometric Series
A hypergeometric series is called s-balanced if the sum of denominator parameters minus the sum of numerator parameters is s. A nonterminating s-balanced hypergeometric series converges at $x = 1$ if s is positive. An asymptotic formula for the partial ...
Comments