Prof. Dr. Ulrich Kulisch (Karlsruhe) ist auf dem Gebiet der Numerischen Mathematik tätig.Prof. Dr. Dietmar Ratz ist Studiengangsleiter Wirtschaftsinformatik an der Dualen Hochschule Baden-Württemberg (DHBW) Karlsruhe und lehrt als apl. Professor auch am Karlsruher Institut für Technologie (KIT).

This book presents an extensive set of tools for solving basic numerical problems with verification of the results using the scientific computer language PASCAL-XSC. It contains implementations of algorithms and many examples and exercises. Some topics covered are usually not found in standard numerical analysis texts. It is written for engineers, mathematicians and scientists working in scientific computing.

1 Introduction.- 1 Introduction.- I Preliminaries.- 2 The Features of PASCAL-XSC.- 3 Mathematical Preliminaries.- II One-Dimensional Problems.- 4 Evaluation of Polynomials.- 5 Automatic Differentiation.- 6 Nonlinear Equations in One Variable.- 7 Global Optimization.- 8 Evaluation of Arithmetic Expressions.- 9 Zeros of Complex Polynomials.- III Multi-Dimensional Problems.- 10 Linear Systems of Equations.- 11 Linear Optimization.- 12 Automatic Differentiation for Gradients, Jacobians, and Hessians.- 13 Nonlinear Systems of Equations.- 14 Global Optimization.- A Utility Modules.- A.l Module b_util.- A.2 Module r_util.- A.3 Module i_util.- A.4 Module mvi_util.- Index of Special Symbols.

As suggested by the title of this book Numerical Toolbox for Verified Computing, we present an extensive set of sophisticated tools to solve basic numerical problems with a verification of the results. We use the features of the scientific computer language PASCAL-XSC to offer modules that can be combined by the reader to his/her individual needs. Our overriding concern is reliability - the automatic verification of the result a computer returns for a given problem. All algorithms we present are influenced by this central concern. We must point out that there is no relationship between our methods of numerical result verification and the methods of program verification to prove the correctness of an imple~entation for a given algorithm. This book is the first to offer a general discussion on arithmetic and computational reliability, analytical mathematics and verification techniques, algorithms, and (most importantly) actual implementations in the form of working computer routines. Our task has been to find the right balance among these ingredients for each topic. For some topics, we have placed a little more emphasis on the algorithms. For other topics, where the mathematical prerequisites are universally held, we have tended towards more in-depth discussion of the nature of the computational algorithms, or towards practical questions of implementation. For all topics, we present exam ples, exercises, and numerical results demonstrating the application of the routines presented.