Approximate computation of zero-dimensional polynomial ideals
From MaRDI portal
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
Cites work
- 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?)
- 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
- Numerical Polynomial Algebra
- On determining the structure of a non-linear system
- Pseudozeros of multivariate polynomials
- Remarks on automatic algorithm stabilization
Cited in
(34)- Numerical computation of the Hilbert function and regularity of a zero dimensional scheme
- An approximate vanishing ideal algorithm based on constrained total least squares
- A Polyhedral Characterization of Border Bases
- Noise-tolerant algebraic method for reconstruction of nonlinear dynamical systems
- Deterministically Computing Reduction Numbers of Polynomial Ideals
- Computing border bases using mutant strategies
- Computing zero-dimensional schemes
- Subexponential-time computation of isolated primary components of a polynomial ideal
- Computing all border bases for ideals of points
- Deformations of border bases
- Computing dimension and independent sets for polynomial ideals
- Simple varieties for limited precision points
- Multivariate polynomial interpolation with perturbed data
- Vector space bases associated to vanishing ideals of points
- Computing the state difference equations for discrete overdetermined linear \(m \operatorname{D}\) systems
- Stabilized recovery and model reduction for multivariate exponential polynomials
- Numerical computation of H-bases
- Stable border bases for ideals of points
- Computing border bases without using a term ordering
- Verification of a low-degree polynomial vanishing at empirical points
- Subideal border bases
- Numerical algorithms for dual bases of positive-dimensional ideals
- Approximate varieties, approximate ideals and dimension reduction
- Recovering exact results from inexact numerical data in algebraic geometry
- From oil fields to Hilbert schemes
- Stable monomial basis for multivariate Birkhoff interpolation problems
- Approximate radical of ideals with clusters of roots (extended abstract)
- Inverse multivariate polynomial root-finding: numerical implementations of the affine and projective Buchberger-Möller algorithm
- Prony's method in several variables
- The FGLM problem and Möller's algorithm on zero-dimensional ideals
- The vanishing ideal of a finite set of points with multiplicity structures
- Almost vanishing polynomials for sets of limited precision points
- scientific article; zbMATH DE number 5168256 (Why is no real title available?)
- Monomial-agnostic computation of vanishing ideals
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)
