Logo - springer
Slogan - springer

Birkhäuser - Birkhäuser Computer Science | Elementary Functions - Algorithms and Implementation

Elementary Functions

Algorithms and Implementation

Muller, Jean-Michel

2nd ed. 2006, XXII, 266 p. 36 illus.

A product of Birkhäuser Basel
Available Formats:
eBook
Information

Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.

You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.

After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.

 
$39.95

(net) price for USA

ISBN 978-0-8176-4408-6

digitally watermarked, no DRM

Included Format: PDF

download immediately after purchase


learn more about Springer eBooks

add to marked items

Hardcover
Information

Hardcover version

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.

 
$59.95

(net) price for USA

ISBN 978-0-8176-4372-0

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days


add to marked items

"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.

Content Level » Research

Keywords » Computer science - Hardware - algorithms - computer - ksa - numerical analysis - scientific computing

Related subjects » Birkhäuser Computer Science - Birkhäuser Mathematics

Table of contents 

List of figures.- List of tables.- Preface to the second edition.- Preface to the first edition.- Introduction.- Some basic things about computer arithmetic.- Part I. Algorithms based on polynomial approximation and/or table lookup, multiple-precision evaluation of functions.- Polynomial or rational approximations.- Table-based methods.- Multiple-precision evaluation of functions.- Part II. Shift-and-add algorithms.- Introduction to shift-and-add algorithms.- The CORDIC algorithm.- Some other shift-and-add algorithms.- Part III. Range reduction, final rounding and exceptions.- Range reduction.- Final rounding.- Miscellaneous.- Examples of implementation.- Bibliography.- Index

Popular Content within this publication 

 

Articles

Read this Book on Springerlink

Services for this book

New Book Alert

Get alerted on new Springer publications in the subject area of Theory of Computation.