Determining dimension of the solution component that contains a computed zero of a polynomial system
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
Numerical computation of solutions to systems of equations (65H10) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Polynomials, factorization in commutative rings (13P05)
Related Items (4)
Uses Software
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Determining dimension of the solution component that contains a computed zero of a polynomial system