@article{MEZZAROBBA20101075,
Abstract = {We describe an algorithm that takes as input a complex sequence (un) given by a linear recurrence relation with polynomial coefficients along with initial values, and outputs a simple explicit upper bound (vn) such that |un|≤vn for all n. Generically, the bound is tight, in the sense that its asymptotic behaviour matches that of un. We discuss applications to the evaluation of power series with guaranteed precision.},
Author = {Mezzarobba, Marc and Salvy, Bruno},
File = {Effective bounds for P-recursive sequences - 1-s2.0-S0747717110001045-main - a - a - a - p.pdf},
ISSN = {0747-7171},
Journal = {Journal of Symbolic Computation},
Keywords = {Algorithm, Bounds, Cauchy--Kovalevskaya majorant, Certified evaluation, Holonomic functions},
Number = {10},
Pages = {1075 - 1096},
Title = {Effective bounds for P-recursive sequences},
URL = {http://www.sciencedirect.com/science/article/pii/S0747717110001045},
Volume = {45},
Year = {2010},
bdsk-url-1 = {http://www.sciencedirect.com/science/article/pii/S0747717110001045},
bdsk-url-2 = {https://doi.org/10.1016/j.jsc.2010.06.024},
date-added = {2020-03-01 11:13:33 +0100},
date-modified = {2020-03-01 11:13:33 +0100},
doi = {10.1016/j.jsc.2010.06.024}
}
Library Size: 13G (12942 entries),
Last Updated: Apr 05, 2026, 08:41:35,
Build Time: N/A