Journal
JOURNAL OF SYMBOLIC COMPUTATION
Volume 45, Issue 10, Pages 1075-1096Publisher
ACADEMIC PRESS LTD- ELSEVIER SCIENCE LTD
DOI: 10.1016/j.jsc.2010.06.024
Keywords
Algorithm; Bounds; Cauchy-Kovalevskaya majorant; Certified evaluation; Holonomic functions
Funding
- Joint Inria-Microsoft research laboratory
Ask authors/readers for more resources
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 vertical bar u(n)vertical bar <= 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. (C) 2010 Elsevier Ltd. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available