Quality of positive root bounds
DOI10.1016/J.JSC.2015.09.006zbMATH Open1332.12002OpenAlexW2296261841WikidataQ57432274 ScholiaQ57432274MaRDI QIDQ898284FDOQ898284
Authors: Aaron Herman, Hoon Hong 
Publication date: 8 December 2015
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2015.09.006
Recommendations
Real polynomials: location of zeros (26C10) Numerical computation of roots of polynomial equations (65H04) Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Bounds for absolute positiveness of multivariate polynomials
- Faster algorithms for computing Hong's bound on absolute positiveness
- Bounds for positive roots of polynomials
- New bounds for positive roots of polynomials
- Bounds on absolute positiveness of multivariate polynomials
Cited In (15)
- On finding the largest root of a polynomial
- Improving root separation bounds
- A property of the nearly optimal root-bound
- Improved bounds on absolute positiveness of multivariate polynomials
- On an application of symbolic computation and computer graphics to root-finders: the case of multiple roots of unknown multiplicity
- A new polynomial bound and its efficiency
- Bounds on absolute positiveness of multivariate polynomials
- Computation of bounds for polynomial roots
- Bounds for Real Roots and Applications to Orthogonal Polynomials
- On the quality of some root-bounds
- Optimal bounds for the roots of polynomials
- Binomial coefficients and bounds for the roots of a polynomial
- Inequalities on Upper Bounds for Real Polynomial Roots
- Bounds for positive roots of polynomials
- Title not available (Why is that?)
This page was built for publication: Quality of positive root bounds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q898284)
