Simple varieties for limited precision points

DOI10.1016/J.TCS.2012.10.024MaRDI QIDQ385012zbMATH OpenOpenAlexFDO

Authors C. Fassino, M.-L. Torrente

Publication date 29 November 2013

Published in Theoretical Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

affine varietyempirical pointssymbolic-numerical algorithms

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Real polynomials: location of zeros (26C10) Numerical approximation and computational geometry (primarily algorithms) (65D99) Solving polynomial systems; resultants (13P15)

Abstract: We present a symbolic-numeric approach for the analysis of a given set of noisy data, represented as a finite set $X$ of limited precision points. Starting from $X$ and a permitted tolerance $varepsilon$ on its coordinates, our method automatically determines a low degree monic polynomial whose associated variety passes close to each point of $X$ by less than the given tolerance $varepsilon$.

Recommendations

• Almost vanishing polynomials for sets of limited precision points
• An approximate vanishing ideal algorithm based on constrained total least squares
• Approximate varieties, approximate ideals and dimension reduction
• scientific article; zbMATH DE number 1428942
• Stable border bases for ideals of points

Cites work

• scientific article; zbMATH DE number 3876580 (Why is no real title available?)
• scientific article; zbMATH DE number 2079841 (Why is no real title available?)
• scientific article; zbMATH DE number 1504686 (Why is no real title available?)
• scientific article; zbMATH DE number 1515218 (Why is no real title available?)
• scientific article; zbMATH DE number 2206382 (Why is no real title available?)
• scientific article; zbMATH DE number 961607 (Why is no real title available?)
• Algorithm 782
• Almost vanishing polynomials for sets of limited precision points
• Approximate commutative algebra
• Approximate computation of zero-dimensional polynomial ideals
• Approximate varieties, approximate ideals and dimension reduction
• Computing rank-revealing QR factorizations of dense matrices
• Improved Error Bounds for Underdetermined System Solvers
• Least-Change Secant Update Methods for Underdetermined Systems
• Numerical Polynomial Algebra
• Rank-Revealing QR Factorizations and the Singular Value Decomposition
• Stable border bases for ideals of points
• Subideal border bases
• Thinning out redundant empirical data

Cited in

(6)

• Noise-tolerant algebraic method for reconstruction of nonlinear dynamical systems
• Verified error bounds for eigenvalues of geometric multiplicity \(q\) and corresponding invariant subspaces
• Verification of a low-degree polynomial vanishing at empirical points
• Almost vanishing polynomials for sets of limited precision points
• Almost vanishing polynomials and an application to the Hough transform
• Monomial-agnostic computation of vanishing ideals

Describes a project that uses

Uses Software

• CoCoA
• RRQR
• toms/782

This page was built for publication: Simple varieties for limited precision points

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