Reliable Implementation of Real Number Algorithms: Theory and Practice: International Seminar Dagstuhl Castle, Germany, January 8-13, 2006, Revised Papers
A large amount of the capacity of today’s computers is used for computations that can be described as computations involving real numbers. In this book, the focus is on a problem arising particularly in real number computations: the problem of verifiedor reliablecomputations. Since real numbersare objects c- taining an inflnite amount of information, they cannot be represented precisely on a computer. This leads to the well-known problems caused by unverified - plementations of real number algorithms usingfinite precision. While this is t- ditionally seen to be a problem in numerical mathematics, there are also several scientific communities in computer science that are dealing with this problem. This book is a follow-up of the Dagstuhl Seminar 06021 on “Reliable Imp- mentation of Real Number Algorithms: Theory and Practice,” which took place January 8–13, 2006. It was intended to stimulate an exchange of ideas between the different communities that deal with the problem of reliable implementation of real number algorithms either from a theoretical or from a practical point of view. Forty-eight researchers from many different countries and many different disciplines gathered in the castle of Dagstuhl to exchange views and ideas, in a relaxed atmosphere. The program consisted of 35 talks of 30 minutes each, and of three evening sessions with additional presentations and discussions. There were also lively discussions about different theoretical models and practical - proaches for reliable real number computations.
1113636036
Reliable Implementation of Real Number Algorithms: Theory and Practice: International Seminar Dagstuhl Castle, Germany, January 8-13, 2006, Revised Papers
A large amount of the capacity of today’s computers is used for computations that can be described as computations involving real numbers. In this book, the focus is on a problem arising particularly in real number computations: the problem of verifiedor reliablecomputations. Since real numbersare objects c- taining an inflnite amount of information, they cannot be represented precisely on a computer. This leads to the well-known problems caused by unverified - plementations of real number algorithms usingfinite precision. While this is t- ditionally seen to be a problem in numerical mathematics, there are also several scientific communities in computer science that are dealing with this problem. This book is a follow-up of the Dagstuhl Seminar 06021 on “Reliable Imp- mentation of Real Number Algorithms: Theory and Practice,” which took place January 8–13, 2006. It was intended to stimulate an exchange of ideas between the different communities that deal with the problem of reliable implementation of real number algorithms either from a theoretical or from a practical point of view. Forty-eight researchers from many different countries and many different disciplines gathered in the castle of Dagstuhl to exchange views and ideas, in a relaxed atmosphere. The program consisted of 35 talks of 30 minutes each, and of three evening sessions with additional presentations and discussions. There were also lively discussions about different theoretical models and practical - proaches for reliable real number computations.
54.99
In Stock
5
1
Reliable Implementation of Real Number Algorithms: Theory and Practice: International Seminar Dagstuhl Castle, Germany, January 8-13, 2006, Revised Papers
239
Reliable Implementation of Real Number Algorithms: Theory and Practice: International Seminar Dagstuhl Castle, Germany, January 8-13, 2006, Revised Papers
239
54.99
In Stock
Product Details
| ISBN-13: | 9783540855200 |
|---|---|
| Publisher: | Springer Berlin Heidelberg |
| Publication date: | 10/07/2008 |
| Series: | Lecture Notes in Computer Science , #5045 |
| Edition description: | 2008 |
| Pages: | 239 |
| Product dimensions: | 6.10(w) x 9.40(h) x 0.60(d) |
From the B&N Reads Blog