This is the revised and extended second edition of the successful basic book on computer arithmetic. It is consistent with the newest recent standard developments in the field. The book shows how the arithmetic and mathematical capability of the digital computer can be enhanced in a quite natural way. The work is motivated by the desire and the need to improve the accuracy of numerical computing and to control the quality of the computed results (validity). The accuracy requirements for the elementary floating-point operations are extended to the customary product spaces of computations including interval spaces. The mathematical properties of these models are extracted into an axiomatic approach which leads to a general theory of computer arithmetic. Detailed methods and circuits for the implementation of this advanced computer arithmetic on digital computers are developed in part two of the book. Part three then illustrates by a number of sample applications how this extended computer arithmetic can be used to compute highly accurate and mathematically verified results. The book can be used as a high-level undergraduate textbook but also as reference work for research in computer arithmetic and applied mathematics.

nexusstc/Computer Arithmetic and Validity: Theory, Implementation, and Applications/68c5f0f547469f0d8085dc46c4928e1f.pdf

lgli/10.1515_9783110301793.pdf

lgrsnf/10.1515_9783110301793.pdf

zlib/no-category/Ulrich Kulisch/Computer Arithmetic and Validity: Theory, Implementation, and Applications_25189337.pdf

Computer Arithmetic and Validity (De Gruyter Studies in Mathematics)

untitled

by Ulrich Kulisch

Ulrich W Kulisch

Saur, K. G., Verlag. ein Imprint der Walter de Gruyter GmbH

düsseldorf university press. in Walter de Gruyter GmbH

de Gruyter, Walter, GmbH

De Gruyter, Inc.

De Gruyter studies in mathematics -- 33, [Second fully revised and extended edition]., Berlin, Germany, 2013

De Gruyter studies in mathematics, 2nd ed., [rev. and extended, Berlin, 2013

De Gruyter studies in mathematics, 33, 2nd edition, Berlin, 2013

De Gruyter studies in mathematics, 33, 2. ed, Berlin [u.a, 2013

Revised ed., 2013-04-17

1, 20130430

2012

producers:
Acrobat Distiller 8.2.0 (Macintosh)

{"edition":"2","isbns":["3110301733","3110301792","3110301806","9783110301731","9783110301793","9783110301809"],"last_page":456,"publisher":"De Gruyter","series":"De Gruyter Studies in Mathematics; 33","source":"libgen_rs"}

Includes bibliographical references and index.

Foreword to the second edition
Preface
Introduction
I Theory of computer arithmetic
1 First concepts
1.1 Ordered sets
1.2 Complete lattices and complete subnets
1.3 Screens and roundings
1.4 Arithmetic operations and roundings
2 Ringoids and vectoids
2.1 Ringoids
2.2 Vectoids
3 Definition of computer arithmetic
3.1 Introduction
3.2 Preliminaries
3.3 The traditional definition of computer arithmetic
3.4 Definition of computer arithmetic by semimorphisms
3.5 A remark about roundings
3.6 Uniqueness of the minus operator
3.7 Rounding near zero
4 Interval arithmetic
4.1 Interval sets and arithmetic
4.2 Interval arithmetic over a linearly ordered set
4.3 Interval matrices
4.4 Interval vectors
4.5 Interval arithmetic on a screen
4.6 Interval matrices and interval vectors on a screen
4.7 Complex interval arithmetic
4.8 Complex interval matrices and interval vectors
4.9 Extended interval arithmetic
4.10 Exception-free arithmetic for extended intervals
4.11 Extended interval arithmetic on the computer
4.12 Exception-free arithmetic for closed real intervals on the computer
4.13 Comparison relations and lattice operations
4.14 Algorithmic implementation of interval multiplication and division
II Implementation of arithmetic on computers
5 Floating-point arithmetic
5.1 Definition and properties of the real numbers
5.2 Floating-point numbers and roundings
5.3 Floating-point operations
5.4 Subnormal floating-point numbers
5.5 On the IEEE floating-point arithmetic standard
6 Implementation of floating-point arithmetic on a computer
6.1 A brief review of the realization of integer arithmetic
6.2 Introductory remarks about the level 1 operations
6.3 Addition and subtraction
6.4 Normalization
6.5 Multiplication
6.6 Division
6.7 Rounding
6.8 A universal rounding unit
6.9 Overflow and underflow treatment
6.10 Algorithms using the short accumulator
6.11 The level 2 operations
7 Hardware support for interval arithmetic
7.1 Introduction
7.2 Arithmetic interval operations
7.2.1 Algebraic operations
7.2.2 Comments on the algebraic operations
7.3 Circuitry for the arithmetic interval operations
7.4 Comparisons and lattice operations
7.4.1 Comments on comparisons and lattice operations
7.4.2 Hardware support for comparisons and lattice operations
7.5 Alternative circuitry for interval operations and comparisons
7.5.1 Hardware support for interval arithmetic on x86-processors
7.5.2 Accurate evaluation of interval scalar products
8 Scalar products and complete arithmetic
8.1 Introduction and motivation
8.2 Historical remarks
8.3 The ubiquity of the scalar product in numerical analysis
8.4 Implementation principles
8.4.1 Long adder and long shift
8.4.2 Short adder with local memory on the arithmetic unit
8.4.3 Remarks
8.4.4 Fast carry resolution
8.5 Informal sketch for computing an exact dot product
8.6 Scalar product computation units (SPUs)
8.6.1 SPU for computers with a 32 bit data bus
8.6.2 A coprocessor chip for the exact scalar product
8.6.3 SPU for computers with a 64 bit data bus
8.7 Comments
8.7.1 Rounding
8.7.2 How much local memory should be provided on an SPU?
8.8 The data format complete and complete arithmetic
8.8.1 Low level instructions for complete arithmetic
8.8.2 Complete arithmetic in high level programming languages
8.9 Top speed scalar product units
8.9.1 SPU with long adder for 64 bit data word
8.9.2 SPU with long adder for 32 bit data word
8.9.3 An FPGA coprocessor for the exact scalar product
8.9.4 SPU with short adder and complete register
8.9.5 Carry-free accumulation of products in redundant arithmetic
8.10 Hardware complete register window
III Principles of verified computing
9 Sample applications
9.1 Basic properties of interval mathematics
9.1.1 Interval arithmetic, a powerful calculus to deal with inequalities
9.1.2 Interval arithmetic as executable set operations
9.1.3 Enclosing the range of function values
9.1.4 Nonzero property of a function, global optimization
9.2 Differentiation arithmetic, enclosures of derivatives
9.3 The interval Newton method
9.4 The extended interval Newton method
9.5 Verified solution of systems of linear equations
9.6 Accurate evaluation of arithmetic expressions
9.6.1 Complete expressions
9.6.2 Accurate evaluation of polynomials
9.6.3 Arithmetic expressions
9.7 Multiple precision arithmetics
9.7.1 Multiple precision floating-point arithmetic
9.7.2 Multiple precision interval arithmetic
9.7.3 Applications
9.7.4 Adding an exponent part as a scaling factor to complete arithmetic
9.8 Remarks on Kaucher arithmetic
9.8.1 The basic operations of Kaucher arithmetic
A Frequently used symbols
B On homomorphism
Bibliography
List of figures
List of tables
Index

This is the revised and extended second edition of the successful basic book on computer arithmetic. It is consistent with the newest recent standard developments in the field. The book shows how the arithmetic and mathematical capability of the digital computer can be enhanced in a quite natural way. The work is motivated by the desire and the need to improve the accuracy of numerical computing and to control the quality of the computed results (validity). The accuracy requirements for the elementary floating-point operations are extended to the customary product spaces of computations including interval spaces. The mathematical properties of these models are extracted into an axiomatic approach which leads to a general theory of computer arithmetic. Detailed methods and circuits for the implementation of this advanced computer arithmetic on digital computers are developed in part two of the book. Part three then illustrates by a number of sample applications how this extended computer arithmetic can be used to compute highly accurate and mathematically verified results. The book can be used as a high-level undergraduate textbook but also as reference work for research in computer arithmetic and applied mathematics.
Erscheinungsdatum: 17.04.2013

Focuses on computer arithmetic. This book shows how the arithmetic capability of the computer can be enhanced. It illustrates how the extended arithmetic can be used to compute highly accurate and mathematically verified results.

2023-06-01