A Lower Bound for Computing Lagrange’s Real Root Bound
From MaRDI portal
Recommendations
- Improvements of Lagrange's bound for polynomial roots
- Krandick's proof of Lagrange's real root bound claim
- scientific article; zbMATH DE number 7267629
- Computation of bounds for polynomial roots
- Computational Aspects of a Bound of Lagrange
- Upper bounds on real roots and lower bounds for the permanent
- scientific article; zbMATH DE number 4009659
- New bounds on the real polynomial roots
- Inequalities on Upper Bounds for Real Polynomial Roots
- Bounds for Real Roots and Applications to Orthogonal Polynomials
Cites work
- A new polynomial bound and its efficiency
- Bounds for absolute positiveness of multivariate polynomials
- Bounds for positive roots of polynomials
- Bounds on absolute positiveness of multivariate polynomials
- Complexity of real root isolation using continued fractions
- Faster algorithms for computing Hong's bound on absolute positiveness
- scientific article; zbMATH DE number 3919830 (Why is no real title available?)
- scientific article; zbMATH DE number 1446863 (Why is no real title available?)
- Implementations of a new theorem for computing bounds for positive roots of polynomials
- Krandick's proof of Lagrange's real root bound claim
- On the quality of some root-bounds
- Upperbounds for roots of polynomials
Cited in
(5)- Improved bounds on absolute positiveness of multivariate polynomials
- Krandick's proof of Lagrange's real root bound claim
- Improved bounds on absolute positiveness of multivariate polynomials
- Improvements of Lagrange's bound for polynomial roots
- Bounds on absolute positiveness of multivariate polynomials
This page was built for publication: A Lower Bound for Computing Lagrange’s Real Root Bound
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2830020)