Skip to content
Register Sign in Wishlist

Modern Computer Arithmetic


Part of Cambridge Monographs on Applied and Computational Mathematics

  • Authors:
  • Richard P. Brent, Australian National University, Canberra
  • Paul Zimmermann, Institut National de Recherche en Informatique et en Automatique (INRIA), Nancy
  • Date Published: November 2010
  • availability: Available
  • format: Hardback
  • isbn: 9780521194693

$ 115.00

Add to cart Add to wishlist

Other available formats:

Looking for an evaluation copy?

This title is not currently available for evaluation. However, if you are interested in the title for your course we can consider offering an evaluation copy. To register your interest please contact providing details of the course you are teaching.

Product filter button
About the Authors
  • 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.

    • Contains all the important algorithms relevant to integers, modular arithmetic, floating-point numbers and special functions
    • Each algorithm is presented in a form ready to implement in software
    • Solutions to exercises are available from the authors' web site
    Read more

    Reviews & endorsements

    '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,

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity


    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?


    Product details

    • Date Published: November 2010
    • format: Hardback
    • isbn: 9780521194693
    • length: 236 pages
    • dimensions: 235 x 156 x 17 mm
    • weight: 0.47kg
    • contains: 15 b/w illus. 190 exercises
    • availability: Available
  • Table of Contents

    1. Integer arithmetic
    2. Modular arithmetic and the FFT
    3. Floating-point arithmetic
    4. Newton's method and function evaluation
    Appendix. Implementations and pointers

  • Resources for

    Modern Computer Arithmetic

    Richard P. Brent, Paul Zimmermann

    General Resources

    Find resources associated with this title

    Type Name Unlocked * Format Size

    Showing of

    Back to top

    *This title has one or more locked files and access is given only to lecturers adopting the textbook for their class. We need to enforce this strictly so that solutions are not made available to students. To gain access to locked resources you either need first to sign in or register for an account.

    These resources are provided free of charge by Cambridge University Press with permission of the author of the corresponding work, but are subject to copyright. You are permitted to view, print and download these resources for your own personal use only, provided any copyright lines on the resources are not removed or altered in any way. Any other use, including but not limited to distribution of the resources in modified form, or via electronic or other media, is strictly prohibited unless you have permission from the author of the corresponding work and provided you give appropriate acknowledgement of the source.

    If you are having problems accessing these resources please email

  • Authors

    Richard P. Brent, Australian National University, Canberra
    Richard Brent is a Professor of Mathematics and Computer Science at the Australian National University, Canberra.

    Paul Zimmermann, Institut National de Recherche en Informatique et en Automatique (INRIA), Nancy
    Paul Zimmermann is a researcher at the Institut National de Recherche en Informatique et en Automatique (INRIA).

Sign In

Please sign in to access your account


Not already registered? Create an account now. ×

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner Please see the permission section of the catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×

Find content that relates to you

Join us online

This site uses cookies to improve your experience. Read more Close

Are you sure you want to delete your account?

This cannot be undone.


Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

Please fill in the required fields in your feedback submission.