# Effective Bounds for P-Recursive Sequences

1 ALGORITHMS - Algorithms
Inria Paris-Rocquencourt
Abstract : We describe an algorithm that takes as input a complex sequence $(u_n)$ given by a linear recurrence relation with polynomial coefficients along with initial values, and outputs a simple explicit upper bound $(v_n)$ such that $|u_n| \leq v_n$ for all $n$. Generically, the bound is tight, in the sense that its asymptotic behaviour matches that of $u_n$. We discuss applications to the evaluation of power series with guaranteed precision.
Type de document :
Article dans une revue
Journal of Symbolic Computation, Elsevier, 2010, 45 (10), pp.1075-1096. 〈10.1016/j.jsc.2010.06.024〉
Domaine :

https://hal.inria.fr/inria-00376219
Contributeur : Bruno Salvy <>
Soumis le : vendredi 17 avril 2009 - 09:13:29
Dernière modification le : vendredi 25 mai 2018 - 12:02:05

### Citation

Marc Mezzarobba, Bruno Salvy. Effective Bounds for P-Recursive Sequences. Journal of Symbolic Computation, Elsevier, 2010, 45 (10), pp.1075-1096. 〈10.1016/j.jsc.2010.06.024〉. 〈inria-00376219〉

### Métriques

Consultations de la notice