Abstract
We have introduced and illustrated a generalized interval analysis which reduces the inherent lack of sharpness of o.i.a. to a second order effect. Our method may not be useful if second order quantities are not truly negligible. Moreover, our method is of little value if the original data for a problem is real rather than intervals of non-zero width.
However, it is substantially better than o.i.a. for many problems. Moreover, it provides a more powerful tool in some cases such as in bounding multiple roots.
The rules for multiplication and division should be regarded as tentative. Further study may reveal that alternative rules are preferable.
As a final comment, we note that it is easily shown that g.i.a. is subdistributive.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Bibliography
Ramon E. Moore, "Interval Analysis", Prentice-Hall, 1966.
Eldon R. Hansen, "On Solving Systems of Equations Using Interval Arithmetic", Math. Comp., 22(1968), 374–384.
R. H. Dargel, F. R. Loscalzo, and T. H. Witt, "Automatic Error Bounds on Real Zeros of Rational Functions", Comm. ACM, 9(1966), 806–809.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1975 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hansen, E.R. (1975). A generalized interval arithmetic. In: Nickel, K. (eds) Interval Mathematics. IMath 1975. Lecture Notes in Computer Science, vol 29. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07170-9_2
Download citation
DOI: https://doi.org/10.1007/3-540-07170-9_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-07170-9
Online ISBN: 978-3-540-37504-3
eBook Packages: Springer Book Archive