A generalized interval arithmetic

101Citations
Citations of this article
19Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Hansen, E. R. (1975). A generalized interval arithmetic. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 29 LNCS, pp. 7–18). Springer Verlag. https://doi.org/10.1007/3-540-07170-9_2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free