Skip to main content
SpringerLink
Log in

Sharp Bounds on Interval Polynomial Roots

  • Published:
Reliable Computing

Abstract

An algorithm is developed for computing sharp bounds on the real roots of polynomials with interval coefficients. The procedure is introduced by studying interval quadratic equations.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Hansen, E. R.: Sharpness in Interval Computations, Reliable Computing 3 (1) (1997), pp. 17–29.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. 654 Paco Drive, Los Altos, CA, 94024, USA

    Eldon R. Hansen

  2. Sun Microsystems, Inc., 901 San Antonio Road, UMPK16-304, Palo Alto, CA, 94303-4900, USA

    G. William Walster

Authors
  1. Eldon R. Hansen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. G. William Walster
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hansen, E.R., Walster, G.W. Sharp Bounds on Interval Polynomial Roots. Reliable Computing 8, 115–122 (2002). https://doi.org/10.1023/A:1014797921296

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1014797921296

Keywords

Search

Navigation