Almost vanishing polynomials for sets of limited precision points

DOI10.1016/J.JSC.2009.06.002zbMATH Open1203.13029arXiv0807.3412OpenAlexW2017337676MaRDI QIDQ1034545FDOQ1034545

Authors: C. Fassino 

Publication date: 6 November 2009

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Abstract: Let X be a set of s points whose coordinates are known with only limited From the numerical point of view, given a set X of s real points whose coordinates are known with only limited precision, each set X* of real points whose elements differ from those of X of a quantity less than the data uncertainty can be considered equivalent to X. We present an algorithm that, given X and a tolerance Tol on the data error, computes a set G of polynomials such that each element of G "almost vanishing" at X and at all its equivalent sets X*. Even if G is not, in the general case, a basis of the vanishing ideal I(X), we show that, differently from the basis of I(X) that can be greatly influenced by the data uncertainty, G can determine a geometrical configuration simultaneously characterizing the set X and all its equivalent sets X*.

Full work available at URL: https://arxiv.org/abs/0807.3412

Recommendations

• Approximate computation of zero-dimensional polynomial ideals
• Approximate varieties, approximate ideals and dimension reduction
• An approximate vanishing ideal algorithm based on constrained total least squares
• scientific article; zbMATH DE number 7034249
• Simple varieties for limited precision points

zbMATH Keywords

vanishing idealborder bases\texttt{CoCoA}approximate vanishing ideallimited precision datastable order idealGröbner bases

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Numerical computation of solutions to systems of equations (65H10) Computational aspects in algebraic geometry (14Q99) Real polynomials: location of zeros (26C10)

Cites Work

• Title not available (Why is that?)
• Approximate varieties, approximate ideals and dimension reduction
• Numerical Polynomial Algebra
• Title not available (Why is that?)
• Stable border bases for ideals of points
• Title not available (Why is that?)
• Approximate computation of zero-dimensional polynomial ideals
• Floating point Gröbner bases.
• Thinning out redundant empirical data
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (9)

• An approximate vanishing ideal algorithm based on constrained total least squares
• From oil fields to Hilbert schemes
• Stable monomial basis for multivariate Birkhoff interpolation problems
• Verification of a low-degree polynomial vanishing at empirical points
• Noise-tolerant algebraic method for reconstruction of nonlinear dynamical systems
• Simple varieties for limited precision points
• Approximate computation of zero-dimensional polynomial ideals
• Multivariate polynomial interpolation with perturbed data
• Monomial-agnostic computation of vanishing ideals

Uses Software

• CoCoA
• CoCoALib
• ApCoCoA
• StableBBasisNBM5

This page was built for publication: Almost vanishing polynomials for sets of limited precision points

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1034545)