A collection of recent papers reveals that linear barycentric rational interpolation with the weights suggested by Floater and Hormann is a good choice for approximating smooth functions, especially when the interpolation nodes are equidistant. In the latter setting, the Lebesgue constant of this rational interpolation process is known to grow only logarithmically with the number of nodes. But ...

This paper introduces a quasi-interpolation operator for scalarand vector-valued finite element spaces constructed on affine, shape-regular meshes with some continuity across mesh interfaces. This operator gives optimal estimates of the best approximation error in any Lp-norm assuming regularity in the fractional Sobolev spaces W r,p, where p ∈ [1,∞] and the smoothness index r can be arbitraril...

In this paper, a Crank–Nicolson finite difference scheme based on cubic B-spline quasi-interpolation has been derived for the solution of coupled Burgers equations with Caputo–Fabrizio derivative. The first- and second-order spatial derivatives have approximated by first second quasi-interpolation. discrete obtained in way constitutes system algebraic associated bi-pentadiagonal matrix. We show...

Interpolation by translates of \radial" basis functions is optimal in the sense that it minimizes the pointwise error functional among all comparable quasi{interpolants on a certain \native" space of functions F . Since these spaces are rather small for cases where is smooth, we study the behavior of interpolants on larger spaces of the form F 0 for less smooth functions 0. It turns out that in...

We present quasi-linear time systematic encoding algorithms for multiplicity codes. The algorithms have their origins in the fast multivariate interpolation and evaluation algorithms of van der Hoeven and Schost (2013), which we generalise to address certain Hermite-type interpolation and evaluation problems. By providing fast encoding algorithms for multiplicity codes, we remove an obstruction...