Related papers: On polynomial interpolation in the monomial basis
For the last almost three decades, since the famous Buchberger-M\"oller(BM) algorithm emerged, there has been wide interest in vanishing ideals of points and associated interpolation polynomials. Our paradigm is based on the theory of…
In this paper we will show that monomial summability can be characterized using Borel-Laplace like integral transformations depending of a parameter $0<s<1$. We will apply this result to prove 1-summability in a monomial of formal solutions…
The results on Vandermonde-like matrices were introduced as a generalization of polynomial Vandermonde matrices, and the displacement structure of these matrices was used to derive an inversion formula. In this paper we first present a fast…
Can polynomial interpolation be extended to a Banach space setting? Are tensors whose elements are non-commutative Banach space elements legitimate objects with notable analytic and algebraic properties? Here we explore these questions and…
Theory interpolation has found several successful applications in model checking. We present a novel method for computing interpolants for ground formulas in the theory of equality. The method produces interpolants from colored congruence…
Multipoint polynomial evaluation and interpolation are fundamental for modern symbolic and numerical computing. The known algorithms solve both problems over any field of constants in nearly linear arithmetic time, but the cost grows to…
Low-rank approximations are essential in modern data science. The interpolative decomposition provides one such approximation. Its distinguishing feature is that it reuses columns from the original matrix. This enables it to preserve matrix…
Given a matrix with partitions of its rows and columns and entries from a field, we give the necessary and sufficient conditions that it has a non--singular submatrix with certain number of rows from each row partition and certain number of…
The geometric and algebraic theory of monomial ideals and multigraded modules is initiated over real-exponent polynomial rings and, more generally, monoid algebras for real polyhedral cones. The main results include the generalization of…
We present algorithms for computing the reduced Gr\"{o}bner basis of the vanishing ideal of a finite set of points in a frame of ideal interpolation. Ideal interpolation is defined by a linear projector whose kernel is a polynomial ideal.…
We study simply interpolating sequences for the Dirichlet space in the unit disc. In particular we are interested in comparing three different sufficient conditions for simply interpolating sequences. The first one is the the so called one…
We generalize an algorithm by Goward for principalization of monomial ideals in nonsingular varieties to work on any scheme of finite type over a field. The normal crossings condition considered by Goward is weakened to the condition that…
In the presence of CP violation, the effective Hamiltonian matrix describing a neutral meson anti-meson system does not commute with its hermitian conjugate. As a result, this matrix cannot be diagonalized by a unitary transformation and…
We find sufficient conditions for a discrete sequence to be interpolating or sampling for certain generalized Bergman spaces on open Riemann surfaces. As in previous work of Bendtsson, Ortega-Cerda, Seip, Wallsten and others, our conditions…
In this work, we investigate a model order reduction scheme for polynomial parametric systems. We begin with defining the generalized multivariate transfer functions for the system. Based on this, we aim at constructing a reduced-order…
We generalize the polynomial Szemer\'{e}di theorem to intersective polynomials over the ring of integers of an algebraic number field, by which we mean polynomials having a common root modulo every ideal. This leads to the existence of new…
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…
In this work we blend interpolation theory with numerical integration, constructing an interpolator based on integrals over $n$-dimensional balls. We show that, under hypotheses on the radius of the $n$-balls, the problem can be treated as…
In this paper we study standard bases for submodules of a mixed power series and polynomial ring $R[[t_1,\ldots,t_m]][x_1,\ldots,x_n]^s$ respectively of their localization with respect to a $t$-local monomial ordering for a certain class of…
We propose an algorithm based on Newton's method and subdivision for finding all zeros of a polynomial system in a bounded region of the plane. This algorithm can be used to find the intersections between a line and a surface, which has…