On computing limits in a symbolic manipulation system

xi

[1]  Bruno Salvy,et al.  Examples of automatic asymptotic expansions , 1991, SIGS.

[2]  John Shackell.  Nested expansions and hardy fields , 1993, ISSAC '93.

[3]  Juan M. Aguirregabiria,et al.  Are we careful enough when using computer algebra , 1994 .

[4]  Neil Soiffer,et al.  An object-oriented approach to algebra system design , 1986, SYMSAC '86.

[5]  David Turner.  An overview of Miranda , 1986, SIGP.

[6]  M. Boshernitzan,et al.  An extension of hardy’s classL of “orders of infinity” , 1981 .

[7]  Jean-Pierre Laurent.  A Program that Computes Limits Using Heuristics to Evaluate the Indeterminate Forms , 1973, Artif. Intell..

[8]  Karsten Morisse,et al.  MuPAD Multi Processing Algebra Data Tool , 1993 .

[9]  Keith O. Geddes.  Numerical integration in a symbolic context , 1986, SYMSAC '86.

[10]  Gaston H. Gonnet,et al.  New results for random determination of equivalence of expressions , 1986, SYMSAC '86.

[11]  Paul S. Wang.  Automatic computation of limits , 1971, SYMSAC '71.

[12]  Gaston H. Gonnet,et al.  Determining equivalence of expressions in random polynomial time , 1984, STOC '84.

[13]  Ernst Joachim Weniger,et al.  Nonlinear sequence transformations for the acceleration of convergence and the summation of divergent series , 1989 .

[14]  John Shackell.  Asymptotic Estimation of Oscillating Functions Using an Interval Calculus , 1988, ISSAC.

[15]  Richard Zippel.  Univariate power series expansions in algebraic manipulation , 1976, SYMSAC '76.

[16]  John Shackell,et al.  Growth Estimates for Exp-Log Functions , 1990, J. Symb. Comput..

[17]  A. C. Norman,et al.  Computing with Formal Power Series , 1975, TOMS.

[18]  D. Richardson.  Solution of the identity problem for integral exponential functions , 1969 .

[19]  Dominik Gruntz.  A new algorithm for computing asymptotic series , 1993, ISSAC '93.

[20]  Joris van der Hoeven,et al.  Asymptotic expansions of exp-log functions , 1996, ISSAC '96.

[21]  B. F. Caviness,et al.  A note on the complexity of algebraic differentiation , 1977, SIGS.

[22]  E. Lohse,et al.  A Correspondence Between ALGOL 60 and Church's Lambda- Notation: Part I* , 1965 .

[23]  David Levin,et al.  Development of non-linear transformations for improving convergence of sequences , 1972 .

[24]  V. G. Troitsky,et al.  Journal of Mathematical Analysis and Applications , 1960 .

[25]  John D. Lipson.  Newton's method: a great algebraic algorithm , 1976, SYMSAC '76.

[26]  Jacob T. Schwartz,et al.  Fast Probabilistic Algorithms for Verification of Polynomial Identities , 1980, J. ACM.

[27]  Gaston H. Gonnet,et al.  An Assume Facility for CAS, with a Sample Implementation for Maple , 1992, DISCO.

[28]  O. Stolz.  Ueber die Grenzwerthe der Quotienten , 1878 .

[29]  Gerald J. Sussman,et al.  Structure and interpretation of computer programs , 1985, Proceedings of the IEEE.

[30]  Stephen M. Watt,et al.  A Fixed Point Method for Power Series Computation , 1988, ISSAC.

[31]  B. F. Caviness.  On Canonical Forms and Simplification , 1970, JACM.

[32]  Daniel Richardson,et al.  The elementary constant problem , 1992, ISSAC '92.

[33]  Richard W. Hamming,et al.  Numerical Methods for Scientists and Engineers , 1962 .

[34]  B. Salvy.  General Asymptotic Scales and Computer Algebra , 1993 .

[35]  Robert M. Corless,et al.  Well … it isn't quite that simple , 1992, SIGS.

[36]  Anthony C. Hearn.  A new REDUCE model for algebraic simplification , 1976, SYMSAC '76.

[37]  John ffitch,et al.  The identity problem for elementary functions and constants , 1994, ISSAC '94.

[38]  Takuya Kon-no,et al.  Transactions of the American Mathematical Society , 1996 .

[39]  Manuel Bronstein.  Simplification of real elementary functions , 1989, ISSAC '89.

[40]  B. Salvy.  Asymptotique automatique et fonctions generatrices , 1991 .

[41]  M. Rosenlicht,et al.  Growth properties of functions in Hardy fields , 1987 .

[42]  Keith O. Geddes,et al.  A New Algorithm for Computing Symbolic Limits Using Hierarchical Series , 1988, ISSAC.

[43]  Philippe Flajolet,et al.  Automatic Average-Case Analysis of Algorithm , 1991, Theor. Comput. Sci..

[44]  B. F. Caviness,et al.  A note on algebraic independence of logarithmic and exponential constants , 1978, SIGS.

[45]  Bruno Salvy,et al.  Asymptotic expansions of functional inverses , 1992, ISSAC '92.

[46]  Steven J. Harrington.  A symbolic limit evaluation program in REDUCE , 1979, SIGS.

[47]  Daniel Richardson,et al.  A simplified method of recognizing zero among elementary constants , 1995, ISSAC '95.

[48]  John Shackell.  Zero-equivalence in function fields defined by algebraic differential equations , 1993 .

[49]  Gaston H. Gonnet,et al.  Signature functions for algebraic numbers , 1994, ISSAC '94.

[50]  Daniel Richardson,et al.  Some undecidable problems involving elementary functions of a real variable , 1969, Journal of Symbolic Logic.

[51]  J. Shackell.  Extensions of Asymptotic Fields Via Meromorphic Functions , 1995 .

[52]  Keith O. Geddes,et al.  Hybrid symbolic-numeric integration in MAPLE , 1992, ISSAC '92.

[53]  Daniel P. Friedman,et al.  CONS Should Not Evaluate its Arguments , 1976, ICALP.

[54]  Richard Zippel,et al.  The Weyl Computer Algebra Substrate , 1993, DISCO.

[55]  A. Oldehoeft.  Analysis of constructed mathematical responses by numeric tests for equivalence , 1969, ACM '69.

[56]  R. R. Fenichel.  AN ON-LINE SYSTEM FOR ALGEBRAIC MANIPULATION , 1966 .

[57]  Michael Monagan.  Signatures + abstract types + computer algebra - intermediate expression swell , 1990 .

[58]  M. Rosenlicht,et al.  The rank of a Hardy field , 1983 .