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

Institutions

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

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

How Accurate is Richardson's Error Estimate?

Carl Christian Kjelgaard Mikkelsen, Lorién López‐Villellas
Concurrency and Computation Practice and Experience
Numerical Methods and Algorithms
article

How Accurate is Richardson's Error Estimate?

Carl Christian Kjelgaard Mikkelsen, Lorién López‐Villellas
article en

Abstract

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.

Concurrency and Computation Practice and ExperienceVol. 37(27-28)
Universidad de Zaragoza (ES), Umeå University (SE)
Gobierno de Aragón, Agencia Estatal de Investigación
Openalex Percentile: Top 63%
Numerical Methods and Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

How Accurate is Richardson's Error Estimate? — Carl Christian Kjelgaard Mikkelsen, Lorién López‐Villellas · Concurrency and Computation Practice and Experience (2025) | TGRS Research Map | TGRS