On Solving Systems of Bivariate Polynomials

DOI10.1007/978-3-642-15582-6_21zbMath1274.65156OpenAlexW1591953993MaRDI QIDQ5747869

Fabrice Rouillier

Publication date: 14 September 2010

Published in: Mathematical Software – ICMS 2010 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-15582-6_21

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10) Computer aspects of numerical algorithms (65Y99)

Related Items (6)

A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers ⋮ Exact symbolic-numeric computation of planar algebraic curves ⋮ p-adic algorithm for bivariate Gröbner bases ⋮ Nearly optimal refinement of real roots of a univariate polynomial ⋮ From approximate factorization to root isolation with application to cylindrical algebraic decomposition ⋮ On the complexity of computing with planar algebraic curves

Uses Software

• Kronecker
• MPFI
• QEPCAD
• ISOLATE

This page was built for publication: On Solving Systems of Bivariate Polynomials