Related papers: On Waldron Interpolation on a Simplex in $\mathbb{…
The problem of interpolation at $(n+1)^2$ points on the unit sphere $\mathbb{S}^2$ by spherical polynomials of degree at most $n$ is proved to have a unique solution for several sets of points. The points are located on a number of circles…
It is well known that one can find a rational normal curve in $\mathbb P^n$ through $n+3$ general points. We prove a generalization of this to higher dimensional varieties, showing that smooth varieties of minimal degree can be interpolated…
In some fields such as Mathematics Mechanization, automated reasoning and Trustworthy Computing etc., exact results are needed. Symbolic computations are used to obtain the exact results. Symbolic computations are of high complexity. In…
The techniques for polynomial interpolation and Gaussian quadrature are generalized to matrix-valued functions. It is shown how the zeros and rootvectors of matrix orthonormal polynomials can be used to get a quadrature formula with the…
A rule for constructing interpolation nodes for $n$th degree polynomials on the simplex is presented. These nodes are simple to define recursively from families of 1D node sets, such as the Lobatto-Gauss-Legendre (LGL) nodes. The resulting…
In the space of all entire functions it is solved the problem of interpolation taking into account multiplicities by sums of the series of exponentials with the exponents from a given set. It is found a criterion of solubility of the…
In recent years many efforts have been devoted to finding bidiagonal factorizations of nonsingular totally positive matrices, since their accurate computation allows to numerically solve several important algebraic problems with great…
Under consideration methods of constructing trigonometric interpolation splines of two variables on rectangular areas. These methods are easily generalized to the case of trigonometric interpolation splines of several variables on such…
Interpolation theory for complex polynomials is well understood. In the non-commutative quaternionic setting, the polynomials can be evaluated "on the left" and "on the right". If the interpolation problem involves interpolation conditions…
The binomial interpolated transform of a sequence is a generalization of the well-known binomial transform. We examine a Pascal-like triangle, on which a binomial interpolated transform works between the left and right diagonals, focusing…
Using a lemma of Davis on Gram matrices applied to the classical Orthogonal Polynomials to generate reproducing kernel interpolation over the classical domains for polynomials. These kernels have terms which are exact over the rational…
For a division ring $\mathbb F$, the polynomials $f\in\mathbb F$ can be evaluated "on the left" and "on the right" giving rise to left and right Lagrange interpolation problems. The problems containig interpolation conditions of the same…
We show that the Lagrange interpolation polynomials are biorthogonal with respect to a set of rational functions whose poles coinicde with interpolation points
Using algebraic methods, and motivated by the one variable case, we study a multipoint interpolation problem in the setting of several complex variables. The duality realized by the residue generator associated with an underlying Gorenstein…
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…
Given a convergent sequence of nodes we present a one-dimensional-holomorphic-function version of the Newton interpolation method of polynomials. It also generalises the Taylor and the Laurent formula. In other words, we present an…
An interpolation problem related to the elliptic Painlev\'e equation is formulated and solved. A simple form of the elliptic Painlev\'e equation and the Lax pair are obtained. Explicit determinant formulae of special solutions are also…
In this paper we investigate polynomial interpolation using orthogonal polynomials. We use weight functions associated with orthogonal polynomials to define a weighted form of Lagrange interpolation. We introduce an upper bound of error…
Using polynomial interpolation, along with structural properties of the family of positive real rational functions, we here show that a set of m nodes in the open left half of the complex plane, can always be mapped to anywhere in the…
A systematic construction of higher order splines using two hierarchies of polynomials is presented. Explicit instructions on how to implement one of these hierarchies are given. The results are limited to interpolations on regular,…