26879 articles – 20542 references  [version française]
Detailed view Preprint, Working Paper, ...
Available versions:
Attached file list to this document: 
RRLIP2010-13.pdf(753.8 KB)
Chebyshev Interpolation Polynomial-based Tools for Rigorous Computing
Nicolas Brisebarre1, 2, Mioara Maria Joldes1, 2

Performing numerical computations, yet being able to provide rigorous mathematical statements about the obtained result, is required in many domains like global optimization, ODE solving or integration. Taylor models, which associate to a function a pair made of a Taylor approximation polynomial and a rigorous remainder bound, are a widely used rigorous computation tool. This approach benefits from the advantages of numerical methods, but also gives the ability to make reliable statements about the approximated function. Despite the fact that approximation polynomials based on interpolation at Chebyshev nodes offer a quasi-optimal approximation to a function, together with several other useful features, an analogous to Taylor models, based on such polynomials, has not been yet well-established in the field of validated numerics. This paper presents a preliminary work for obtaining such interpolation polynomials together with validated interval bounds for approximating univariate functions. We propose two methods that make practical the use of this: one is based on a representation in Newton basis and the other uses Chebyshev polynomial basis. We compare the quality of the obtained remainders and the performance of the approaches to the ones provided by Taylor models.
1:  Inria Grenoble Rhône-Alpes / LIP Laboratoire de l'Informatique du Parallélisme - ARENAIRE
2:  LIP - Laboratoire de l'Informatique du Parallélisme
Rigorous Computing – Validated Numerics – Interpolation Polynomial – Chebyshev Polynomials – Taylor Models