Complexity
» » Modern Computer Arithmetic by Richard P. Brent, Paul Zimmermann Publisher: LORIA 2009 Number of pages: 239 Description: This book collects in the same document all state-of-the-art algorithms in multiple precision arithmetic (integers, integers modulo n, floating-point numbers). The book will be useful for graduate students in computer science and mathematics, researchers in discrete mathematics, computer algebra, number theory, cryptography, and developers of multiple-precision libraries. Download or read it online for free here: (1.9MB, PDF).
Modern 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. Brent and Zimmermann present algorithms that are ready to implement in your favorite 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 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 or, for which exercises are included. These vary considerably in difficulty, from easy to small research, and expand on topics discussed in the text.
![Operations Operations](https://upload.wikimedia.org/wikipedia/commons/thumb/9/9e/Difference_engine_plate_1853.jpg/220px-Difference_engine_plate_1853.jpg)
![Modern Modern](/uploads/1/2/4/2/124226716/385781382.jpg)
Computer Arithmetic Pdf
Solutions are available from the authors. Table of Contents 1 Integer arithmetic 2 Modular arithmetic and the FFT 3 Floating-point arithmetic 4 Elementary and special function evaluation 5 Implementations and pointers.