A root isolation algorithm for sparse univariate polynomials

DOI10.1145/2442829.2442839zbMath1323.68579OpenAlexW2006982525MaRDI QIDQ5244514

M. Emilia Alonso García, Andre Galligo

Publication date: 27 March 2015

Published in: Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2442829.2442839

zbMATH Keywords

discretizationfewnomialreal root isolationNewton processseparation boundsreal univariate polynomial\(\mathbb{F}\) Budan table\(\mathbb{F}\) virtual rootsgeneralized Budan-Fourier theorem

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Polynomials in general fields (irreducibility, etc.) (12E05) Numerical computation of roots of polynomial equations (65H04)

Uses Software

• Maple

This page was built for publication: A root isolation algorithm for sparse univariate polynomials