Sharp bounds on interval polynomial roots

DOI10.1023/A:1014797921296zbMath0994.65053OpenAlexW198666394MaRDI QIDQ1597640

Eldon R. Hansen, G. William Walster

Publication date: 30 May 2002

Published in: Reliable Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1014797921296

zbMATH Keywords

algorithmpolynomialssharp boundsreal rootsinterval coefficientsinterval quadratic equations

Mathematics Subject Classification ID

Interval and finite arithmetic (65G30) Numerical computation of solutions to single equations (65H05) Real polynomials: location of zeros (26C10)

Related Items (6)

Solving interval constraints by linearization in computer-aided design ⋮ Constraint propagation on quadratic constraints ⋮ An algorithm for addressing the real interval eigenvalue problem ⋮ Zeros of univariate interval polynomials ⋮ Exact enclosures of roots of interval quadratic equations by Sridhara's and Fagnano's or modified Fagnano's formulas ⋮ Satisfaction of modeling requirements for intelligent navigation systems: risk management context

This page was built for publication: Sharp bounds on interval polynomial roots