Improvements of Lagrange's bound for polynomial roots

DOI10.1016/j.jsc.2016.10.001zbMath1358.65028OpenAlexW2565229654MaRDI QIDQ512362

Doru Ştefănescu, Maurice Mignotte, Prashant Batra

Publication date: 24 February 2017

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2016.10.001

zbMATH Keywords

polynomial rootscomplex rootscomputational effortasymptotic computational complexityLagrange's boundoverestimation factor

Mathematics Subject Classification ID

Real polynomials: location of zeros (26C10) Complexity and performance of numerical algorithms (65Y20) Numerical computation of roots of polynomial equations (65H04)

Related Items (5)

Zero-free angular sectors and lens-shaped regions for polynomials, with applications to irreducibility ⋮ ZEROS OF LACUNARY TYPE POLYNOMIALS ⋮ Improved bounds on absolute positiveness of multivariate polynomials ⋮ Inequalities between height and deviation of polynomials ⋮ Apollonius circles and irreducibility criteria for polynomials

Cites Work

• A property of the nearly optimal root-bound
• Faster algorithms for computing Hong's bound on absolute positiveness
• Bounds for positive roots of polynomials
• Bounds for absolute positiveness of multivariate polynomials
• Krandick's proof of Lagrange's real root bound claim
• Upperbounds for roots of polynomials
• On the Quality of Some Root-Bounds
• New Bounds for the Roots of an Algebraic Equation
• A Generalization of a Theorem of Bôcher
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Improvements of Lagrange's bound for polynomial roots