Rounding Error Analysis of Linear Recurrences Using Generating Series
arXiv:2011.00827 · doi:10.1553/etna_vol58s196
Abstract
We develop a toolbox for the error analysis of linear recurrences with constant or polynomial coefficients, based on generating series, Cauchy's method of majorants, and simple results from analytic combinatorics. We illustrate the power of the approach by several nontrivial application examples. Among these examples are a new worst-case analysis of an algorithm for computing Bernoulli numbers, and a new algorithm for evaluating differentially finite functions in interval arithmetic while avoiding interval blow-up.
References in corpus (5)
- Wave Equation Numerical Resolution: a Comprehensive Mechanized Proof of a C Program
- Effective Bounds for P-Recursive Sequences
- Rigorous Multiple-Precision Evaluation of D-Finite Functions in SageMath
- Fast computation of Bernoulli, Tangent and Secant numbers
- Unrestricted algorithms for elementary and special functions