Approximate computation of zero-dimensional polynomial ideals
From MaRDI portal
Publication:731932
DOI10.1016/J.JSC.2008.11.010zbMATH Open1176.13003OpenAlexW1963730962MaRDI QIDQ731932FDOQ731932
Authors: Daniel Heldt, Martin Kreuzer, Sebastian Pokutta, Hennie Poulisse 
Publication date: 9 October 2009
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2008.11.010
Recommendations
- 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
Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Computational aspects in algebraic geometry (14Q99)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Gröbner bases of ideals defined by functionals with an application to ideals of projective points
- Numerical Polynomial Algebra
- Characterizations of border bases
- H-bases for polynomial interpolation and system solving
- Title not available (Why is that?)
- Computing border bases
- Title not available (Why is that?)
- Gröbner bases, H-bases and interpolation
- Deformations of border bases
- Computing ideals of points
- Remarks on automatic algorithm stabilization
- On determining the structure of a non-linear system
- Pseudozeros of multivariate polynomials
Cited In (34)
- Numerical algorithms for dual bases of positive-dimensional ideals
- Numerical computation of the Hilbert function and regularity of a zero dimensional scheme
- An approximate vanishing ideal algorithm based on constrained total least squares
- Approximate radical of ideals with clusters of roots (extended abstract)
- Prony's method in several variables
- Vector space bases associated to vanishing ideals of points
- Computing dimension and independent sets for polynomial ideals
- Deformations of border bases
- The vanishing ideal of a finite set of points with multiplicity structures
- Computing border bases without using a term ordering
- From oil fields to Hilbert schemes
- Title not available (Why is that?)
- Inverse multivariate polynomial root-finding: numerical implementations of the affine and projective Buchberger-Möller algorithm
- Computing border bases using mutant strategies
- Numerical computation of H-bases
- Computing all border bases for ideals of points
- Stable monomial basis for multivariate Birkhoff interpolation problems
- Computing the state difference equations for discrete overdetermined linear \(m \operatorname{D}\) systems
- Subideal border bases
- A Polyhedral Characterization of Border Bases
- Subexponential-time computation of isolated primary components of a polynomial ideal
- Deterministically Computing Reduction Numbers of Polynomial Ideals
- 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
- Stable border bases for ideals of points
- Approximate varieties, approximate ideals and dimension reduction
- Multivariate polynomial interpolation with perturbed data
- Almost vanishing polynomials for sets of limited precision points
- Monomial-agnostic computation of vanishing ideals
- Stabilized recovery and model reduction for multivariate exponential polynomials
- Recovering exact results from inexact numerical data in algebraic geometry
- The FGLM problem and Möller's algorithm on zero-dimensional ideals
- Computing zero-dimensional schemes
Uses Software
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)
