Finding all real zeros of polynomial systems using multi-resultant
DOI10.1016/J.CAM.2003.10.009zbMATH Open1053.65039OpenAlexW2047362555MaRDI QIDQ596163FDOQ596163
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
Recommendations
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)
Cites Work
- Algorithm 795
- Title not available (Why is that?)
- The Calculation of Multivariate Polynomial Resultants
- The Cheater’s Homotopy: An Efficient Procedure for Solving Systems of Polynomial Equations
- Finding all isolated solutions to polynomial systems using HOMPACK
- The Method of Resultants for Computing Real Solutions of Polynomial Systems
- The resultants method for approximating real fixed points of polynomials
Cited In (5)
- Numerical instability of resultant methods for multidimensional rootfinding
- The resultants method for approximating real fixed points of polynomials
- The Method of Resultants for Computing Real Solutions of Polynomial Systems
- The Chebyshev collocation-path following method for solving sixth-order Sturm-Liouville problems
- Coupled Cluster Theory: Toward an Algebraic Geometry Formulation
Uses Software
This page was built for publication: Finding all real zeros of polynomial systems using multi-resultant
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q596163)