The usual "implementation” of real numbers as floating point numbers on existing computers has the well-known disadvantage that most of the real numbers are not exactly representable in floating point. Also the four basic arithmetic operations can usually not be performed exactly. During the last years research in different areas has been intensified in order to overcome these problems. (LEDA-Library by K. Mehlhorn et al., "Exact arithmetic with real numbers” by A. Edalat et al., Symbolic algebraic methods, verification methods). The latest development is the combination of symbolic-algebraic methods and verification methods to so-called hybrid methods. – This book contains a collection of worked out talks on these subjects given during a Dagstuhl seminar at the Forschungszentrum für Informatik, Schlo€ Dagstuhl, Germany, presenting the state of the art.

Enclosure methods and their applications have been developed to a high standard during the last decades. These methods guarantee the validity of the computed results. This means they are of the same standard as the rest of mathematics. The book deals with a wide variety of aspects of enclosure methods. All contributions follow the common goal to push the limits of enclosure methods forward. Topics that are treated include basic questions of arithmetic, proving conjectures, bounds for Krylow type linear system solvers, bounds for eigenvalues, the wrapping effect, algorithmic differencing, differential equations, finite element methods, application in robotics, and nonsmooth global optimization.

This book provides a systematic approach for the algorithmic formulation and implementation of mathematical operations in computer algebra programming languages. The viewpoint is that mathematical expressions, represented by expression trees, are the data objects of computer algebra programs, and by using a few primitive operations that analyze and

This book constitutes the refereed proceedings of the 12th IFIP WG 10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods, CHARME 2003, held in L'Aquila, Italy in October 2003. The 24 revised full papers and 8 short papers presented were carefully reviewed and selected from 65 submissions. The papers are organized in topical sections on software verification, automata based methods, processor verification, specification methods, theorem proving, bounded model checking, and model checking and applications.

The two volume set LNCS 7133 and LNCS 7134 constitutes the thoroughly refereed post-conference proceedings of the 10th International Conference on Applied Parallel and Scientific Computing, PARA 2010, held in Reykjavík, Iceland, in June 2010. These volumes contain three keynote lectures, 29 revised papers and 45 minisymposia presentations arranged on the following topics: cloud computing, HPC algorithms, HPC programming tools, HPC in meteorology, parallel numerical algorithms, parallel computing in physics, scientific computing tools, HPC software engineering, simulations of atomic scale systems, tools and environments for accelerator based computational biomedicine, GPU computing, high performance computing interval methods, real-time access and processing of large data sets, linear algebra algorithms and software for multicore and hybrid architectures in honor of Fred Gustavson on his 75th birthday, memory and multicore issues in scientific computing - theory and praxis, multicore algorithms and implementations for application problems, fast PDE solvers and a posteriori error estimates, and scalable tools for high performance computing.

This book contains tutorial surveys and original research contributions in geometric computing, modeling, and reasoning. Highlighting the role of algebraic computation, it covers: surface blending, implicitization, and parametrization; automated deduction with Clifford algebra and in real geometry; and exact geometric computation. Basic techniques, advanced methods, and new findings are presented coherently, with many examples and illustrations. Using this book the reader will easily cross the frontiers of symbolic computation, computer aided geometric design, and automated reasoning. The book is also a valuable reference for people working in other relevant areas, such as scientific computing, computer graphics, and artificial intelligence. Contents: Algebraic Methods in Computer Aided Geometric Design: Theoretical and Practical Applications (L Gonzilez-Vega et al.); Constructing Piecewise Algebraic Blending Surfaces (Y Feng et al.); Rational Curves and Surfaces: Algorithms and Some Applications (J R Sendra); Panorama of Methods for Exact Implicitization of Algebraic Curves and Surfaces (I S Kotsireas); Implicitization and Offsetting via Regular Systems (D Wang); Determining the Intersection Curve of Two 3D Implicit Surfaces by Using Differential Geometry and Algebraic Techniques (L Gonzilez-Vega et al.); Analytical Properties of Semi-Stationary Subdivision Schemes (H Zhang & G Wang); Meshless Method for Numerical Solution of PDE Using Hermitian Interpolation with Radial Basis (Z Wu & J Liu); Clifford Algebras in Geometric Computation (H Li); Automated Deduction in Real Geometry (L Yang & B Xia); Automated Derivation of Unknown Relations and Determination of Geometric Loci (Y Li); On Guaranteed Accuracy Computation (C K Yap); Dixon A-Resultant Quotients for 6-Point Isosceles Triangular Corner Cutting (M-C Foo & E-W Chionh); Face Recognition Using Hidden Markov Models and Artificial Neural Network Techniques (Z Ou & B Xue). Readership: Upper-level undergraduates, graduate students, researchers and engineers in geometric modeling."

This self-contained text is a step-by-step introduction and a complete overview of interval computation and result verification, a subject whose importance has steadily increased over the past many years. The author, an expert in the field, gently presents the theory of interval analysis through many examples and exercises, and guides the reader from the basics of the theory to current research topics in the mathematics of computation. Contents Preliminaries Real intervals Interval vectors, interval matrices Expressions, P-contraction, ε-inflation Linear systems of equations Nonlinear systems of equations Eigenvalue problems Automatic differentiation Complex intervals

This book constitutes the refereed proceedings of the 13th Annual European Symposium on Algorithms, ESA 2005, held in Palma de Mallorca, Spain, in September 2005 in the context of the combined conference ALGO 2005. The 75 revised full papers presented together with abstracts of 3 invited lectures were carefully reviewed and selected from 244 submissions. The papers address all current issues in algorithmics reaching from design and mathematical issues over real-world applications in various fields up to engineering and analysis of algorithms.

The Conference on Formal Methods in Computer-Aided Design (FMCAD) is an annual conference on the theory and applications of formal methods in hardware and system in academia and industry for presenting and discussing groundbreaking methods, technologies, theoretical results, and tools for reasoning formally about computing systems. FMCAD covers formal aspects of computer-aided system testing.