Effective Bounds for P-Recursive Sequences - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Journal of Symbolic Computation Year : 2010

Effective Bounds for P-Recursive Sequences

Marc Mezzarobba
Bruno Salvy

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.

Dates and versions

inria-00376219 , version 1 (17-04-2009)

Identifiers

Cite

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

Collections

INRIA INRIA2
54 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More