How Accurate is Richardson's Error Estimate?
ABSTRACT We consider the fundamental problem of estimating the difference between the exact value and approximations that depend on a single real parameter . It is well‐known that if the error satisfies an asymptotic expansion, then we can use Richardson extrapolation to approximate . In this paper, our primary concern is the accuracy of Richardson's error estimate , that is, the size of the relative error . In practice, the computed value is different from the exact value . We show how to determine when the computational error is irrelevant and how to estimate the accuracy of Richardson's error estimate in terms of Richardson's fraction . We establish monotone convergence theorems and derive upper and lower bounds for in terms of and . We classify asymptotic error expansions according to their practical value rather than the order of the primary error term. We present a sequence of numerical experiments that illustrate the theory. Weierstrass's function is used to define a sequence of smooth problems for which it is impractical to apply Richardson's techniques.
Authors
- Carl Christian Kjelgaard Mikkelsen (ORCID: https://orcid.org/0000-0002-9158-1941)
- Lorién López‐Villellas (ORCID: https://orcid.org/0000-0002-1891-4359)
Institutions
- Universidad de Zaragoza (ES)
- Umeå University (SE)
Publication Details
- Journal
- Concurrency and Computation Practice and Experience
- Published
- 2025-11-10
- DOI
- https://doi.org/10.1002/cpe.70305
- Primary Topic
- Numerical Methods and Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- Gobierno de Aragón
- Agencia Estatal de Investigación