Skip to main content Accessibility help
×
  • Cited by 145
      • Richard P. Brent, Australian National University, Canberra, Paul Zimmermann, Institut National de Recherche en Informatique et en Automatique (INRIA), Nancy
      Show more authors
    • You may already have access via personal or institutional login
    • Select format
    • Publisher:
      Cambridge University Press
      Publication date:
      August 2012
      November 2010
      ISBN:
      9780511921698
      9780521194693
      Dimensions:
      (228 x 152 mm)
      Weight & Pages:
      0.47kg, 236 Pages
      Dimensions:
      Weight & Pages:
    You may already have access via personal or institutional login
  • Selected: Digital
    Add to cart View cart Buy from Cambridge.org

    Book description

    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.

    Reviews

    '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 Source: Reviews.com

    Refine List

    Actions for selected content:

    Select all | Deselect all
    • View selected items
    • Export citations
    • Download PDF (zip)
    • Save to Kindle
    • Save to Dropbox
    • Save to Google Drive

    Save Search

    You can save your searches here and later view and run them again in "My saved searches".

    Please provide a title, maximum of 40 characters.
    ×

    Contents

    Metrics

    Altmetric attention score

    Full text views

    Total number of HTML views: 0
    Total number of PDF views: 0 *
    Loading metrics...

    Book summary page views

    Total views: 0 *
    Loading metrics...

    * Views captured on Cambridge Core between #date#. This data will be updated every 24 hours.

    Usage data cannot currently be displayed.

    Accessibility standard: Unknown

    Why this information is here

    This section outlines the accessibility features of this content - including support for screen readers, full keyboard navigation and high-contrast display options. This may not be relevant for you.

    Accessibility Information

    Accessibility compliance for the PDF of this book is currently unknown and may be updated in the future.