Sharp bounds on interval polynomial roots

DOI10.1023/A:1014797921296zbMATH Open0994.65053OpenAlexW198666394MaRDI QIDQ1597640FDOQ1597640

Authors: 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

algorithmpolynomialsreal rootsinterval coefficientssharp boundsinterval quadratic equations

Mathematics Subject Classification ID

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

Cited In (7)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1597640)