Modern 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.
Cambridge University Press (Virtual Publishing)
|Country of origin:
||Cambridge Monographs on Applied and Computational Mathematics, 18
Richard P Brent
• Paul Zimmermann
||Electronic book text
Is the information for this product incomplete, wrong or inappropriate?
Let us know about it.
Does this product have an incorrect or missing image?
Send us a new image.
Is this product missing categories?
Add more categories.
Review This Product
No reviews yet - be the first to create one!