Related papers: On Planar Polynomial Geometric Interpolation
The classical polynomial interpolation problem in several variables can be generalized to the case of points with greater multiplicities. What is known, as yet, is essentially concentrated in the Alexander-Hirschowitz Theorem which says…
We consider Fokker-Planck equations that interpolate a pair of supersymmetrically related Fokker-Planck equations with constant coefficients. Based on the interesting property of shape-invariance, various one-parameter interpolations of the…
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…
This paper aims at developing new shape functions adapted to smooth vanishing coefficients for scalar wave equation. It proposes the numerical analysis of their interpolation properties. The interpolation is local but high order convergence…
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…
The problem of the optimal approximation of circular arcs by parametric polynomial curves is considered. The optimality relates to the Hausdorff distance and have not been studied yet in the literature. Parametric polynomial curves of low…
Polypols are natural generalizations of polytopes, with boundaries given by nonlinear algebraic hypersurfaces. We describe polypols in the plane and in 3-space that admit a unique adjoint hypersurface and study them from an…
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 usual univariate interpolation problem of finding a monic polynomial f of degree n that interpolates n given values is well understood. This paper studies a variant where f is required to be composite, say, a composition of two…
We give here some precisions and improvements about the validity of the explicit reconstruction of any holomorphic function on a ball of $\mathbb{C}^2$ from its restrictions on a family of complex lines. Such validity depends on the mutual…
To the best of our knowledge this paper is the first attempt to introduce and study polynomial interpolation of the polynomial data given on arbitrary varieties. In the first part of the paper we present results on the solvability of such…
The essence of Stahl-Gonchar-Rakhmanov theory of symmetric contours as applied to the multipoint Pad\'e approximants is the fact that given a germ of an algebraic function and a sequence of rational interpolants with free poles of the germ,…
In contrast to the univariate case, interpolation with polynomials of a given maximal total degree is not always possible even if the number of interpolation points and the space dimension coincide. Due to that, numerous constructions for…
Exploiting the variational interpretation of kernel interpolation we exhibit a direct connection between interpolation and regression, where interpolation appears as a limiting case of regression. By applying this framework to point clouds…
Let $\Omega$ be a convex open set in $\mathbb R^n$ and let $\Lambda_k$ be a finite subset of $\Omega$. We find necessary geometric conditions for $\Lambda_k$ to be interpolating for the space of multivariate polynomials of degree at most…
Interpolation of data on non-Euclidean spaces is an active research area fostered by its numerous applications. This work considers the Hermite interpolation problem: finding a sufficiently smooth manifold curve that interpolates a…
We introduce an interpolation--regression operator for polynomial approximation on the unit sphere $\mathbb{S}^2$ from discrete samples. The approximant is a spherical polynomial of degree $r$ which interpolates the data on a prescribed…
Starting with univariate polynomial interpolation we arrive to a natural generalization of fundamental theorem of algebra for certain systems of multivariate algebraic equations.
The paper is concerned with the problem of shape preserving interpolatory subdivision. For arbitrarily spaced, planar input data an efficient non-linear subdivision algorithm is presented that results in $G^1$ limit curves, reproduces conic…
The polynomial kernels are widely used in machine learning and they are one of the default choices to develop kernel-based classification and regression models. However, they are rarely used and considered in numerical analysis due to their…