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 suggest that the Lebesgue constant behaves similarly for interpolation at Chebyshev as well as logarithmically distributed nodes.
On the Lebesgue constant of Berrut's rational interpolant at equidistant nodes
DE MARCHI, STEFANO;
2011
Abstract
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 suggest that the Lebesgue constant behaves similarly for interpolation at Chebyshev as well as logarithmically distributed nodes.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
JCAM11.pdf
Accesso riservato
Tipologia:
Published (Publisher's Version of Record)
Licenza:
Accesso privato - non pubblico
Dimensione
432.13 kB
Formato
Adobe PDF
|
432.13 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.




