Why interval arithmetic is so useful
| dc.contributor.author | Hijazi, Y. | |
| dc.contributor.author | Hagen, H. | |
| dc.contributor.author | Hansen, C. D. | |
| dc.contributor.author | Joy, K. I. | |
| dc.contributor.editor | Hagen, Hans | |
| dc.contributor.editor | Hering-Bertram, Martin | |
| dc.contributor.editor | Garth, Christoph | |
| dc.date.accessioned | 2017-09-23T07:01:44Z | |
| dc.date.available | 2017-09-23T07:01:44Z | |
| dc.date.issued | 2008 | |
| dc.description.abstract | Interval arithmetic was introduced by Ramon Moore [Moo66] in the 1960s as an approach to bound rounding errors in mathematical computation. The theory of interval analysis emerged considering the computation of both the exact solution and the error term as a single entity, i.e. the interval. Though a simple idea, it is a very powerful technique with numerous applications in mathematics, computer science, and engineering. In this survey we discuss the basic concepts of interval arithmetic and some of its extensions, and review successful applications of this theory in particular in computer science. | en |
| dc.identifier.isbn | 978-3-88579-441-7 | |
| dc.identifier.pissn | 1617-5468 | |
| dc.identifier.uri | https://dl.gi.de/handle/20.500.12116/4619 | |
| dc.language.iso | en | |
| dc.publisher | Gesellschaft für Informatik e.V. | |
| dc.relation.ispartof | Visualization of large and unstructured data sets | |
| dc.relation.ispartofseries | Lecture Notes in Informatics (LNI) - Proceedings, Volume P-7 | |
| dc.title | Why interval arithmetic is so useful | en |
| gi.citation.endPage | 163 | |
| gi.citation.publisherPlace | Bonn | |
| gi.citation.startPage | 148 | |
| gi.conference.date | 9. - 11. September 2007 | |
| gi.conference.location | Kaiserslautern |
Dateien
Originalbündel
1 - 1 von 1