Certified and fast computation of supremum norms of approximation errors

Proceedings - Symposium on Computer Arithmetic

Volumn , Issue , 2009, Pages 169-176

  Chevillard, Sylvain ^a   Joldes, Mioara ^a   Lauter, Christoph ^a  

^a UNIVERSITÉ DE LYON   (France)

Author keywords

Approximation error; Automatic algorithmic differentiation; Certified computation; Elementary function; Interval arithmetic; Roots isolation technique; Supremum infinity norm

Indexed keywords

APPROXIMATION ERROR; AUTOMATIC/ALGORITHMIC DIFFERENTIATION; CERTIFIED COMPUTATION; ELEMENTARY FUNCTION; INTERVAL ARITHMETIC; ROOTS ISOLATION TECHNIQUE; SUPREMUM/INFINITY NORM;

ERRORS; POLYNOMIAL APPROXIMATION;

APPROXIMATION ALGORITHMS;

EID: 70350749454     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ARITH.2009.18     Document Type: Conference Paper

References (21)

1. C. Bendsten and O. Stauning. TADIFF, a Flexible C++ Package for Automatic Differentiation Using Taylor Series. Technical Report 1997-x5-94, Technical University of Denmark, April 1997.
2. R. P. Brent. Algorithms for minimization without derivatives. Prentice-Hall, 1973.
3. F. Broglia, editor. Lectures in Real Geometry, volume 23 of Expositions in Mathematics, pages 1-67. de Gruyter, 1996.
4. E. W. Cheney. Introduction to Approximation Theory. McGraw-Hill, 1966.
5. S. Chevillard and C. Lauter. A certified infinite norm for the implementation of elementary functions. In Proc. of the 7th International Conference on Quality Software, pages 153-160, 2007.
6. M. Daumas, G. Melquiond, and C. Mũnoz. Guaranteed proofs using interval arithmetic. In Proc. of the 17th IEEE Symp. on Comp. Arithmetic, pages 188-195, 2005.
7. E. Hansen. Global optimization using interval analysis. Marcel Dekker, 1992.
8. J. Harrison. Verifying nonlinear real formulas via sums of squares. In Proc. of the 20th International Conference on Theorem Proving in Higher Order Logics, TPHOLs 2007, pages 102-118. Springer-Verlag, 2007.
9. W. Hofschuster and W. Krämer. FI LIB, eine schnelle und portable Funktionsbibliothek für reelle Argumente und reelle Intervalle im IEEE-double-Format. Technical Report 98/7, Universität Karlsruhe, 1998.
10. IEEE Computer Society. IEEE Standard for Floating-Point Arithmetic. IEEE Std 754™-2008
11. R. B. Kearfott. Globsol: History, composition, and advice on use. In Global Optimization and Constraint Satisfaction, Lecture Notes in Computer Science, pages 17-31. Springer-Verlag, 2003.
12. V. Lef̀evre and J.-M. Muller. Worst cases for correct rounding of the elementary functions in double precision. In Proc. of the 15th IEEE Symp. on Comp. Arithmetic, pages 111- 118, 2001.
13. G. Melquiond. Floating-point arithmetic in the Coq system. In Proc. of the 8th Conference on Real Numbers and Computers, pages 93-102, 2008.
14. F. Messine. Ḿethodes d'optimisation globale baśees sur l'analyse d'intervalle pour la ŕesolution de probl̀emes avec contraintes. PhD thesis, INP de Toulouse, 1997.
15. R. E. Moore. Methods and Applications of Interval Analysis. Society for Industrial Mathematics, 1979.
16. M. Neher. ACETAF: A software package for computing validated bounds for Taylor coefficients of analytic functions. ACM Trans. on Math. Software, 2003.
17. N. Revol. Newton's algorithm using multiple precision interval arithmetic. Numerical Algorithms, 34(2):417-426, 2003.
18. F. Rouillier and P. Zimmermann. Efficient isolation of a polynomial real roots. Technical Report 4113, INRIA, 2001.
19. F. Rouillier and P. Zimmermann. Efficient isolation of polynomial's real roots. Journal of Computational and Applied Mathematics, 162(1):33-50, 2004.
20. J. van der Hoeven. On effective analytic continuation. Mathematics in Computer Science, 1(1):111-175, 2007.
21. R. Zumkeller. Formal Global Optimization with Taylor Models. In Proc. of the 4th International Joint Conference on Automated Reasoning, pages 408-422, 2008.