Computation of bounds for polynomial roots
From MaRDI portal
Recommendations
Cited in
(22)- Ten methods to bound multiple roots of polynomials
- Piecewise quadratic bounding functions for finding real roots of polynomials
- Revisiting the stability of computing the roots of a quadratic polynomial
- Improving root separation bounds
- Tighter bounds of errors of numerical roots
- A Lower Bound for Computing Lagrange’s Real Root Bound
- Binomial coefficients and bounds for the roots of a polynomial
- A new polynomial bound and its efficiency
- Bounds for Real Roots and Applications to Orthogonal Polynomials
- Inequalities on Upper Bounds for Real Polynomial Roots
- On the bounds for the roots of a polynomial
- scientific article; zbMATH DE number 1086546 (Why is no real title available?)
- scientific article; zbMATH DE number 1984134 (Why is no real title available?)
- scientific article; zbMATH DE number 1505492 (Why is no real title available?)
- Optimal bounds for the roots of polynomials
- Bounds for the roots of polynomials with complex coefficients
- New bounds for positive roots of polynomials
- Algorithms and Computation
- New bounds on the real polynomial roots
- Computation of dominant real roots of polynomials
- Implementations of a new theorem for computing bounds for positive roots of polynomials
- Quality of positive root bounds
This page was built for publication: Computation of bounds for polynomial roots
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2918746)
