Some new aspects of rational interpolation
Mathematics of Computation
Exponential convergence of a linear rational interpolant between transformed Chebyshev points
Mathematics of Computation
Barycentric rational interpolation with no poles and high rates of approximation
Numerische Mathematik
Numerical Recipes 3rd Edition: The Art of Scientific Computing
Numerical Recipes 3rd Edition: The Art of Scientific Computing
Linear Rational Finite Differences from Derivatives of Barycentric Rational Interpolants
SIAM Journal on Numerical Analysis
Recent advances in linear barycentric rational interpolation
Journal of Computational and Applied Mathematics
A generalized framework for nodal first derivative summation-by-parts operators
Journal of Computational Physics
Hi-index | 0.01 |
In polynomial and spline interpolation the k-th derivative of the interpolant, as a function of the mesh size h, typically converges at the rate of O(h^d^+^1^-^k) as h-0, where d is the degree of the polynomial or spline. In this paper we establish, in the important cases k=1,2, the same convergence rate for a recently proposed family of barycentric rational interpolants based on blending polynomial interpolants of degree d.