It is well known that the classical polynomial interpolation gives bad approximation if the nodes are equispaced. A valid alternative is the family of barycentric rational interpolants introduced by Berrut in [4], analyzed in terms of stability by Berrut and Mittelmann in [5] and their extension done by Floater and Hormann in [8]. In this paper firstly we extend them to the trigonometric case, then as in the Floater-Hormann classical interpolant, we study the growth of the Lebesgue constant on equally spaced points. We show that the growth is logarithmic providing a stable interpolation operato
We show that the Lebesgue constant for barycentric rational interpolation at equally spaced points o...
Linear barycentric rational interpolants are a particular kind of rational interpolants, defined by ...
We show that the Lebesgue constant for Berrut's rational interpolant at equally spaced points has lo...
A well-known result in linear approximation theory states that the norm of the operator, known as th...
Barycentric rational Floater–Hormann interpolants compare favourably to classical polynomial interpo...
It is well known that polynomial interpolation at equidistant nodes can give bad approximation resul...
AbstractIt is well known that polynomial interpolation at equidistant nodes can give bad approximati...
Recent results reveal that the family of barycentric rational interpolants introduced by Floater and...
A collection of recent papers reveals that linear barycentric rational interpolation with the weight...
Well-conditioned, stable and infinitely smooth interpolation in arbitrary nodes is by no means a tri...
A collection of recent papers reveals that linear barycentric rational interpolation with the weight...
AbstractIt is well known that polynomial interpolation at equidistant nodes can give bad approximati...
It is well known that polynomial interpolation at equidistant nodes can give bad approximation resul...
Lagrange interpolation is a classical method for approximating a continuous function by a polynomia...
AbstractPolynomial interpolation between large numbers of arbitrary nodes does notoriously not, in g...
We show that the Lebesgue constant for barycentric rational interpolation at equally spaced points o...
Linear barycentric rational interpolants are a particular kind of rational interpolants, defined by ...
We show that the Lebesgue constant for Berrut's rational interpolant at equally spaced points has lo...
A well-known result in linear approximation theory states that the norm of the operator, known as th...
Barycentric rational Floater–Hormann interpolants compare favourably to classical polynomial interpo...
It is well known that polynomial interpolation at equidistant nodes can give bad approximation resul...
AbstractIt is well known that polynomial interpolation at equidistant nodes can give bad approximati...
Recent results reveal that the family of barycentric rational interpolants introduced by Floater and...
A collection of recent papers reveals that linear barycentric rational interpolation with the weight...
Well-conditioned, stable and infinitely smooth interpolation in arbitrary nodes is by no means a tri...
A collection of recent papers reveals that linear barycentric rational interpolation with the weight...
AbstractIt is well known that polynomial interpolation at equidistant nodes can give bad approximati...
It is well known that polynomial interpolation at equidistant nodes can give bad approximation resul...
Lagrange interpolation is a classical method for approximating a continuous function by a polynomia...
AbstractPolynomial interpolation between large numbers of arbitrary nodes does notoriously not, in g...
We show that the Lebesgue constant for barycentric rational interpolation at equally spaced points o...
Linear barycentric rational interpolants are a particular kind of rational interpolants, defined by ...
We show that the Lebesgue constant for Berrut's rational interpolant at equally spaced points has lo...