Stable border bases for ideals of points
When studying the ideal \(I(\mathbb{X})\) of a set of points \(\mathbb{X}\subset \mathbb{P} ^n\), Gröbner bases are a widely used tool in Computational Algebra; nevertheless they are not a good tool with respect to stability with regard to ``small perturbations of the points (i.e. small changes in the coordinates of the points). This is a serious drawback when working with points whose coordinates come from real-world measurements which are known only with some indeterminacy. So it is quite desirable to have a set \(B\) of polynomials in \(I(\mathbb{X})\) which is a basis for the ideal and moreover presents ``structural stability, i.e. any small perturbations (= ``within a prescribed range) of the coordinates of the points yields a new set of points \(\widetilde {\mathbb{X}}\) and a basis \(\widetilde {S}\) of the ideal \(I(\widetilde {\mathbb{X}})\), such that the polynomials in \(\widetilde{S}\) have coefficients which differ only slightly (i.e. within the same range) from those of \(S\). In this paper a method is given for computing basis of ideals of points which have this required structural stability. The main tool at this are ``border bases (introduced by Kreutzer and Robbiano), which are used to define \textit{stable border bases}, that are an effective answer to the stability problem.
- An algebraist's view on border bases
- Approximate computation of zero-dimensional polynomial ideals
- Approximate varieties, approximate ideals and dimension reduction
- Computing ideals of points
- Generalized normal forms and polynomial system solving
- scientific article; zbMATH DE number 3876580 (Why is no real title available?)
- scientific article; zbMATH DE number 5168255 (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?)
- Improved Error Bounds for Underdetermined System Solvers
- Numerical Polynomial Algebra
- Relations between roots and coefficients, interpolation and application to system solving
- Thinning out redundant empirical data
- Almost vanishing polynomials for sets of limited precision points
- Verification of a low-degree polynomial vanishing at empirical points
- Stable border bases for ideals of numerical Cartesian sets
- Computing border bases using mutant strategies
- Subideal border bases
- Border bases for lattice ideals
- From oil fields to Hilbert schemes
- Simple varieties for limited precision points
- Stable monomial basis for multivariate Birkhoff interpolation problems
- Computing all border bases for ideals of points
- A Polyhedral Characterization of Border Bases
- Stability of parametric decomposition
- Multivariate polynomial interpolation with perturbed data
- Artificial discontinuities of single-parametric Gröbner bases
- Monomial-agnostic computation of vanishing ideals
- Pivoting in extended rings for computing approximate Gröbner bases
- Generating functions for borders
- Deformations of border bases
This page was built for publication: Stable border bases for ideals of points
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q999088)