Roundoff errors are inevitable if the exact result of some operation is not representable in a computer, and has, therefore, to be approximated. To avoid roundoff errors, it is hence necessary to choose a set of computer-representable numbers in such a way that the results of all basic operations will be still in this set. In this paper, we prove that if we include arithmetic operations and computing the interval range into this operations list, then the set F of numbers will be roundoff-free iff F is a real closed field; therefore, the smallest such set is the set of all real algebraic numbers (i.e., solutions of polynomial equations with rational coefficients).
Reliable Computing – Springer Journals
Published: Oct 3, 2004
It’s your single place to instantly
discover and read the research
that matters to you.
Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.
All for just $49/month
Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly
Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.
All the latest content is available, no embargo periods.
“Whoa! It’s like Spotify but for academic articles.”@Phil_Robichaud