Squarefree normal representation of zeros of zero-dimensional polynomial systems
From MaRDI portal
Recommendations
- Zero decomposition with multiplicity for zero-dimensional polynomial systems
- Square-free pure triangular decomposition of zero-dimensional polynomial systems
- Zero decomposition algorithms for systems of polynomial equations
- scientific article; zbMATH DE number 1057751
- An algorithm for decomposing a polynomial system into normal ascending sets
Cites work
- A certified iterative method for isolated singular roots
- A generalized Euclidean algorithm for computing triangular representations of algebraic varieties
- Algorithm 931
- Algorithms for computing triangular decomposition of polynomial systems
- An elimination method for polynomial systems
- Analyzing the dual space of the saturated ideal of a regular set and the local multiplicities of its zeros
- Characteristic decomposition: from regular sets to normal sets
- Comprehensive Triangular Decomposition
- Computing the multiplicity structure in solving polynomial systems
- Computing triangular systems and regular systems
- Decomposing polynomial systems into simple systems
- Decomposition of polynomial sets into characteristic pairs
- Elimination methods
- scientific article; zbMATH DE number 3970886 (Why is no real title available?)
- scientific article; zbMATH DE number 1254248 (Why is no real title available?)
- scientific article; zbMATH DE number 1979251 (Why is no real title available?)
- scientific article; zbMATH DE number 1827070 (Why is no real title available?)
- Ideals, varieties, and algorithms. An introduction to computational algebraic geometry and commutative algebra
- Isolated points, duality and residues
- Matrix eigenproblems are at the heart of polynomial system solving
- Multiple zeros of nonlinear systems
- Multiplicity-preserving triangular set decomposition of two polynomials
- Newton's method with deflation for isolated singularities of polynomial systems
- On characteristic decomposition and quasi-characteristic decomposition
- On deflation and multiplicity structure
- On isolation of simple multiple zeros and clusters of zeros of polynomial systems
- On the connection between Ritt characteristic sets and Buchberger-Gröbner bases
- On the theories of triangular sets
- Real solution isolation with multiplicity of zero-dimensional triangular systems
- The closedness subspace method for computing the multiplicity structure of a polynomial system
- Using Algebraic Geometry
- Zero decomposition with multiplicity for zero-dimensional polynomial systems
Cited in
(4)- Analyzing the dual space of the saturated ideal of a regular set and the local multiplicities of its zeros
- Square-free pure triangular decomposition of zero-dimensional polynomial systems
- Decomposition of polynomial ideals into triangular regular sequences
- Sum-and-quotient characteristic decomposition of polynomial ideals
This page was built for publication: Squarefree normal representation of zeros of zero-dimensional polynomial systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6184184)
