Rounding error analysis of linear recurrences using generating series
From MaRDI portal
Publication:6163326
DOI10.1553/etna_vol58s196zbMath1512.65082arXiv2011.00827MaRDI QIDQ6163326
Publication date: 9 June 2023
Published in: ETNA. Electronic Transactions on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2011.00827
Bernoulli numberscomplex variablevibrating stringmajorant seriesrounding errorrigorous computingdifferentially finite function
Exact enumeration problems, generating functions (05A15) Roundoff error (65G50) Error bounds for numerical methods for ordinary differential equations (65L70) Numerical aspects of recurrence relations (65Q30)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Wave equation numerical resolution: a comprehensive mechanized proof of a C program
- Effective bounds for P-recursive sequences
- Evaluation of Chebyshev polynomials by a three-term recurrence in floating-point arithmetic
- On the numerical evaluation of linear recurrences
- Truncation bounds for differentially finite series
- Linear differential equations as a data structure
- Trusting computations: a mechanized proof from partial differential equations to actual program
- Explicit a-priori error bounds and adaptive error control for approximation of nonlinear initial value differential systems
- On location and approximation of clusters of zeros of analytic functions
- Relative error propagation in the recursive solution of linear recurrence relations
- Ore Polynomials in Sage
- Modern Computer Arithmetic
- John von Neumann's Analysis of Gaussian Elimination and the Origins of Modern Numerical Analysis
- Floats and Ropes: A Case Study for Formal Numerical Program Verification
- Unrestricted algorithms for elementary and special functions
- Fast and Rigorous Arbitrary-Precision Computation of Gauss--Legendre Quadrature Nodes and Weights
- Accuracy and Stability of Numerical Algorithms
- Tensor Product B-Spline Mesh Generation for Accurate Surface Visualizations in the NIST Digital Library of Mathematical Functions
- A New Approach to Probabilistic Rounding Error Analysis
- The Holonomic Toolkit
- Error analysis of an algorithm for summing certain finite series
- Forward computation in second order difference equations†
- Error Analysis of Miller's Recurrence Algorithm
- Fast Computation of Bernoulli, Tangent and Secant Numbers
- Numerical inverting of matrices of high order
- ROUNDING-OFF ERRORS IN MATRIX PROCESSES
- Rounding error bounds for the Clenshaw and Forsythe algorithms for the evaluation of orthogonal polynomial series
This page was built for publication: Rounding error analysis of linear recurrences using generating series