Elementary Functions: Algorithms and Implementation

Front Cover
Springer Science & Business Media, 2006 - Computers - 265 pages
0 Reviews

"An important topic, which is on the boundary between numerical analysis and computer science.... I found the book well written and containing much interesting material, most of the time disseminated in specialized papers published in specialized journals difficult to find. Moreover, there are very few books on these topics and they are not recent."

–Numerical Algorithms (review of the first edition)

This unique book provides concepts and background necessary to understand and build algorithms for computing the elementary functions—sine, cosine, tangent, exponentials, and logarithms. The author presents and structures the algorithms, hardware-oriented as well as software-oriented, and also discusses issues related to accurate floating-point implementation. The purpose is not to give "cookbook recipes" that allow one to implement a given function, but rather to provide the reader with tools necessary to build or adapt algorithms for their specific computing environment.

This expanded second edition contains a number of revisions and additions, which incorporate numerous new results obtained during the last few years. New algorithms invented since 1997—such as Matula’s bipartite method, another table-based method due to Ercegovac, Lang, Tisserand, and Muller—as well as new chapters on multiple-precision arithmetic and examples of implementation have been added. In addition, the section on correct rounding of elementary functions has been fully reworked, also in the context of new results. Finally, the introductory presentation of floating-point arithmetic has been expanded, with more emphasis given to the use of the fused multiply-accumulate instruction.

The book is an up-to-date presentation of information needed to understand and accurately use mathematical functions and algorithms in computational work and design. Graduate and advanced undergraduate students, professionals, and researchers in scientific computing, numerical analysis, software engineering, and computer engineering will find the book a useful reference and resource.


What people are saying - Write a review

We haven't found any reviews in the usual places.


Some Basic Things About Computer Arithmetic
Algorithms Based on Polynomial Approximation andor Table Lookup MultiplePrecision Evaluation of Functions
Polynomial or Rational Approximations
MultiplePrecision Evaluation of Functions
ShiftandAdd Algorithms
Introduction to ShiftandAdd Algorithms
The CORDIC Algorithm
Some Other ShiftandAdd Algorithms
Range Reduction Final Rounding and Exceptions
Range Reduction
Final Rounding
Examples of Implementation

Common terms and phrases

Popular passages

Page 244 - Redundant and online CORDIC: Application to matrix triangularization and SVD,
Page 257 - DA Sunderland, RA Strauch, SS Wharfield, HT Peterson, and CR Cole, "CMOS/SOS Frequency Synthesizer LSI Circuit for Spread Spectrum Communications," IEEE Journal of Solid State Circuits, August 1984, pp.
Page 240 - Reprinted in EE Swartzlander, Computer Arithmetic, Vol. 1, IEEE Computer Society Press Tutorial, Los Alamitos, CA, 1990.
Page 257 - N. Takagi, T. Asada and S. Yajima, A hardware algorithm for computing sine and cosine using redundant binary representation, Trans.
Page 258 - D. Timmermann, H. Hahn, BJ Hosticka, and G. Schmidt, "A programmable CORDIC chip for digital signal processing applications," IEEE Journal of Solid-State Circuits, Vol.
Page 259 - A. Ziv. Fast Evaluation of Elementary Mathematical Functions with Correctly Rounded last Bit.
Page 258 - Walther. A unified algorithm for elementary functions. In Joint Computer Conference Proceedings, 1971. Reprinted in EE Swartzlander, Computer Arithmetic...

References to this book

All Book Search results »

Bibliographic information