Reliable Implementation of Real Number Algorithms: Theory and Practice

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

  • Editors
  • Peter Hertling
  • Christoph M. Hoffmann
  • Wolfram Luther
  • Nathalie Revol
Conference proceedings

DOI: 10.1007/978-3-540-85521-7

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5045)

Table of contents (12 papers)

  1. Front Matter
  2. Validated Modeling of Mechanical Systems with SmartMOBILE: Improvement of Performance by ValEncIA-IVP
    Ekaterina Auer, Andreas Rauh, Eberhard P. Hofer, Wolfram Luther
    Pages 1-27
  3. Interval Subroutine Library Mission
    George F. Corliss, R. Baker Kearfott, Ned Nedialkov, John D. Pryce, Spencer Smith
    Pages 28-43
  4. Real Algebraic Numbers: Complexity Analysis and Experimentation
    Ioannis Z. Emiris, Bernard Mourrain, Elias P. Tsigaridas
    Pages 57-82
  5. Verified Methods in Stochastic Traffic Modelling
    Sebastian Kempken, Wolfram Luther
    Pages 83-101
  6. Interval Arithmetic Using SSE-2
    Branimir Lambov
    Pages 102-113
  7. Worst Cases for the Exponential Function in the IEEE 754r decimal64 Format
    Vincent Lefèvre, Damien Stehlé, Paul Zimmermann
    Pages 114-126
  8. Robustness and Randomness
    Dominique Michelucci, Jean Michel Moreau, Sebti Foufou
    Pages 127-148
  9. Topological Neighborhoods for Spline Curves: Practice & Theory
    Lance Edward Miller, Edward L. F. Moore, Thomas J. Peters, Alexander Russell
    Pages 149-161
  10. Back Matter

About these proceedings

Introduction

This book constitutes the revised papers of the International Seminar on Reliable Implementation of Real Number Algorithms, held at Dagstuhl Castle, Germany, in January 2006.

The Seminar was inteded to stimulate an exchange of ideas between the different communities that deal with the problem of reliable implementation of real number algorithms. Topics included formal proofs, software libraries, systems and platforms, as well as computational geometry and solid modelling.

Keywords

algorithms arithmetic calculus complexity computability computational geometry geometry homotopy modeling randomness real algebraic numbers real numbers reliable computation robustness solid modeling

Bibliographic information

  • Copyright Information Springer-Verlag Berlin Heidelberg 2008
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-540-85520-0
  • Online ISBN 978-3-540-85521-7
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349