Reliable Implementation Of Real Number Algorithms: Theory And Practice: International Seminar Dagstuhl Castle, Germany, January 8-13, 2006, Revised Papers (lecture Notes In Computer Science)
by Christoph M. Hoffmann /
2008 / English / PDF
4.9 MB Download
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 veri?edor
reliablecomputations. Since real numbersare objects c- taining an
in?nite amount of information, they cannot be represented precisely
on a computer. This leads to the well-known problems caused by
unveri?ed - plementations of real number algorithms using ?nite
precision. While this is t- ditionally seen to be a problem in
numerical mathematics, there are also several scienti?c 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 di?erent 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 di?erent countries and many
di?erent 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 di?erent theoretical models and practical -
proaches for reliable real number computations.
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 veri?edor
reliablecomputations. Since real numbersare objects c- taining an
in?nite amount of information, they cannot be represented precisely
on a computer. This leads to the well-known problems caused by
unveri?ed - plementations of real number algorithms using ?nite
precision. While this is t- ditionally seen to be a problem in
numerical mathematics, there are also several scienti?c 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 di?erent 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 di?erent countries and many
di?erent 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 di?erent theoretical models and practical -
proaches for reliable real number computations.
