Efficient and accurate computation of upper bounds of approximation errors - ENS de Lyon - École normale supérieure de Lyon
Journal Articles Theoretical Computer Science Year : 2011

Efficient and accurate computation of upper bounds of approximation errors

Sylvain Chevillard
Cryptology, Arithmetic: Hardware and Software
John Harrison
  • Function : Author
  • PersonId : 865917
INTEL
Mioara Maria Joldes
Computer arithmetic
Christoph Lauter
INTEL

Abstract

For purposes of actual evaluation, mathematical functions f are commonly replaced by approximation polynomials p. Examples include floating-point implementations of elementary functions, quadrature or more theoretical proof work involving transcendental functions. Replacing f by p induces a relative error epsilon = p/f - 1. In order to ensure the validity of the use of p instead of f, the maximum error, i.e. the supremum norm of epsilon must be safely bounded above. Numerical algorithms for supremum norms are efficient but cannot offer the required safety. Previous validated approaches often require tedious manual intervention. If they are automated, they have several drawbacks, such as the lack of quality guarantees. In this article a novel, automated supremum norm algorithm with a priori quality is proposed. It focuses on the validation step and paves the way for formally certified supremum norms. Key elements are the use of intermediate approximation polynomials with bounded approximation error and a non-negativity test based on a sum-of-squares expression of polynomials. The new algorithm was implemented in the Sollya tool. The article includes experimental results on real-life examples.

Domains

Computer Arithmetic
Fichier principal
Vignette du fichier
RRLIP2010-2.pdf (919.25 Ko) Télécharger le fichier
README (2.31 Ko) Télécharger le fichier
example1.sollya (251 B) Télécharger le fichier
example10.sollya (279 B) Télécharger le fichier
example2.sollya (387 B) Télécharger le fichier
example3.sollya (1.01 Ko) Télécharger le fichier
example4.sollya (251 B) Télécharger le fichier
example5.sollya (249 B) Télécharger le fichier
example6.sollya (249 B) Télécharger le fichier
example7.sollya (257 B) Télécharger le fichier
example8.sollya (243 B) Télécharger le fichier
example9.sollya (212 B) Télécharger le fichier
sos.sollya (4.24 Ko) Télécharger le fichier
supnorm.sollya (15.43 Ko) Télécharger le fichier
supnormtest.sollya (1.39 Ko) Télécharger le fichier
unisos.gp (8.13 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Format Other
Format Other
Format Other
Format Other
Format Other
Format Other
Format Other
Format Other
Format Other
Format Other
Format Other
Format Other
Format Other
Format Other
Format Other

Mioara Joldes  : Connect in order to contact the contributor

https://ens-lyon.hal.science/ensl-00445343

Submitted on : Wednesday, July 14, 2010-12:29:31 AM

Last modification on : Tuesday, November 12, 2024-3:20:06 PM

Long-term archiving on : Friday, October 15, 2010-3:16:14 PM

Download

Dates and versions

ensl-00445343 , version 1 (08-01-2010)
ensl-00445343 , version 2 (14-07-2010)

Identifiers

Cite

Sylvain Chevillard, John Harrison, Mioara Maria Joldes, Christoph Lauter. Efficient and accurate computation of upper bounds of approximation errors. Theoretical Computer Science, 2011, 412 (16), pp.1523-1543. ⟨10.1016/j.tcs.2010.11.052⟩. ⟨ensl-00445343v2⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

ENS-LYON CNRS INRIA UNIV-LYON1 UNIV-LORRAINE INRIA2 LORIA LORIA-ALGO UDL
722 View
1533 Download

Altmetric

Share

More