Determining dimension of the solution component that contains a computed zero of a polynomial system
From MaRDI portal
Publication:2473942
DOI10.1016/j.jmaa.2007.05.049zbMath1133.65028OpenAlexW2056711682MaRDI QIDQ2473942
Publication date: 5 March 2008
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jmaa.2007.05.049
algorithmnumerical resultspolynomial systemssingular valueshomotopy continuation methodsolution component
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (4)
Mixed cell computation in HOM4ps ⋮ HOM4PS-2.0: a software package for solving polynomial systems by the polyhedral homotopy continuation method ⋮ Puiseux Expansions and Nonisolated Points in Algebraic Varieties ⋮ Multiple zeros of nonlinear systems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Numerical homotopies to compute generic points on positive dimensional algebraic sets
- Solving polynomial systems by polyhedral homotopies
- Newton's method with deflation for isolated singularities of polynomial systems
- Numerical Decomposition of the Solution Sets of Polynomial Systems into Irreducible Components
- Algorithm 795
- Symmetric Functions Applied to Decomposing Solution Sets of Polynomial Systems
- Newton's method for overdetermined systems of equations
- The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
- A Rank-Revealing Method with Updating, Downdating, and Applications
This page was built for publication: Determining dimension of the solution component that contains a computed zero of a polynomial system