The barycentric interpolation formula defines a stable algorithm for evaluation at points in [−1, 1] of polynomial interpolants through data on Chebyshev grids. Here it is shown that for evaluation at points in the complex plane outside [−1, 1], the algorithm becomes unstable and should be replaced by the alternative modified Lagrange or "first barycentric" formula dating to Jacobi in 1825. This difference in stability confirms the theory published by N. J. Higham in 2004 (IMA J. Numer. Anal., v. 24) and has practical consequences for computation with rational functions
Barycentric rational Floater–Hormann interpolants compare favourably to classical polynomial interpo...
AbstractPointwise error estimates are obtained for polynomial interpolants in the roots and extrema ...
The Lagrange representation of the interpolating polynomial can be rewritten in two more computation...
Abstract. The barycentric interpolation formula defines a stable algorithm for evaluation at points ...
The barycentric interpolation formula defines a stable algorithm for evaluation at points in $[-1,1]...
Barycentric interpolation is a variant of Lagrange polynomial interpolation that is fast and stable....
We consider the numerical stability of the second barycentric formula for evaluation at points in [0...
We present a method for asymptotically monitoring poles to a rational interpolant written in barycen...
Well-conditioned, stable and infinitely smooth interpolation in arbitrary nodes is by no means a tri...
The barycentric forms of polynomial and rational interpolation have recently gained popularity, beca...
The barycentric forms of polynomial and rational interpolation have recently gained popularity, beca...
The barycentric forms of polynomial and rational interpolation have recently gained popularity, beca...
O problema de reconstruir uma função f a partir de um número finito de valores conhecidos f(x0), f(...
It is well known that the classical polynomial interpolation gives bad approximation if the nodes ar...
AbstractWe improve upon the method of Zhu and Zhu [A method for directly finding the denominator val...
Barycentric rational Floater–Hormann interpolants compare favourably to classical polynomial interpo...
AbstractPointwise error estimates are obtained for polynomial interpolants in the roots and extrema ...
The Lagrange representation of the interpolating polynomial can be rewritten in two more computation...
Abstract. The barycentric interpolation formula defines a stable algorithm for evaluation at points ...
The barycentric interpolation formula defines a stable algorithm for evaluation at points in $[-1,1]...
Barycentric interpolation is a variant of Lagrange polynomial interpolation that is fast and stable....
We consider the numerical stability of the second barycentric formula for evaluation at points in [0...
We present a method for asymptotically monitoring poles to a rational interpolant written in barycen...
Well-conditioned, stable and infinitely smooth interpolation in arbitrary nodes is by no means a tri...
The barycentric forms of polynomial and rational interpolation have recently gained popularity, beca...
The barycentric forms of polynomial and rational interpolation have recently gained popularity, beca...
The barycentric forms of polynomial and rational interpolation have recently gained popularity, beca...
O problema de reconstruir uma função f a partir de um número finito de valores conhecidos f(x0), f(...
It is well known that the classical polynomial interpolation gives bad approximation if the nodes ar...
AbstractWe improve upon the method of Zhu and Zhu [A method for directly finding the denominator val...
Barycentric rational Floater–Hormann interpolants compare favourably to classical polynomial interpo...
AbstractPointwise error estimates are obtained for polynomial interpolants in the roots and extrema ...
The Lagrange representation of the interpolating polynomial can be rewritten in two more computation...