A Lower Bound for Computing Lagrange’s Real Root Bound

DOI10.1007/978-3-319-45641-6_28zbMath1453.26010OpenAlexW2507569938MaRDI QIDQ2830020

No author found.

Publication date: 9 November 2016

Published in: Computer Algebra in Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-45641-6_28

zbMATH Keywords

Lagrange's boundcomplexity lower boundsabsolute positivenessalgebraic decision treereal root bounds

Mathematics Subject Classification ID

Real polynomials: location of zeros (26C10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Improved bounds on absolute positiveness of multivariate polynomials

Cites Work

• Unnamed Item
• Unnamed Item
• Implementations of a new theorem for computing bounds for positive roots of polynomials
• Bounds on absolute positiveness of multivariate polynomials
• 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
• Complexity of real root isolation using continued fractions
• Upperbounds for roots of polynomials
• On the Quality of Some Root-Bounds
• A New Polynomial Bound and Its Efficiency

This page was built for publication: A Lower Bound for Computing Lagrange’s Real Root Bound