Zero decomposition with multiplicity for zero-dimensional polynomial systems
From MaRDI portal
Abstract: We present a zero decomposition theorem and an algorithm based on Wu's method, which computes a zero decomposition with multiplicity for a given zero-dimensional polynomial system. If the system satisfies some condition, the zero decomposition is of triangular form.
Recommendations
- Zero decomposition algorithms for systems of polynomial equations
- scientific article; zbMATH DE number 1145287
- Multiplicity-preserving triangular set decomposition of two polynomials
- Decomposing polynomial sets into simple sets over finite fields: the zero-dimensional case
- Real solution isolation with multiplicity of zero-dimensional triangular systems
Cited in
(12)- Generic regular decompositions for generic zero-dimensional systems
- Multiplicity-preserving triangular set decomposition of two polynomials
- Determining dimension of the solution component that contains a computed zero of a polynomial system
- Applications of the theory of weakly nondegenerate conditions to zero decomposition for polynomial systems
- Zero decomposition algorithms for systems of polynomial equations
- The closedness subspace method for computing the multiplicity structure of a polynomial system
- scientific article; zbMATH DE number 1254284 (Why is no real title available?)
- Analyzing the dual space of the saturated ideal of a regular set and the local multiplicities of its zeros
- Squarefree normal representation of zeros of zero-dimensional polynomial systems
- 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: Zero decomposition with multiplicity for zero-dimensional polynomial systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3110295)
