A root isolation algorithm for sparse univariate polynomials

DOI10.1145/2442829.2442839MaRDI QIDQ5244514zbMATH OpenOpenAlexFDO

Authors M. E. Alonso, André 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

\(\mathbb{F}\) Budan table\(\mathbb{F}\) virtual rootsdiscretizationfewnomialgeneralized Budan-Fourier theoremNewton processreal root isolationreal univariate polynomialseparation bounds

Mathematics Subject Classification ID

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

Recommendations

• Efficiently Computing Real Roots of Sparse Polynomials
• An improved algorithm for real root isolation of univariate polynomials
• Efficient isolation of polynomial's real roots.
• On solving univariate sparse polynomials in logarithmic time
• A new method for real root isolation of univariate polynomials

Cited in

(7)

• On solving univariate sparse polynomials in logarithmic time
• Budan tables of real univariate polynomials
• scientific article; zbMATH DE number 421660 (Why is no real title available?)
• An improved algorithm for real root isolation of univariate polynomials
• A near-optimal algorithm for computing real roots of sparse polynomials
• Efficiently Computing Real Roots of Sparse Polynomials
• Virtual roots of a real polynomial and fractional derivatives

Describes a project that uses

Uses Software

• Maple

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

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