2015
DOI: 10.1109/mcse.2015.75
|View full text |Cite
|
Sign up to set email alerts
|

The Approximation Tower in Computational Science: Why Testing Scientific Software Is Difficult

Abstract: International audienceNumerical solutions of mathematical equations in scientific models are the result of several approximation steps. Konrad Hinsen uses a simulation of the solar system as an example for illustrating these approximations and explaining their role in the difficult problem of testing scientific software

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2015
2015
2021
2021

Publication Types

Select...
5
1

Relationship

2
4

Authors

Journals

citations
Cited by 7 publications
(2 citation statements)
references
References 7 publications
0
2
0
Order By: Relevance
“…But most of the time is not all of the time. One particular subtle point is floating-point arithmetic, which has the reputation of being fundamentally irreproducible [4]. And yet, at the level of the operations defined by the standard IEEE-754 (which all processors and compilers today respect), floatingpoint arithmetic is perfectly deterministic.…”
Section: The State Of the Artmentioning
confidence: 99%
“…But most of the time is not all of the time. One particular subtle point is floating-point arithmetic, which has the reputation of being fundamentally irreproducible [4]. And yet, at the level of the operations defined by the standard IEEE-754 (which all processors and compilers today respect), floatingpoint arithmetic is perfectly deterministic.…”
Section: The State Of the Artmentioning
confidence: 99%
“…At the level of a computational platform, the only possible guarantee is bit-level replicability. Moreover, bit-level replicability is indispensable for software testing 27 .…”
Section: The Activepapers Projectmentioning
confidence: 99%