Effective asymptotics of linear recurrences with rational coefficients

Discrete Mathematics

Volumn 153, Issue 1-3, 1996, Pages 145-163

  Gourdon, Xavier ^a   Salvy, Bruno ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0010364865     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0012-365X(95)00133-H     Document Type: Article

References (20)

1. J. Berstel and M. Mignotte, Deux propriétés décidables des suites récurrentes linéaires, Bull. de la Soc. Math. de France 104 (1976) 175-184.
2. M. Bronstein and B. Salvy, Full partial fraction decomposition of rational functions, in: M. Bronstein, ed., (ACM Press, New York, 1993) 157-160. ISSAC'93, Kiev, Ukraine, July 1993.
3. L. Cerlienco, M. Mignotte and F. Piras, Suites récurrentes linéaires. Propriétés algébriques et arithmétiques, L'Enseignement Mathématique XXXIII Fascicule 1-2 (1987) 67-108.
4. L. Comtet, Advanced Combinatorics (Reidel, Dordrecht, 1974).
5. J.H. Conway, The weird and wonderful chemistry of audioactive decay, in: T.M. Cover and B. Gopinath, eds., Open Problems in Communication and Computation (Springer, Berlin, 1987) 173-188.
6. M. Coste and M.-F. Roy, Thom's lemma, the coding of real algebraic numbers and the topology of semi-algebraic sets, J. Symbolic Comput. 5 (1988) 121-129.
7. J. Dieudonné, Calcul Infinitésimal (Hermann, Paris, 1968).
8. X. Gourdon, Algorithmique du théorème fondamental de l'algèbre, Tech. Rep. 1852, Institut National de Recherche en Informatique et en Automatique, February 1993.
9. M.A. Jenkins and J.F. Traub, A three-stage variable-shift iteration for polynomial zeros and its relation to generalized Rayleigh iteration, Numer. Math. 14 (1970) 252-263.
10. K. Mahler, An application of Jensen's formula to polynomials, Mathematika 7 (1960) 98-100.
11. K. Mahler, An inequality for the discriminant of a polynomial, Michigan Math. J. 11 (1964) 257-262.
12. V. Pan, Algebraic complexity of computing polynomial zeros, Comput. Math. Appl. 14 (1987) 285-304.
13. S. Plouffe, Approximations de séries génératrices et quelques conjectures. Master's thesis, Université du Québec à Montréal, September 1992. Also available as Research Report 92-61, Laboratoire Bordelais de Recherche en Informatique, Bordeaux, France.
14. R. Rioboo, Real algebraic closure of an ordered field. Implementation in Axiom, in: P.S. Wang, ed., Symbolic and Algebraic Computation, Proceedings of ISSAC'92, Berkeley, July 1992 (ACM Press, New York, 1992) 130-137.
15. M.F. Roy and A. Szpirglas, Complexity of the computation with real algebraic numbers, J. Symbolic Comput. 10 (1990) 39-51..
16. H. Schmidt, Beiträge zu einer Theorie der allgemeinen asymptotischen Darstellungen, Math. Ann. 113 (1936) 629-656.
17. A. Schönhage, The fundamental theorem of algebra in terms of computational complexity, Tech. Rep., Mathematisches Institut der Universität Tübingen, 1982, preliminary report.
18. N.J.A. Sloane, A Handbook of Integer Sequences (Academic Press, New York, 1973).
19. C. Sturm, Mémoire sur la résolution des équations numériques, Institut de France de Sciences Mathématiques et Physiques 6 (1835) 271-318.
20. E.G. Titchmarsh, The Theory of Functions, 2nd edn. (Oxford University Press, Oxford, 1939).