Interval analysis is an alternative to conventional floating-point computations that offers guaranteed error bounds. Despite this advantage, interval methods have not gained widespread use in large scale computational science applications. This paper addresses this issue from a performance perspective, comparing the performance of floating point and interval operations for some small computational kernels. Particularly attention is given to the Sun Fortran interval implementation, although the strategies introduced here to enhance performance are applicable to other interval implementations. Fundamental differences in the operation counts and memory references requirements of interval and floating point codes are discussed.
|Title of host publication||Computational Science – ICCS 2006|
|Subtitle of host publication||6th International Conference, Reading, UK, May 28-31, 2006, Proceedings, Part I|
|Editors||Vassil N. Alexandrov, Geert Dick van Albada, Peter M. A. Sloot, Jack Dongarra|
|Number of pages||8|
|Publication status||Published - 2006|
|Name||Lecture Notes in Computer Science|
|Publisher||Springer, Berlin, Heidelberg|