Rounding Error Analysis of Linear Recurrences Using Generating Series

11/02/2020
by   Marc Mezzarobba, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/09/2016

Arb: Efficient Arbitrary-Precision Midpoint-Radius Interval Arithmetic

Arb is a C library for arbitrary-precision interval arithmetic using the...
research
04/15/2020

On the Complexity of the Plantinga-Vegter Algorithm

We introduce a general toolbox for precision control and complexity anal...
research
04/20/2022

Development of linear functional arithmetic and its applications to the solution of interval linear systems with constraints

The work is devoted to the construction of a new interval arithmetic whi...
research
05/10/2019

Integrality and arithmeticity of solvable linear groups

We develop a practical algorithm to decide whether a finitely generated ...
research
07/08/2019

A fast simple algorithm for computing the potential of charges on a line

We present a fast method for evaluating expressions of the form u_j = ∑...
research
10/26/2022

Development of linear functional arithmetic and its application to solving problems of interval analysis

The work is devoted to the construction of a new type of intervals – fun...

Please sign up or login with your details

Forgot password? Click here to reset