On the quality of some root-bounds
From MaRDI portal
Publication:2807878
Recommendations
Cited in
(13)- scientific article; zbMATH DE number 6315740 (Why is no real title available?)
- 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
- A property of the nearly optimal root-bound
- Improved bounds on absolute positiveness of multivariate polynomials
- scientific article; zbMATH DE number 729911 (Why is no real title available?)
- Optimal bounds for the roots of polynomials
- New bounds on the real polynomial roots
- Improvements of Lagrange's bound for polynomial roots
- Denesting by bounded degree radicals
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)