Self-Validating Numerics for Function Space Problems - 1st Edition - ISBN: 9780124020207, 9781483273778

Self-Validating Numerics for Function Space Problems

1st Edition

Computation with Guarantees for Differential and Integral Equations

Authors: Edgar W. Kaucher Willard L. Miranker
Editors: Werner Rheinboldt
eBook ISBN: 9781483273778
Imprint: Academic Press
Published Date: 1st January 1984
Page Count: 256
Sales tax will be calculated at check-out Price includes VAT/GST
Price includes VAT/GST
× DRM-Free

Easy - Download and start reading immediately. There’s no activation process to access eBooks; all eBooks are fully searchable, and enabled for copying, pasting, and printing.

Flexible - Read on multiple operating systems and devices. Easily read eBooks on smart phones, computers, or any eBook readers, including Kindle.

Open - Buy once, receive and download all available eBook formats, including PDF, EPUB, and Mobi (for Kindle).

Institutional Access

Secure Checkout

Personal information is secured with SSL technology.

Free Shipping

Free global shipping
No minimum order.


Self-Validating Numerics for Function Space Problems describes the development of computational methods for solving function space problems, including differential, integral, and function equations. This seven-chapter text highlights three approaches, namely, the E-methods, ultra-arithmetic, and computer arithmetic.

After a brief overview of the different self-validating approaches, this book goes on introducing the mathematical preliminaries consisting principally of fixed-point theorems and the computational context for the development of validating methods in function spaces. The subsequent chapters deals with the development and application of point of view of ultra-arithmetic and the constructs of function-space arithmetic spaces, such as spaces, bases, rounding, and approximate operations. These topics are followed by discussion of the iterative residual correction methods for function problems and the requirements of a programming language needed to make the tools and constructs of the methodology available in actual practice on a computer. The last chapter describes the techniques for adapting the methodologies to a computer, including the self-validating results for specific problems.

This book will prove useful to mathematicians and advance mathematics students.

Table of Contents



1. Introduction



Computer Arithmetic

Remark on Enumeration

Suggestions to the Reader

2. Mathematical Preliminaries

2.1 Basic Formulation of Self-Validating Methods in M

Theorem (Schauder-Tychonoff)

Computational Context for Fixed Point Theorems

2.2 A Broader Setting for Self-Validating Methods

2.2.1 Basic Fixed Point Theorems

2.2.2 Modified Krasnoselski-Darbo Fixed Point Theorems

3. Ultra-Arithmetic and Roundings

3.1 Spaces, Bases, Roundings, and Approximate Operations

3.1.1 Examples of Bases

3.1.2 Examples of Roundings

3.2 Spaces, Bases, and Roundings for Validation

3.2.1 Examples of Bases

3.2.2 Examples of Roundings

4 Methods for Functional Equations

4.1 Methods for Linear Equations

4.1.1 The Finite Case

4.1.1 The Infinitesimal Case

4.2 Methods for Nonlinear Function Equations

4.2.1 The Finite Case

4.2.2 The Infinitesimal Case

5 Iterative Residual Correction

5.1 Arithmetic Implications of IRC

5.2 IRC for Initial-Value Problems and Volterra Integral Equations

5.3 Iterative Residual Correction with Carry

5.4 A Formalism for IRC in Function Space

5.4.1 The Block-Relaxation Formalism

5.4.2 Application of the Relaxation Formalism

6. Comments on Programming Language

7. Application and Illustrative Computation

7.1 Review of the Computational Process

7.1.1 Validation in R

7.1.2 Validation in RN

7.1.3 Validation


No. of pages:
© Academic Press 1984
Academic Press
eBook ISBN:

About the Author

Edgar W. Kaucher

Willard L. Miranker

About the Editor

Werner Rheinboldt

Ratings and Reviews