The Method of Resultants for Computing Real Solutions of Polynomial Systems

DOI10.1137/0729051zbMath0756.65077OpenAlexW2023150917MaRDI QIDQ4008969

Kurt Georg, Rick Miranda, Eugene L. Allgower

Publication date: 27 September 1992

Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/e42071fad992067b363b9419e66497d345e4f9c7

zbMATH Keywords

numerical examplesLanczos methodconjugate gradient methodpolynomial systemsreal zerosresultant matrixmultiresultants

Mathematics Subject Classification ID

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 (10)

A numerical elimination method for polynomial computations ⋮ A comparison of companion matrix methods to find roots of a trigonometric polynomial ⋮ Finding all real zeros of polynomial systems using multi-resultant ⋮ A new approach to the surface intersection problem ⋮ Solving Real Polynomial Systems with Real Homotopies ⋮ QR-algebraic method for approximating zeros of system of polynomials ⋮ Regularization and Matrix Computation in Numerical Polynomial Algebra ⋮ The resultants method for approximating real fixed points of polynomials ⋮ Numerical Instability of Resultant Methods for Multidimensional Rootfinding ⋮ Complete numerical isolation of real roots in zero-dimensional triangular systems

This page was built for publication: The Method of Resultants for Computing Real Solutions of Polynomial Systems