An Elimination Method for Solving Bivariate Polynomial Systems: Eliminating the Usual Drawbacks
From MaRDI portal
Publication:5233695
DOI10.1137/1.9781611972917.4zbMath1429.65104arXiv1010.1386OpenAlexW1702387807MaRDI QIDQ5233695
Michael Sagraloff, Pavel Emeliyanenko, Eric Berberich
Publication date: 12 September 2019
Published in: 2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1010.1386
Symbolic computation and algebraic computation (68W30) Numerical computation of solutions to systems of equations (65H10) Numerical algorithms for specific classes of architectures (65Y10)
Related Items (8)
A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers ⋮ Certified numerical real root isolation for bivariate nonlinear systems ⋮ Exact symbolic-numeric computation of planar algebraic curves ⋮ p-adic algorithm for bivariate Gröbner bases ⋮ On the complexity of the Descartes method when using approximate arithmetic ⋮ A generic position based method for real root isolation of zero-dimensional polynomial systems ⋮ On the complexity of computing with planar algebraic curves ⋮ Exact line and plane search for tensor optimization
Uses Software
This page was built for publication: An Elimination Method for Solving Bivariate Polynomial Systems: Eliminating the Usual Drawbacks
