Analyzing the dual space of the saturated ideal of a regular set and the local multiplicities of its zeros
From MaRDI portal
Publication:6087590
DOI10.1002/mma.8158arXiv1311.6897OpenAlexW3135468453MaRDI QIDQ6087590
Publication date: 12 December 2023
Published in: Mathematical Methods in the Applied Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1311.6897
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing the multiplicity structure of an isolated singular solution: case of breadth one
- Real solution isolation with multiplicity of zero-dimensional triangular systems
- Decomposing polynomial sets into simple sets over finite fields: the zero-dimensional case
- Basic principles of mechanical theorem proving in elementary geometries
- A new method for solving algebraic systems of positive dimension
- A generalized Euclidean algorithm for computing triangular representations of algebraic varieties
- Decomposing polynomial systems into simple systems
- An elimination method for polynomial systems
- A complete algorithm for counting real solutions of polynomial systems of equations and inequalities.
- Computing triangular systems and regular systems
- Efficient computation of dual space and directional multiplicity of an isolated point
- On the theories of triangular sets
- An algorithm for isolating the real solutions of semi-algebraic systems
- Multivariate polynomial equations with multiple zeros solved by matrix eigenproblems
- Algorithms for computing greatest common divisors of parametric multivariate polynomials
- Chordal graphs in triangular decomposition in top-down style
- On the efficiency of solving Boolean polynomial systems with the characteristic set method
- On deflation and multiplicity structure
- Multiple zeros of nonlinear systems
- Matrix eigenproblems are at the heart of polynomial system solving
- Decomposition of polynomial sets into characteristic pairs
- Algorithms for computing triangular decompositions of polynomial systems
- Computing the multiplicity structure in solving polynomial systems
