Effective asymptotics of linear recurrences with rational coefficients
From MaRDI portal
Publication:1917520
DOI10.1016/0012-365X(95)00133-HzbMath0852.68075MaRDI QIDQ1917520
Publication date: 3 September 1996
Published in: Discrete Mathematics (Search for Journal in Brave)
68R99: Discrete mathematics in relation to computer science
Related Items
Absolute Real Root Separation, FAMILIES OF THUE EQUATIONS ASSOCIATED WITH A RANK ONE SUBGROUP OF THE UNIT GROUP OF A NUMBER FIELD, A technology for reverse-engineering a combinatorial problem from a rational generating function, Absolute Root Separation, On the positivity set of a linear recurrence sequence, Effective bounds for P-recursive sequences, Motif statistics., A comparison of algorithms for proving positivity of linearly recurrent sequences, On the distance between two algebraic numbers, Effective coefficient asymptotics of multivariate rational functions via semi-numerical algorithms for polynomial systems, Regular languages and their generating functions: The inverse problem, Rigorous uniform approximation of D-finite functions using Chebyshev expansions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Suites récurrentes linéaires. Propriétés algébriques et arithmétiques. (Linear recurrent sequences. Algebraic and arithmetic properties)
- Thom's lemma, the coding of real algebraic numbers and the computation of the topology of semi-algebraic sets
- Complexity of computation on real algebraic numbers
- Algebraic complexity of computing polynomial zeros
- Numerics of analytic functions and complexity
- An inequality for the discriminant of a polynomial
- A three-stage variable-shift iteration for polynomial zeros and its relation to generalized Rayleigh iteration
- An application of Jensen's formula to polynomials
- Deux propriétés décidables des suites récurrentes linéaires
- AN EXAMPLE IN THE THEORY OF THE SPECTRUM OF A FUNCTION
