From numerical quadrature to Padé approximation

  • Authors:
  • C. Brezinski

  • Affiliations:
  • Laboratoire Paul Painlevé, UMR CNRS 8524, UFR de Mathématiques Pures et Appliquées, Université des Sciences et Technologies de Lille, 59655-Villeneuve d'Ascq cedex, France

  • Venue:
  • Applied Numerical Mathematics
  • Year:
  • 2010

Quantified Score

Hi-index 0.01

Visualization

Abstract

The paper reviews the relation between Pade-type approximants of a power series and interpolatory quadrature formulae with free nodes, and between Pade approximants and Gaussian quadrature methods. Then, it is shown how the Kronrod procedure and the anti-Gaussian quadrature methods could be used for estimating the error in Pade approximation. The @e-algorithm for accelerating the convergence of sequences, and computing recursively Pade approximants is evoked, and its error estimated by the same procedures. Finally, the case of series of functions is considered. Considerations on further research topics end the paper.