Approximate computation of zero-dimensional polynomial ideals
\textit{B. Buchberger} and \textit{H. M. Möller} developed an algorithm to compute the vanishing ideal of a finite set of points [Lect. Notes Comput. Sci. 144, 24--31 (1982; Zbl 0549.68026)]. The corresponding Gröbner basis is numerical unstable. The aim of the paper is to introduce a numerically stable so-called Approximate Vanishing Ideal Algorithm which computes a set of polynomials that almost vanish at the given points and almost form a border basis. Singular value decomposition is used to adapt the Buchberger--Möller algorithm to the approximate setting. A modification of the algorithm is given which computes a Macaulay basis of an approximate vanishing ideal. The Border Basis Algorithm [\textit{A. Kehrein} and \textit{M. Kreuzer}, J. Pure Appl. Algebra 205, No. 2, 279--295 (2006; Zbl 1097.13036)] is also generalized to the approximate setting. The approximate membership problem for zero--dimensional ideals is studied.
- Almost vanishing polynomials for sets of limited precision points
- Subideal border bases
- An approximate vanishing ideal algorithm based on constrained total least squares
- Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
- Approximate varieties, approximate ideals and dimension reduction
- Characterizations of border bases
- Computing border bases
- Computing ideals of points
- Deformations of border bases
- Gröbner bases of ideals defined by functionals with an application to ideals of projective points
- Gröbner bases, H-bases and interpolation
- H-bases for polynomial interpolation and system solving
- scientific article; zbMATH DE number 3876580 (Why is no real title available?)
- scientific article; zbMATH DE number 4213315 (Why is no real title available?)
- scientific article; zbMATH DE number 1515218 (Why is no real title available?)
- scientific article; zbMATH DE number 942877 (Why is no real title available?)
- scientific article; zbMATH DE number 2206382 (Why is no real title available?)
- Numerical Polynomial Algebra
- On determining the structure of a non-linear system
- Pseudozeros of multivariate polynomials
- Remarks on automatic algorithm stabilization
- Almost vanishing polynomials for sets of limited precision points
- Computing dimension and independent sets for polynomial ideals
- Verification of a low-degree polynomial vanishing at empirical points
- Computing border bases without using a term ordering
- Numerical computation of H-bases
- Subexponential-time computation of isolated primary components of a polynomial ideal
- Inverse multivariate polynomial root-finding: numerical implementations of the affine and projective Buchberger-Möller algorithm
- Computing zero-dimensional schemes
- Approximate varieties, approximate ideals and dimension reduction
- Vector space bases associated to vanishing ideals of points
- The vanishing ideal of a finite set of points with multiplicity structures
- Deterministically Computing Reduction Numbers of Polynomial Ideals
- Computing border bases using mutant strategies
- Approximate radical of ideals with clusters of roots (extended abstract)
- An approximate vanishing ideal algorithm based on constrained total least squares
- Subideal border bases
- Noise-tolerant algebraic method for reconstruction of nonlinear dynamical systems
- scientific article; zbMATH DE number 5168256 (Why is no real title available?)
- From oil fields to Hilbert schemes
- The FGLM problem and Möller's algorithm on zero-dimensional ideals
- Simple varieties for limited precision points
- Stable monomial basis for multivariate Birkhoff interpolation problems
- Numerical algorithms for dual bases of positive-dimensional ideals
- Numerical computation of the Hilbert function and regularity of a zero dimensional scheme
- Recovering exact results from inexact numerical data in algebraic geometry
- Prony's method in several variables
- Computing all border bases for ideals of points
- A Polyhedral Characterization of Border Bases
- Multivariate polynomial interpolation with perturbed data
- Stabilized recovery and model reduction for multivariate exponential polynomials
- Monomial-agnostic computation of vanishing ideals
- Improved algorithms and novel applications of the FrankWolfe.jl library
- An efficient first-order conditional gradient algorithm in data-driven sparse identification of nonlinear dynamics to solve sparse recovery problems under noise
- Discovery of exact equations via computing the Gröbner basis
- Deformations of border bases
- Computing the state difference equations for discrete overdetermined linear \(m \operatorname{D}\) systems
- Stable border bases for ideals of points
This page was built for publication: Approximate computation of zero-dimensional polynomial ideals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q731932)
