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.(183)  Fousse, Laurent, Hanrot, Guillaume, Lef`evre, Vincent, P Ielissier, Patrick, and Zimmermann, Paul. ... Pages 57a66 of Johnson, D. S. and Feige, U. ( eds.) ... computation at very large height. http://numbers.computation. free.fr/ Constants/Miscellaneous/zetazeros1e13-1e24. pdf. ... Pages 338a350 of Buhler, J. P. (ed.)anbsp;...
|Title||:||Modern Computer Arithmetic|
|Author||:||Richard P. Brent, Paul Zimmermann|
|Publisher||:||Cambridge University Press - 2010-11-25|