Atjaunināt sīkdatņu piekrišanu

Modern Computer Arithmetic [Hardback]

4.75/5 (7 ratings by Goodreads)
, (Australian National University, Canberra)
  • Formāts: Hardback, 236 pages, height x width x depth: 235x156x17 mm, weight: 470 g, Worked examples or Exercises; 15 Line drawings, black and white
  • Sērija : Cambridge Monographs on Applied and Computational Mathematics
  • Izdošanas datums: 25-Nov-2010
  • Izdevniecība: Cambridge University Press
  • ISBN-10: 0521194695
  • ISBN-13: 9780521194693
Citas grāmatas par šo tēmu:
  • Hardback
  • Cena: 127,54 €
  • Grāmatu piegādes laiks ir 3-4 nedēļas, ja grāmata ir uz vietas izdevniecības noliktavā. Ja izdevējam nepieciešams publicēt jaunu tirāžu, grāmatas piegāde var aizkavēties.
  • Daudzums:
  • Ielikt grozā
  • Piegādes laiks - 4-6 nedēļas
  • Pievienot vēlmju sarakstam
Modern Computer ArithmeticPalielināt
  • Formāts: Hardback, 236 pages, height x width x depth: 235x156x17 mm, weight: 470 g, Worked examples or Exercises; 15 Line drawings, black and white
  • Sērija : Cambridge Monographs on Applied and Computational Mathematics
  • Izdošanas datums: 25-Nov-2010
  • Izdevniecība: Cambridge University Press
  • ISBN-10: 0521194695
  • ISBN-13: 9780521194693
Citas grāmatas par šo tēmu:
Permanent link: https://www.kriso.lv/db/9780521194693.html
Keywords:
Modern Computer Arithmetic focuses on arbitrary-precision algorithms for efficiently performing arithmetic operations such as addition, multiplication and division, and related topics such as modular arithmetic. The authors 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.

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 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 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 are available from the authors.

Recenzijas

'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

Papildus informācija

Contains all state-of-the-art algorithms dealing with multiple-precision integers or floating-point numbers in a ready-to-implement format.
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.
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).