|
Showing 1 - 3 of
3 matches in All Departments
Floating-point arithmetic is the most widely used way of
implementing real-number arithmetic on modern computers. However,
making such an arithmetic reliable and portable, yet fast, is a
very difficult task. As a result, floating-point arithmetic is far
from being exploited to its full potential. This handbook aims to
provide a complete overview of modern floating-point arithmetic. So
that the techniques presented can be put directly into practice in
actual coding or design, they are illustrated, whenever possible,
by a corresponding program. The handbook is designed for
programmers of numerical applications, compiler designers,
programmers of floating-point algorithms, designers of arithmetic
operators, and more generally, students and researchers in
numerical analysis who wish to better understand a tool used in
their daily work and research.
Floating-point arithmetic is the most widely used way of
implementing real-number arithmetic on modern computers. However,
making such an arithmetic reliable and portable, yet fast, is a
very difficult task. As a result, floating-point arithmetic is far
from being exploited to its full potential. This handbook aims to
provide a complete overview of modern floating-point arithmetic. So
that the techniques presented can be put directly into practice in
actual coding or design, they are illustrated, whenever possible,
by a corresponding program. The handbook is designed for
programmers of numerical applications, compiler designers,
programmers of floating-point algorithms, designers of arithmetic
operators, and more generally, students and researchers in
numerical analysis who wish to better understand a tool used in
their daily work and research.
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.
|
|