Well-conditioned, stable and infinitely smooth interpolation in arbitrary nodes is by no means
a trivial task, even in the univariate setting considered here; already the most important case …

Barycentric Lagrange Interpolation Page 1 SIAM REVIEW c 2004 Society for Industrial and
Applied Mathematics Vol. 46, No. 3, pp. 501–517 Barycentric Lagrange Interpolation ∗ Jean-Paul …

It is well known that rational interpolation sometimes gives better approximations than
polynomial interpolation, especially for large sequences of points, but it is difficult to control …

One of the major challenges in using distributed learning to train complicated models with
large data sets is to deal with stragglers effect. As a solution, coded computation has been …

EXPONENTIAL CONVERGENCE OF A LINEAR RATIONAL INTERPOLANT BETWEEN
TRANSFORMED CHEBYSHEV POINTS Introduction Let f be a complex fu Page 1 …

In this work we propose a new method for univariate polynomial interpolation based on what
we call mapped bases. As theoretically shown, constructing the interpolating function via the …

Derivatives of polynomial interpolants lead in a natural way to approximations of derivatives
of the interpolated function, eg, through finite differences. We extend a study of the …

In this paper, two applications of linear barycentric rational interpolation are used to derive a
difference-quadrature scheme for solving a class of systems of Volterra integro-differential …

In this paper, the linear barycentric rational interpolation collocation method for solving one‐
and two‐dimensional telegraph equation is presented. The barycentric rational interpolation …

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 …