On the Lebesgue constant of Berrut’s rational interpolant at equidistant nodes

  • Bos, Len Department of Computer Science, University of Verona, Italy
  • De Marchi, Stefano Department of Pure and AppliedMathematics, University of Padua, Italy
  • Hormann, Kai Facoltà di scienze informatiche, Università della Svizzera italiana, Svizzera

7 p.

German It is well known that polynomial interpolation at equidistant nodes can give bad approximation results and that rational interpolation is a promising alternative in this setting. In this paper we confirm this observation by proving that the Lebesgue constant of Berrut’s rational interpolant grows only logarithmically in the number of interpolation nodes. Moreover, the numerical results show that the Lebesgue constant behaves similarly for interpolation at Chebyshev as well as logarithmically distributed nodes.
  • English
Computer science and technology
License undefined
  • RERO DOC 22101
  • ARK ark:/12658/srd1318246
Persistent URL

Document views: 29 File downloads:
  • ITR1101.pdf: 48