Related papers: Groebner basis structure of ideal interpolation
We extend to arbitrary commutative base rings a recent result of Demeneghi that every ideal of an ample groupoid algebra over a field is an intersection of kernels of induced representations from isotropy groups, with a much shorter proof,…
We determine a Groebner basis for the secant ideal of the toric ideal associated to the second hypersimplex, with respect to any circular term order. The Groebner basis of the secant ideal requires polynomials of odd degree up to n. This…
We give an introduction to the theory of determinantal ideals and rings, their Groebner bases, initial ideals and algebras, respectively. The approach is based on the straightening law and the Knuth-Robinson-Schensted correspondence. The…
We study the consistency of minimum-norm interpolation in reproducing kernel Hilbert spaces corresponding to bounded kernels. Our main result give lower bounds for the generalization error of the kernel interpolation measured in a…
Nonlinear dimensionality reduction embeddings computed from datasets do not provide a mechanism to compute the inverse map. In this paper, we address the problem of computing a stable inverse map to such a general bi-Lipschitz map. Our…
Accurate interpolation of functions and derivatives is crucial in solving partial differential equations (PDEs). The Radial Basis Function (RBF) method has become an extremely popular and robust approach for interpolation on scattered data.…
We consider the Rosenfeld-Groebner algorithm for computing a regular decomposition of a radical differential ideal generated by a set of ordinary differential polynomials in n indeterminates. For a set of ordinary differential polynomials…
This paper introduces the first minimal solvers that jointly solve for affine-rectification and radial lens distortion from coplanar repeated patterns. Even with imagery from moderately distorted lenses, plane rectification using the…
We study determining the posture of an in-parallel planar manipulator, which has three connectors composed of revolute, prismatic and revolute joints, from specified active joint variables. We construct an ideal in the field of complex…
An ideal of a local polynomial ring can be described by calculating a standard basis with respect to a local monomial ordering. However standard basis algorithms are not numerically stable. Instead we can describe the ideal numerically by…
In this paper, we make a contribution to the computation of Gr\"obner bases. For polynomial reduction, instead of choosing the leading monomial of a polynomial as the monomial with respect to which the reduction process is carried out, we…
In this paper we consider systems of partial (multidimensional) linear difference equations. Specifically, such systems arise in scientific computing under discretization of linear partial differential equations and in computational high…
Video frame interpolation task has recently become more and more prevalent in the computer vision field. At present, a number of researches based on deep learning have achieved great success. Most of them are either based on optical flow…
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…
Let $R = K[x_1, x_2, x_3, x_4]$ be the polynomial ring over a field of characteristic zero. For the ideal $(x_1^a, x_2^b, x_3^c, x_4^d) \subset R$, where at least one of $a$, $b$, $c$ and $d$ is equal to two, we prove that its generic…
The interpolation-regression approximation is a powerful tool in numerical analysis for reconstructing functions defined on square or triangular domains from their evaluations at a regular set of nodes. The importance of this technique lies…
In this paper, we present a modular strategy which describes key properties of the absolute primary decomposition of an equidimensional polynomial ideal defined by polynomials with rational coefficients. The algorithm we design is based on…
We simplify an earlier paper of the same title by not using syzygy polynomials and by not using a trichotomy of inverse forms. Let $\K$ be a field and $\M=\K[x^{-1},z^{-1}]$ denote Macaulay's $\K[x,z]$ module of inverse polynomials; here…
In the context of algebraic statistics an experimental design is described by a set of polynomials called the design ideal. This, in turn, is generated by finite sets of polynomials. Two types of generating sets are mostly used in the…
In this paper we consider the problem of approximating vector-valued functions over a domain $\Omega$. For this purpose, we use matrix-valued reproducing kernels, which can be related to Reproducing kernel Hilbert spaces of vectorial…