Related papers: Barycentric Interpolation Based on Equilibrium Pot…
In this paper, applied strictly monotonic increasing scaled maps, a kind of well-conditioned linear barycentric rational interpolations are proposed to approximate functions of singularities at the origin, such as $x^\alpha$ for $\alpha \in…
When an approximant is accurate on the interval, it is only natural to try to extend it to several-dimensional domains. In the present article, we make use of the fact that linear rational barycentric interpolants converge rapidly toward…
We present a new rational approximation algorithm based on the empirical interpolation method for interpolating a family of parametrized functions to rational polynomials with invariant poles, leading to efficient numerical algorithms for…
We prove the optimal convergence estimate for first order interpolants used in finite element methods based on three major approaches for generalizing barycentric interpolation functions to convex planar polygonal domains. The Wachspress…
In this paper, we consider the particular case of the general rational Hermite interpolation problem where only the value of the function is interpolated at some points, and where the function and its first derivatives agree at the origin.…
Barycentric interpolation is arguably the method of choice for numerical polynomial interpolation. The polynomial interpolant is expressed in terms of function values using the so-called barycentric weights, which depend on the…
Spherical and polar geometries arise in many important areas of computational science, including weather and climate forecasting, optics, and astrophysics. In these applications, tensor-product grids are often used to represent unknowns.…
In this paper, we propose a novel dual-based Lawson's method, termed {b-d-Lawson}, designed for addressing the rational minimax approximation under specific interpolation conditions. The {b-d-Lawson} approach incorporates two pivotal…
A new application of subspaces interpolation for the construction of nonlinear Parametric Reduced Order Models (PROMs) is proposed. This approach is based upon the Riemannian geometry of the manifold formed by the quotient of the set of…
The $\ell_2-$ and $\ell_1-$regularized modified Lagrange interpolation formulae over $[-1,1]$ are deduced in this paper. This paper mainly analyzes the numerical characteristics of regularized barycentric interpolation formulae, which are…
In this paper, we focus on barycentric weights and Lebesgue constants for Lagrange interpolation of arbitrary node distributions on \([-1,1]\). The following three main works are included: estimates of upper and lower bounds on the…
Computing rational minimax approximations can be very challenging when there are singularities on or near the interval of approximation - precisely the case where rational functions outperform polynomials by a landslide. We show that far…
The development of high-degree interpolation polynomials which use the values of the function and its subsequent derivatives is reformulated. Also, we present a variant of new formula in barycentric form.
We show that highly accurate approximations can often be obtained from constructing Thiele interpolating continued fractions by a Greedy selection of the interpolation points together with an early termination condition. The obtained…
Each point of a simplex is expressed as a unique convex combination of the vertices. The coefficients in the combination are the barycentric coordinates of the point. For each point in a general convex polytope, there may be multiple…
We consider regular polynomial interpolation algorithms on recursively defined sets of interpolation points which approximate global solutions of arbitrary well-posed systems of linear partial differential equations. Convergence of the…
An algorithm for generating interpolants for formulas which are conjunctions of quadratic polynomial inequalities (both strict and nonstrict) is proposed. The algorithm is based on a key observation that quadratic polynomial inequalities…
This paper presents an efficient method to compute the maximum likelihood (ML) estimation of the parameters of a complex 2-D sinusoidal, with the complexity order of the FFT. The method is based on an accurate barycentric formula for…
We propose a new embedding method which is particularly well-suited for settings where the sample size greatly exceeds the ambient dimension. Our technique consists of partitioning the space into simplices and then embedding the data points…
Let $z_{1},\ldots,z_{K}$ be distinct grid points. If $f_{k,0}$ is the prescribed value of a function at the grid point $z_{k}$, and $f_{k,r}$ the prescribed value of the $r$\foreignlanguage{american}{-th} derivative, for $1\leq r\leq…