Efficient solution of real polynomial systems of equations

MaRDI QIDQ2724197zbMATH OpenFDO

Authors Guy Merlin Mbakop

Publication date 10 July 2001

zbMATH Keywords

affine geometrical gradearithmetical networksgeometric algorithmpolare varietyrational coefficientsstraight-line-programsystems of real polynomial equations

Mathematics Subject Classification ID

Real polynomials: location of zeros (26C10) Numerical computation of solutions to systems of equations (65H10)

Cited in

(5)

• MRHS Equation Systems that can be Solved in Polynomial Time
• The Method of Resultants for Computing Real Solutions of Polynomial Systems
• When polynomial equation systems can be ``solved fast?
• Accurate solution of polynomial equations using Macaulay resultant matrices
• Solving systems of polynomial inequalities over a real closed field in subexponential time

This page was built for publication: Efficient solution of real polynomial systems of equations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2724197)