Interval Arithmetic and Computational Science: Performance Considerations

Alistair P. Rendell; Bill Clarke; Josh Milthorpe

doi:10.1007/11758501_33

Interval Arithmetic and Computational Science: Performance Considerations

Alistair P. Rendell, Bill Clarke, Josh Milthorpe

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

1 Citation (Scopus)

Abstract

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.

Original language	English
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
Publisher	Springer
Pages	218-225
Number of pages	8
ISBN (Electronic)	978-3-540-34380-6
ISBN (Print)	978-3-540-34379-0
DOIs	https://doi.org/10.1007/11758501_33
Publication status	Published - 2006
Externally published	Yes

Publication series

Name	Lecture Notes in Computer Science
Publisher	Springer, Berlin, Heidelberg
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Access to Document

10.1007/11758501_33Licence: In Copyright

Cite this

Rendell, A. P., Clarke, B., & Milthorpe, J. (2006). Interval Arithmetic and Computational Science: Performance Considerations. In V. N. Alexandrov, G. D. van Albada, P. M. A. Sloot, & J. Dongarra (Eds.), Computational Science – ICCS 2006: 6th International Conference, Reading, UK, May 28-31, 2006, Proceedings, Part I (pp. 218-225). (Lecture Notes in Computer Science). Springer . https://doi.org/10.1007/11758501_33

Rendell, Alistair P. ; Clarke, Bill ; Milthorpe, Josh. / Interval Arithmetic and Computational Science : Performance Considerations. Computational Science – ICCS 2006: 6th International Conference, Reading, UK, May 28-31, 2006, Proceedings, Part I. editor / Vassil N. Alexandrov ; Geert Dick van Albada ; Peter M. A. Sloot ; Jack Dongarra. Springer , 2006. pp. 218-225 (Lecture Notes in Computer Science).

@inproceedings{189ab403b6064153846e65268c475026,

title = "Interval Arithmetic and Computational Science: Performance Considerations",

abstract = "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.",

author = "Rendell, {Alistair P.} and Bill Clarke and Josh Milthorpe",

year = "2006",

doi = "10.1007/11758501_33",

language = "English",

isbn = "978-3-540-34379-0",

series = "Lecture Notes in Computer Science",

publisher = "Springer ",

pages = "218--225",

editor = "Alexandrov, {Vassil N.} and {van Albada}, {Geert Dick} and Sloot, {Peter M. A.} and Jack Dongarra",

booktitle = "Computational Science – ICCS 2006",

}

Rendell, AP, Clarke, B & Milthorpe, J 2006, Interval Arithmetic and Computational Science: Performance Considerations. in VN Alexandrov, GD van Albada, PMA Sloot & J Dongarra (eds), Computational Science – ICCS 2006: 6th International Conference, Reading, UK, May 28-31, 2006, Proceedings, Part I. Lecture Notes in Computer Science, Springer , pp. 218-225. https://doi.org/10.1007/11758501_33

Interval Arithmetic and Computational Science : Performance Considerations. / Rendell, Alistair P.; Clarke, Bill; Milthorpe, Josh.

Computational Science – ICCS 2006: 6th International Conference, Reading, UK, May 28-31, 2006, Proceedings, Part I. ed. / Vassil N. Alexandrov; Geert Dick van Albada; Peter M. A. Sloot; Jack Dongarra. Springer , 2006. p. 218-225 (Lecture Notes in Computer Science).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Interval Arithmetic and Computational Science

T2 - Performance Considerations

AU - Rendell, Alistair P.

AU - Clarke, Bill

AU - Milthorpe, Josh

PY - 2006

Y1 - 2006

N2 - 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.

AB - 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.

U2 - 10.1007/11758501_33

DO - 10.1007/11758501_33

M3 - Conference contribution

SN - 978-3-540-34379-0

T3 - Lecture Notes in Computer Science

SP - 218

EP - 225

BT - Computational Science – ICCS 2006

A2 - Alexandrov, Vassil N.

A2 - van Albada, Geert Dick

A2 - Sloot, Peter M. A.

A2 - Dongarra, Jack

PB - Springer

ER -

Rendell AP, Clarke B, Milthorpe J. Interval Arithmetic and Computational Science: Performance Considerations. In Alexandrov VN, van Albada GD, Sloot PMA, Dongarra J, editors, Computational Science – ICCS 2006: 6th International Conference, Reading, UK, May 28-31, 2006, Proceedings, Part I. Springer . 2006. p. 218-225. (Lecture Notes in Computer Science). https://doi.org/10.1007/11758501_33

Interval Arithmetic and Computational Science: Performance Considerations

Abstract

Publication series

Access to Document

Fingerprint

Cite this