Modern Computer Arithmetic

Inbunden, Engelska, 2010

Del 18 i serien Cambridge Monographs on Applied and Computational Mathematics

1 309 kr

Beställningsvara. Skickas inom 7-10 vardagar. Fri frakt över 249 kr.

Beskrivning

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.

Produktinformation

Utgivningsdatum:2010-11-25
Mått:156 x 235 x 17 mm
Vikt:470 g
Format:Inbunden
Språk:Engelska
Serie:Cambridge Monographs on Applied and Computational Mathematics
Antal sidor:236
Förlag:Cambridge University Press
ISBN:9780521194693

Utforska kategorier

Systemvetenskap och AI inom Data och IT

Mer om författaren

Richard Brent is a Professor of Mathematics and Computer Science at the Australian National University, Canberra. Paul Zimmermann is a researcher at the Institut National de Recherche en Informatique et en Automatique (INRIA).

Recensioner i media

'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

Innehållsförteckning

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.