Skip to main content

Numerical Toolbox for Verified Computing I

Basic Numerical Problems Theory, Algorithms, and Pascal-XSC Programs

  • Book
  • © 1993

Overview

Part of the book series: Springer Series in Computational Mathematics (SSCM, volume 21)

This is a preview of subscription content, log in via an institution to check access.

Access this book

eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (14 chapters)

  1. Introduction

  2. Preliminaries

  3. One-Dimensional Problems

  4. Multi-Dimensional Problems

Keywords

About this book

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.

Authors and Affiliations

  • Institut für Angewandte Mathematik, Universität Karlsruhe, Karlsruhe, Germany

    Ulrich Kulisch, Rolf Hammer, Dietmar Ratz, Matthias Hocks

Bibliographic Information

  • Book Title: Numerical Toolbox for Verified Computing I

  • Book Subtitle: Basic Numerical Problems Theory, Algorithms, and Pascal-XSC Programs

  • Authors: Ulrich Kulisch, Rolf Hammer, Dietmar Ratz, Matthias Hocks

  • Series Title: Springer Series in Computational Mathematics

  • DOI: https://doi.org/10.1007/978-3-642-78423-1

  • Publisher: Springer Berlin, Heidelberg

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer-Verlag Berlin Heidelberg 1993

  • Softcover ISBN: 978-3-642-78425-5Published: 08 December 2011

  • eBook ISBN: 978-3-642-78423-1Published: 06 December 2012

  • Series ISSN: 0179-3632

  • Series E-ISSN: 2198-3712

  • Edition Number: 1

  • Number of Pages: XV, 339

  • Topics: Numerical Analysis, Programming Techniques

Publish with us