Modern Computer Arithmetic
Modern Computer Arithmetic
Paul Zimmermann, Institut National de Recherche en Informatique et en Automatique (INRIA), Nancy
£96.00
GBPModern Computer Arithmetic focuses on arbitrary-precision algorithms for efficiently performing arithmetic operations such as addition, multiplication and division, and their connections to topics such as modular arithmetic, greatest common divisors, the Fast Fourier Transform (FFT), and the computation of elementary and special functions. Brent and Zimmermann present algorithms that are ready to implement in your favourite language, while keeping a high-level description and avoiding too low-level or machine-dependent details. The book is intended for anyone interested in the design and implementation of efficient high-precision algorithms for computer arithmetic, and more generally efficient multiple-precision numerical algorithms. It may also be used in a graduate course in mathematics or computer science, for which exercises are included. These vary considerably in difficulty, from easy to small research projects, and expand on topics discussed in the text. Solutions to selected exercises are available from the authors.
- Contains all the important algorithms relevant to integers, modular arithmetic, floating-point numbers and special functions
- Each algorithm is presented in a form ready to implement in software
- Solutions to exercises are available from the authors' web site
Reviews & endorsements
'Very few books do justice to material that is suitable for both professional software engineers and graduate students. This book does just that, without losing its focus or stressing one audience over the other. As the authors make clear, this book is about algorithms for arithmetic (and not hardware considerations and implementations); this focus allows them to cover integer arithmetic, modular arithmetic, and floating-point arithmetic broadly and in detail. the notes and references at the end of each chapter guide readers to more details, and provide a historical backdrop for each major topic.' Marlin Thomas, Reviews.com
Product details
January 2011Adobe eBook Reader
9780511984853
0 pages
0kg
15 b/w illus. 190 exercises
This ISBN is for an eBook version which is distributed on our behalf by a third party.
Related links
Table of Contents
- Preface
- Acknowledgements
- Notation
- 1. Integer arithmetic
- 2. Modular arithmetic and the FFT
- 3. Floating-point arithmetic
- 4. Newton's method and function evaluation
- Appendix. Implementations and pointers
- Bibliography
- Index.
