Related papers: Interpolation by polynomials with symmetries on th…
This article introduces an iterative method for solving nonsingular non-Hermitian positive semidefinite systems of linear equations. To construct the iteration process, the coefficient matrix is split into two non-Hermitian positive…
Here the polynomial interpolation approach is used to introduce the main results on multivariate normal algebraic systems. Next we bring a construction which shows that any standard algebraic system, with finite set of solutions, can be…
The Hermite polynomials are ubiquitous but can be difficult to work with due to their unwieldy definition in terms of derivatives. To remedy this, we showcase an underappreciated Gaussian integral formula for the Hermite polynomials, which…
We present algorithms performing sparse univariate polynomial interpolation with errors in the evaluations of the polynomial. Based on the initial work by Comer, Kaltofen and Pernet [Proc. ISSAC 2012], we define the sparse polynomial…
This work provides a complete characterization of the solutions of a linear interpolation problem for vector polynomials. The interpolation problem consists in finding n scalar polynomials such that an equation involving a linear…
Let $A$ be a square complex matrix, $z_1$, ..., $z_{n}\in\mathbb C$ be (possibly repetitive) points of interpolation, $f$ be analytic in a neighborhood of the convex hull of the union of the spectrum of $A$ and the points $z_1$, ...,…
Polynomials with values in an irreducible module of the symmetric group can be given the structure of a module for the rational Cherednik algebra, called a standard module. This algebra has one free parameter and is generated by…
We construct interpolation operators for functions taking values in a symmetric space -- a smooth manifold with an inversion symmetry about every point. Key to our construction is the observation that every symmetric space can be realized…
The aim of this paper is to study the approximation of functions using a higher order Hermite-Fejer interpolation process on the unit circle. The system of nodes is composed of vertically projected zeros of Jacobi polynomials onto the unit…
This paper discusses the split feasibility problem with polynomials. The sets are semi-algebraic, defined by polynomial inequalities. They can be either convex or nonconvex, either feasible or infeasible. We give semidefinite relaxations…
We consider space-saving versions of several important operations on univariate polynomials, namely power series inversion and division, division with remainder, multi-point evaluation, and interpolation. Now-classical results show that…
Building on the classification of all characteristic polynomials of integer symmetric matrices having small span (span less than 4), we obtain a classification of small-span polynomials that are the characteristic polynomial of a Hermitian…
To approximate solutions of a linear differential equation, we project, via trigonometric interpolation, its solution space onto a finite-dimensional space of trigonometric polynomials and construct a matrix representation of the…
Conjugation covariants of matrices are applied to study the real algebraic variety consisting of complex Hermitian matrices with a bounded number of distinct eigenvalues. A minimal generating system of the vanishing ideal of degenerate…
In multicentric representation of piecewise holomorphic functions one combines Lagrange interpolation at roots of a polynomial $p$ with convergent power series of $p$ as the "coefficients" multiplying the Lagrange basis polynomials. When…
The polarizations of one relation of degree five and two relations of degree six minimally generate the ideal of relations among a minimal generating system of the algebra of multisymmetric polynomials in an arbitrary number of…
To interpolate a supersparse polynomial with integer coefficients, two alternative approaches are the Prony-based "big prime" technique, which acts over a single large finite field, or the more recently-proposed "small primes" technique,…
Based on the computation of a superset of the implicit support, implicitization of a parametrically given hyper-surface is reduced to computing the nullspace of a numeric matrix. Our approach exploits the sparseness of the given parametric…
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…
Polynomial meshes (called sometimes "norming sets") allow us to estimate the supremum norm of polynomials on a fixed compact set by the norm on its discrete subset. We give a general construction of polynomial weakly admissible meshes on…