Fundamental arithmetic operations support virtually all of the engineering, scientific, and financial computations required for practical applications, from cryptography, to financial planning, to rocket science. This comprehensive reference provides researchers with the thorough understanding of number representations that is a necessary foundation for designing efficient arithmetic algorithms. Using the elementary foundations of radix number systems as a basis for arithmetic, the authors develop and compare alternative algorithms for the fundamental operations of addition, multiplication, division, and square root with precisely defined roundings. Various finite precision number systems are investigated, with the focus on comparative analysis of practically efficient algorithms for closed arithmetic operations over these systems. Each chapter begins with an introduction to its contents and ends with bibliographic notes and an extensive bibliography. The book may also be used for graduate teaching: problems and exercises are scattered throughout the text and a solutions manual is available for instructors.

Mathematics of Computing -- Numerical Analysis.

This is the new edition of the classic book Computer Arithmetic in three volumes published originally in 1990 by IEEE Computer Society Press. As in the original, the book contains many classic papers treating advanced concepts in computer arithmetic, which is very suitable as stand-alone textbooks or complementary materials to textbooks on computer arithmetic for graduate students and research professionals interested in the field. Told in the words of the initial developers, this book conveys the excitement of the creators, and the implementations provide insight into the details necessary to realize real chips. This second volume presents topics on error tolerant arithmetic, digit on-line arithmetic, number systems, and now in this new edition, a topic on implementations of arithmetic operations, all wrapped with an updated overview and a new introduction for each chapter. This volume is part of a 3 volume set: Computer Arithmetic Volume I Computer Arithmetic Volume II Computer Arithmetic Volume III The full set is available for sale in a print-only version. Contents:Error Tolerant ArithmeticOn-Line ArithmeticVLSI Adder ImplementationsVLSI Multiplier ImplementationsFloating-Point VLSI ChipsNumber RepresentationImplementations Readership: Graduate students and research professionals interested in computer arithmetic. Key Features:It reprints the classic papersIt covers advanced arithmetic operationsIt does this in the words of the original creatorsKeywords:Computer Arithmetic;Fault Tolerant;Arithmetic;On-Line Arithmetic;Adder Implementations;Multiplier Implementations;Floating Point Chips;Number Representation;Implementations

Floating-point arithmetic is the most widely used way of implementing real-number arithmetic on modern computers. However, making such an arithmetic reliable and portable, yet fast, is a very difficult task. As a result, floating-point arithmetic is far from being exploited to its full potential. This handbook aims to provide a complete overview of modern floating-point arithmetic. So that the techniques presented can be put directly into practice in actual coding or design, they are illustrated, whenever possible, by a corresponding program. The handbook is designed for programmers of numerical applications, compiler designers, programmers of floating-point algorithms, designers of arithmetic operators, and more generally, students and researchers in numerical analysis who wish to better understand a tool used in their daily work and research.

Accuracy and Stability of Numerical Algorithms gives a thorough, up-to-date treatment of the behavior of numerical algorithms in finite precision arithmetic. It combines algorithmic derivations, perturbation theory, and rounding error analysis, all enlivened by historical perspective and informative quotations. This second edition expands and updates the coverage of the first edition (1996) and includes numerous improvements to the original material. Two new chapters treat symmetric indefinite systems and skew-symmetric systems, and nonlinear systems and Newton's method. Twelve new sections include coverage of additional error bounds for Gaussian elimination, rank revealing LU factorizations, weighted and constrained least squares problems, and the fused multiply-add operation found on some modern computer architectures.