Efficient and accurate computation of upper bounds of approximation errors

21Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.

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 =pf-1. In order to ensure the validity of the use of p instead of f, the maximum error, i.e. the supremum norm ||||∞I must be safely bounded above over an interval I, whose width is typically of order 1. Numerical algorithms for supremum norms are efficient, but they 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 on univariate approximation errors is proposed, achieving an a priori quality on the result. 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. © 2010 Elsevier B.V. All rights reserved.

Cite

CITATION STYLE

APA

Chevillard, S., Harrison, J., Joldeş, M., & Lauter, C. (2011). Efficient and accurate computation of upper bounds of approximation errors. In Theoretical Computer Science (Vol. 412, pp. 1523–1543). https://doi.org/10.1016/j.tcs.2010.11.052

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free