Reliable Implementation of Real Number Algorithms: Theory and Practice

International Seminar Dagstuhl Castle, Germany, January 8-13, 2006, Revised Papers

Peter Hertling, Christoph M. Hoffmann, Wolfram Luther, Nathalie Revol (Herausgeber)

Buch | Softcover

XI, 239 Seiten

2008 | 2008
Springer Berlin (Verlag)
978-3-540-85520-0 (ISBN)

Infos

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.

Inhalt

Validated Modeling of Mechanical Systems with SmartMOBILE: Improvement of Performance by ValEncIA-IVP.- Interval Subroutine Library Mission.- Convex Polyhedral Enclosures of Interval-Based Hierarchical Object Representations.- Real Algebraic Numbers: Complexity Analysis and Experimentation.- Verified Methods in Stochastic Traffic Modelling.- Interval Arithmetic Using SSE-2.- Worst Cases for the Exponential Function in the IEEE 754r decimal64 Format.- Robustness and Randomness.- Topological Neighborhoods for Spline Curves: Practice & Theory.- Homotopy Conditions for Tolerant Geometric Queries.- Transfinite Interpolation for Well-Definition in Error Analysis in Solid Modelling.- Theory of Real Computation According to EGC.

Produkt-Details

• Erscheint lt. Verlag: 28.8.2008
• Reihe/Serie: Lecture Notes in Computer Science
• Reihe/Serie: Theoretical Computer Science and General Issues
• Zusatzinfo: XI, 239 p.
• Verlagsort: Berlin
• Sprache: englisch
• Maße: 155 x 235 mm
• Gewicht: 397 g
• Themenwelt: Informatik ► Theorie / Studium ► Algorithmen
• Themenwelt: Informatik ► Weitere Themen ► Hardware
• Schlagworte: Algorithm analysis and problem complexity • algorithms • arithmetic • Calculus • Complexity • Computability • Computational Geometry • Geometry • Hardcover, Softcover / Informatik, EDV/Informatik • HC/Informatik, EDV/Informatik • Homotopy • Modeling • randomness • real algebraic numbers • Real Numbers • reliable computation • Robustness • solid modeling • Spline • Topology • transfinite interpolation
• ISBN-10: 3-540-85520-3 / 3540855203
• ISBN-13: 978-3-540-85520-0 / 9783540855200
• Zustand: Neuware