Methods and Applications of Error-Free Computation by R T Gregory
This book is written as an introduction to the theory of error-free computation. In addition, we include several chapters that illustrate how error-free com putation can be applied in practice. The book is intended for seniors and first year graduate students in fields of study involving scientific computation using digital computers, and for researchers (in those same fields) who wish to obtain an introduction to the subject. We are motivated by the fact that there are large classes of ill-conditioned problems, and there are numerically unstable algorithms, and in either or both of these situations we cannot tolerate rounding errors during the numerical computations involved in obtaining solutions to the problems. Thus, it is important to study finite number systems for digital computers which have the property that computation can be performed free of rounding errors. In Chapter I we discuss single-modulus and multiple-modulus residue number systems and arithmetic in these systems, where the operands may be either integers or rational numbers. In Chapter II we discuss finite-segment p-adic number systems and their relationship to the p-adic numbers of Hensel [1908]. Each rational number in a certain finite set is assigned a unique Hensel code and arithmetic operations using Hensel codes as operands is mathe matically equivalent to those same arithmetic operations using the cor responding rational numbers as operands. Finite-segment p-adic arithmetic shares with residue arithmetic the property that it is free of rounding errors.-
The Science of Programming
-
A Theory of Objects
-
Numerical Geometry of Non-Rigid Shapes
-
Computer Systems
-
Algebraic Approaches to Program Semantics
-
Set Theory for Computing
-
Beauty Is Our Business
-
Parameterized Complexity
-
A Discipline of Multiprogramming
-
Asynchronous Circuits
-
The Design of Well-Structured and Correct Programs
-
String-Rewriting Systems
-
Error-Free Polynomial Matrix Computations
-
Prototyping-Oriented Software Development
-
An Introduction to Formal Language Theory
-
The Synthesizer Generator
-
Adaptive Information Processing
-
Reliable Computer Systems
-
Programming with Sets
-
Programming in Modula-2
-
Adaptive Signal Processing
-
Predicate Calculus and Program Semantics
-
Algorithmic Algebra
-
Programming with Specifications
-
Probabilistic Analysis of Algorithms
-
Expert Systems and Probabilistic Network Models
-
Algorithmic Language and Program Development
-
Object-Oriented Database Programming
-
The Design and Analysis of Algorithms
-
Software Configuration Management Using Vesta
-
The Origins of Digital Computers
-
Larch: Languages and Tools for Formal Specification
-
What Computing Is All About
-
ML with Concurrency
-
The Synthesizer Generator Reference Manual
-
Language Equations
-
On a Method of Multiprogramming
-
Programming Methodology
-
Abstraction, Refinement and Proof for Probabilistic Systems
-
Super-Recursive Algorithms
-
Specification and Development of Interactive Systems
-
Geometric Fundamentals of Robotics
-
Evolutionary Synthesis of Pattern Recognition Systems
-
Reverse Engineering of Object Oriented Code
-
High Performance Discovery In Time Series
-
Panoramic Vision
| SKU | Unavailable |
| ISBN 13 | 9781461297543 |
| ISBN 10 | 1461297540 |
| Title | Methods and Applications of Error-Free Computation |
| Author | R T Gregory |
| Series | Monographs In Computer Science |
| Condition | Unavailable |
| Binding Type | Paperback |
| Publisher | Springer-Verlag New York Inc. |
| Year published | 2011-09-26 |
| Number of pages | 194 |
| Cover note | Book picture is for illustrative purposes only, actual binding, cover or edition may vary. |
| Note | Unavailable |