Analyzing the dual space of the saturated ideal of a regular set and the local multiplicities of its zeros
From MaRDI portal
Abstract: In this paper, we are concerned with the problem of counting the multiplicities of a zero-dimensional regular set's zeros. We generalize the squarefree decomposition of univariate polynomials to the so-called pseudo squarefree decomposition of multivariate polynomials, and then propose an algorithm for decomposing a regular set into a finite number of simple sets. From the output of this algorithm, the multiplicities of zeros could be directly read out, and the real solution isolation with multiplicity can also be easily produced. As a main theoretical result of this paper, we analyze the structure of dual space of the saturated ideal generated by a simple set as well as a regular set. Experiments with a preliminary implementation show the efficiency of our method.
Recommendations
- Squarefree normal representation of zeros of zero-dimensional polynomial systems
- Zero decomposition with multiplicity for zero-dimensional polynomial systems
- Computing the multiplicity structure in solving polynomial systems
- A numerical-symbolic algorithm for computing the multiplicity of a component of an algebraic set
- The closedness subspace method for computing the multiplicity structure of a polynomial system
Cites work
- A complete algorithm for counting real solutions of polynomial systems of equations and inequalities.
- A generalized Euclidean algorithm for computing triangular representations of algebraic varieties
- A new method for solving algebraic systems of positive dimension
- Algorithms for computing greatest common divisors of parametric multivariate polynomials
- Algorithms for computing triangular decompositions of polynomial systems
- An algorithm for isolating the real solutions of semi-algebraic systems
- An elimination method for polynomial systems
- Basic principles of mechanical theorem proving in elementary geometries
- Chordal graphs in triangular decomposition in top-down style
- Computing the multiplicity structure in solving polynomial systems
- Computing the multiplicity structure of an isolated singular solution: case of breadth one
- Computing triangular systems and regular systems
- Decomposing polynomial sets into simple sets over finite fields: the zero-dimensional case
- Decomposing polynomial systems into simple systems
- Decomposition of polynomial sets into characteristic pairs
- Efficient computation of dual space and directional multiplicity of an isolated point
- scientific article; zbMATH DE number 4213458 (Why is no real title available?)
- scientific article; zbMATH DE number 5302686 (Why is no real title available?)
- scientific article; zbMATH DE number 3970886 (Why is no real title available?)
- scientific article; zbMATH DE number 16648 (Why is no real title available?)
- scientific article; zbMATH DE number 1254248 (Why is no real title available?)
- scientific article; zbMATH DE number 622670 (Why is no real title available?)
- scientific article; zbMATH DE number 1952043 (Why is no real title available?)
- scientific article; zbMATH DE number 3287742 (Why is no real title available?)
- scientific article; zbMATH DE number 3026097 (Why is no real title available?)
- scientific article; zbMATH DE number 3056446 (Why is no real title available?)
- Matrix eigenproblems are at the heart of polynomial system solving
- Multiple zeros of nonlinear systems
- Multivariate polynomial equations with multiple zeros solved by matrix eigenproblems
- On deflation and multiplicity structure
- On the efficiency of solving Boolean polynomial systems with the characteristic set method
- On the theories of triangular sets
- Real solution isolation with multiplicity of zero-dimensional triangular systems
This page was built for publication: Analyzing the dual space of the saturated ideal of a regular set and the local multiplicities of its zeros
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6087590)
