<?xml version="1.0" encoding="UTF-8"?>
<collection>
<dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd"><dc:identifier>doi:10.1002/cpe.70305</dc:identifier><dc:language>eng</dc:language><dc:creator>Kjelgaard Mikkelsen, Carl Christian</dc:creator><dc:creator>López-Villellas, Lorién</dc:creator><dc:title>How Accurate is Richardson's Error Estimate?</dc:title><dc:identifier>ART-2025-147865</dc:identifier><dc:description>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.</dc:description><dc:date>2025</dc:date><dc:source>http://zaguan.unizar.es/record/168390</dc:source><dc:doi>10.1002/cpe.70305</dc:doi><dc:identifier>http://zaguan.unizar.es/record/168390</dc:identifier><dc:identifier>oai:zaguan.unizar.es:168390</dc:identifier><dc:relation>info:eu-repo/grantAgreement/ES/AEI/PID2022-136454NB-C22</dc:relation><dc:relation>info:eu-repo/grantAgreement/ES/DGA/T58-23R</dc:relation><dc:identifier.citation>CONCURRENCY AND COMPUTATION-PRACTICE &amp; EXPERIENCE 37, 27-28 (2025), e70305 [23 pp.]</dc:identifier.citation><dc:rights>by-nc</dc:rights><dc:rights>https://creativecommons.org/licenses/by-nc/4.0/deed.es</dc:rights><dc:rights>info:eu-repo/semantics/openAccess</dc:rights></dc:dc>

</collection>