Related papers: Interpolation by polynomials with symmetries on th…
The paper deals with two fundamental types of trigonometric polynomials and splines on uniform grids, which allow us to construct interpolation approximations that depend linearly on the values of the interpolated function. Fundamental on…
As a generalization of Hermite interpolation problem, Birkhoff interpolation is an important subject in numerical approximation. This paper generalizes the existing Generalized Recursive Polynomial Interpolation Algorithm (GRPIA) that is…
A method is suggested for interpolating between small-variable and large-variable asymptotic expansions. The method is based on self-similar approximation theory resulting in self-similar root approximants. The latter are more general than…
This article proposes a bivariate polynomial problem for finite-order real matrices that endows a \textit{`sufficient condition'} for a map from the standard vector spaces of finite-order real matrices to the same dimensional bivariate…
Given a zero-dimensional ideal I in a polynomial ring, many computations start by finding univariate polynomials in I. Searching for a univariate polynomial in I is a particular case of considering the minimal polynomial of an element in…
The aim of this work is to show how symbolic computation can be used to perform multivariate Lagrange, Hermite and Birkhoff interpolation and help us to build more realistic interpolating functions. After a theoretical introduction in which…
In a recent paper by Harada, Seceleanu, and \c{S}ega, the Hilbert function, betti table, and graded minimal free resolution of a general principal symmetric ideal are determined when the number of variables in the polynomial ring is…
In areas such as kernel smoothing and non-parametric regression there is emphasis on smooth interpolation and smooth statistical models. Splines are known to have optimal smoothness properties in one and higher dimensions. It is shown, with…
Multiple Hermite polynomials are an extension of the classical Hermite polynomials for which orthogonality conditions are imposed with respect to $r>1$ normal (Gaussian) weights $w_j(x)=e^{-x^2+c_jx}$ with different means $c_j/2$, $1 \leq j…
We characterize the sets of solvability for Hermite multivariate interpolation problems when the sum of multiplicities is at most $2n + 2$, with $n$ the degree of the polynomial space. This result extends an earlier theorem (2000) by one of…
In this note we explicit the notion of Hermite interpolant of a multivariate symmetric polynomial, generalizing the notion of Lagrange interpolant to the case when there are roots coalescence, an extension of the results on the symmetric…
Our starting point is a basic problem in Hermite interpolation theory, namely determining the least degree of a homogeneous polynomial that vanishes to some specified order at every point of a given finite set. We solve this problem if the…
In this paper we study the singularity of multivariate Hermite interpolation of type total degree. We present a method to judge the singularity of the interpolation scheme considered and by the method to be developed, we show that all…
In this paper, a method via sparse-sparse iteration for computing a sparse incomplete factorization of the inverse of a symmetric positive definite matrix is proposed. The resulting factorized sparse approximate inverse is used as a…
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…
This paper deals with approximation of smooth convex functions $f$ on an interval by convex algebraic polynomials which interpolate $f$ at the endpoints of this interval. We call such estimates "interpolatory". One important corollary of…
We study several variants of decomposing a symmetric matrix into a sum of a low-rank positive semidefinite matrix and a diagonal matrix. Such decompositions have applications in factor analysis and they have been studied for many decades.…
Obtaining the inverse of a large symmetric positive definite matrix $\mathcal{A}\in\mathbb{R}^{p\times p}$ is a continual challenge across many mathematical disciplines. The computational complexity associated with direct methods can be…
We develop a constructive piecewise polynomial approximation theory in weighted Sobolev spaces with Muckenhoupt weights for any polynomial degree. The main ingredients to derive optimal error estimates for an averaged Taylor polynomial are…
Many uncertainty sets encountered in control systems analysis and design can be expressed in terms of semialgebraic sets, that is as the intersection of sets described by means of polynomial inequalities. Important examples are for instance…