Finding all real zeros of polynomial systems using multi-resultant
From MaRDI portal
Publication:596163
DOI10.1016/j.cam.2003.10.009zbMath1053.65039OpenAlexW2047362555MaRDI QIDQ596163
Publication date: 10 August 2004
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2003.10.009
numerical resultspolynomial systemsquasi-minimal residual methodContinuation methodReal zerosResultant matrixSecant methodTest function
Numerical computation of solutions to systems of equations (65H10) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20) Real polynomials: location of zeros (26C10)
Related Items
The Chebyshev collocation-path following method for solving sixth-order Sturm-Liouville problems ⋮ Coupled Cluster Theory: Toward an Algebraic Geometry Formulation ⋮ Numerical Instability of Resultant Methods for Multidimensional Rootfinding
Uses Software
Cites Work
- The Cheater’s Homotopy: An Efficient Procedure for Solving Systems of Polynomial Equations
- The Method of Resultants for Computing Real Solutions of Polynomial Systems
- Finding all isolated solutions to polynomial systems using HOMPACK
- Algorithm 795
- The Calculation of Multivariate Polynomial Resultants
- The resultants method for approximating real fixed points of polynomials
- Unnamed Item