
C++ Toolbox for Verified Computing I
Basic Numerical Problems Theory, Algorithms, and Programs
Springer (Publisher)
Published on 14. December 2011
Book
Paperback/Softback
XVIII, 382 pages
978-3-642-79653-1 (ISBN)
Description
Our aim in writing this book was to provide an extensive set of C++ programs for solving basic numerical problems with verification of the results. This C++ Toolbox for Verified Computing I is the C++ edition of the Numerical Toolbox for Verified Computing l. The programs of the original edition were written in PASCAL-XSC, a PASCAL eXtension for Scientific Computation. Since we published the first edition we have received many requests from readers and users of our tools for a version in C++. We take the view that C++ is growing in importance in the field of numeri cal computing. C++ includes C, but as a typed language and due to its modern concepts, it is superior to C. To obtain the degree of efficiency that PASCAL-XSC provides, we used the C-XSC library. C-XSC is a C++ class library for eXtended Scientific Computing. C++ and the C-XSC library are an adequate alternative to special XSC-Ianguages such as PASCAL-XSC or ACRITH-XSC. A shareware version of the C-XSC library and the sources of the toolbox programs are freely available via anonymous ftp or can be ordered against reimbursement of expenses. The programs of this book do not require a great deal of insight into the features of C++. Particularly, object oriented programming techniques are not required.
More details
Edition
Softcover reprint of the original 1st ed. 1995
Language
English
Place of publication
Berlin
Germany
Publishing group
Springer Berlin
Target group
Professional and scholarly
Research
Illustrations
XVIII, 382 p.
Dimensions
Height: 235 mm
Width: 155 mm
Thickness: 22 mm
Weight
610 gr
ISBN-13
978-3-642-79653-1 (9783642796531)
DOI
10.1007/978-3-642-79651-7
Schweitzer Classification
Other editions
Additional editions

Rolf Hammer | Matthias Hocks | Ulrich Kulisch
C++ Toolbox for Verified Computing I
Basic Numerical Problems Theory, Algorithms, and Programs
Book
05/1995
Springer
€85.55
Article exhausted; check different version
Content
1 Introduction.- 1.1 Advice for Quick Reading.- 1.2 Structure of the Book.- 1.3 Typography.- 1.4 Algorithmic Notation.- 1.5 Implementation.- 1.6 Computational Environment.- 1.7 Why Numerical Result Verification?.- I Preliminaries.- 2 The Features of C-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.1 Module r_util.- A.2 Module i_util.- A.3 Module ci_util.- A.4 Module mv_util.- A.5 Module mvi_util.- B Alphabetical List of Modules.- C List of Special Symbols.