Rigorous uniform approximation of D-finite functions using Chebyshev expansions - Archive ouverte HAL Access content directly
Journal Articles Mathematics of Computation Year : 2017

Rigorous uniform approximation of D-finite functions using Chebyshev expansions

Alexandre Benoit
  • Function : Author
  • PersonId : 958297
Mioara Joldes

Abstract

A wide range of numerical methods exists for computing polynomial approximations of solutions of ordinary differential equations based on Chebyshev series expansions or Chebyshev interpolation polynomials. We consider the application of such methods in the context of rigorous computing (where we need guarantees on the accuracy of the result), and from the complexity point of view. It is well-known that the order-n truncation of the Chebyshev expansion of a function over a given interval is a near-best uniform polynomial approximation of the function on that interval. In the case of solutions of linear differential equations with polynomial coefficients, the coefficients of the expansions obey linear recurrence relations with polynomial coefficients. Unfortunately, these recurrences do not lend themselves to a direct recursive computation of the coefficients, owing among other things to a lack of initial conditions. We show how they can nevertheless be used, as part of a validated process, to compute good uniform approximations of D-finite functions together with rigorous error bounds, and we study the complexity of the resulting algorithms. Our approach is based on a new view of a classical numerical method going back to Clenshaw, combined with a functional enclosure method.
Fichier principal
Vignette du fichier
unifapprox.pdf (691.06 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01022420 , version 1 (10-07-2014)

Licence

CC0 - Public Domain Dedication

Identifiers

Cite

Alexandre Benoit, Mioara Joldes, Marc Mezzarobba. Rigorous uniform approximation of D-finite functions using Chebyshev expansions. Mathematics of Computation, 2017, 86 (305), pp.1303-1341. ⟨hal-01022420⟩
779 View
232 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More