On the quality of some root-bounds

DOI10.1007/978-3-319-32859-1_50zbMATH Open1460.26014OpenAlexW2474486402MaRDI QIDQ2807878FDOQ2807878

Authors: Prashant Batra 

Publication date: 25 May 2016

Published in: Mathematical Aspects of Computer and Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-32859-1_50

Recommendations

• Improvements of Lagrange's bound for polynomial roots
• Quality of positive root bounds
• New bounds on the real polynomial roots
• scientific article; zbMATH DE number 7267629
• A property of the nearly optimal root-bound

zbMATH Keywords

improvements of Lagrange's boundmaximum modulus of polynomial rootsmaximum overestimation

Mathematics Subject Classification ID

Real polynomials: location of zeros (26C10) Numerical computation of roots of polynomial equations (65H04)

Cited In (13)

• A Lower Bound for Computing Lagrange’s Real Root Bound
• FLQ, the fastest quadratic complexity bound on the values of positive roots of polynomials
• Krandick's proof of Lagrange's real root bound claim
• A new constructive root bound for algebraic expressions. (Extended abstract)
• Root-neededness and approximations of neededness
• Improved bounds on absolute positiveness of multivariate polynomials
• A property of the nearly optimal root-bound
• Title not available (Why is that?)
• New bounds on the real polynomial roots
• Optimal bounds for the roots of polynomials
• Improvements of Lagrange's bound for polynomial roots
• Denesting by bounded degree radicals
• Title not available (Why is that?)

This page was built for publication: On the quality of some root-bounds

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