Computational Aspects of a Bound of Lagrange

DOI10.1007/978-3-319-45641-6_32zbMath1453.12003OpenAlexW2517653931MaRDI QIDQ2830025

Doru Ştefănescu

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_32

Mathematics Subject Classification ID

Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10) Real polynomials: location of zeros (26C10) Computational methods for problems pertaining to field theory (12-08)

Cites Work

• Bounds for absolute positiveness of multivariate polynomials
• Krandick's proof of Lagrange's real root bound claim
• A New Polynomial Bound and Its Efficiency
• New Bounds for the Roots of an Algebraic Equation
• A New Bound for the Zeros of Polynomials
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computational Aspects of a Bound of Lagrange