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

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.