Computer Arithmetic in Theory and Practi
β Miranker, Willard L.; Kulisch, Ulrich
π Library
π
1981
π Academic Press
π English
β¦ LIBER β¦
π
Computer Arithmetic in Theory and Practice
β Scribed by Ulrich W. Kulisch, Willard L. Miranker and Werner Rheinboldt (Auth.)
- Publisher
- Elsevier Inc, Academic Press
- Year
- 1981
- Tongue
- English
- Leaves
- 252
- Series
- Computer Science & Applied Mathematics
- Edition
- 1St Edition
- Category
- Library
β¬ Acquire This Volume
No coin nor oath required. For personal study only.
β¦ Table of Contents
Content:
Front Matter, Page iii
Copyright, Page iv
Dedication, Pages v-vi
PREFACE, Pages xi-xiii
INTRODUCTION AND PRELIMINARY DEFINITION OF COMPUTER ARITHMETIC, Pages 1-9
Chapter 1 - FIRST CONCEPTS, Pages 13-40
Chapter 2 - RINGOIDS AND VECTOIDS, Pages 41-63
Chapter 3 - DEFINITION OF COMPUTER ARITHMETIC, Pages 64-83
Chapter 4 - INTERVAL ARITHMETIC, Pages 84-138
Chapter 5 - FLOATING-POINT ARITHMETIC, Pages 141-168
Chapter 6 - IMPLEMENTATION OF FLOATING-POINT ARITHMETIC ON A COMPUTER, Pages 169-219
Chapter 7 - COMPUTER ARITHMETIC AND PROGRAMMING LANGUAGES, Pages 220-238
REFERENCES, Pages 239-243
GLOSSARY OF SYMBOLS AND FORMULAS, Pages 245-246
INDEX, Pages 247-249
Computer Science and Applied Mathematics: A SERIES OF MONOGRAPHS AND TEXTBOOKS, Pages ibc1-ibc2
π SIMILAR VOLUMES
Computer Arithmetic in Practice: Exercis
β Slawomir GryΕ
π Library
π
2023
π CRC Press
π English
Computer Arithmetic in Practice - Exercises and Programming is a simple, brief introductory volume for undergraduate and graduate students at university courses interested in understanding the foundation of computers. It is focused on numeric data formats and capabilities of computer to perform basi
Computer Arithmetic in Practice. Exercis
β SΕawomir GryΕ
π Library
π
2024
π CRC Press
π English
Arithmetic, Proof Theory, and Computatio
β Peter Clote, Jan KrajΓcek
π Library
π
1993
π Oxford University Press, USA
π English
This book principally concerns the rapidly growing area of what might be termed "Logical Complexity Theory": the study of bounded arithmetic, propositional proof systems, length of proof, and similar themes, and the relations of these topics to computational complexity theory. Issuing from a two-ye
Arithmetic Geometry, Number Theory, and
β Jennifer S. Balakrishnan (editor), Noam Elkies (editor), Brendan Hassett (editor
π Library
π
2022
π Springer
π English
<span><div>This volume contains articles related to the work of the Simons Collaboration βArithmetic Geometry, Number Theory, and Computation.β The papers present mathematical results and algorithms necessary for the development of large-scale databases like the L-functions and Modular Forms Databas
Arithmetic Geometry, Number Theory, and
β Jennifer S. Balakrishnan (editor), Noam Elkies (editor), Brendan Hassett (editor
π Library
π
2022
π Springer International Publishing
π English
<span><div>This volume contains articles related to the work of the Simons Collaboration βArithmetic Geometry, Number Theory, and Computation.β The papers present mathematical results and algorithms necessary for the development of large-scale databases like the L-functions and Modular Forms Databas