Buy this book
 About this Textbook

"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, hardwareoriented as well as softwareoriented, and also discusses issues related to accurate floatingpoint 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 tablebased method due to Ercegovac, Lang, Tisserand, and Muller—as well as new chapters on multipleprecision 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 floatingpoint arithmetic has been expanded, with more emphasis given to the use of the fused multiplyaccumulate instruction.
The book is an uptodate 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.
 Reviews

"There a few classic books on algorithms for computing elementary functions.... These books focused on software implementation using polynomial approximations. Perhaps Muller's book is destined to become a new classic in this subject, but only time will tell.... Muller's book contains few theorems and even fewer proofs. It does contain many numerical examples, complete with Maple code.... In summary, this book seems like an essential reference for the experts (which I'm not). More importantly, this is an interesting book for the curious (which I am). In this case, you'll probably learn many interesting things from this book. If you teach numerical analysis or approximation theory, then this book will give you some good examples to discuss in class." —MAA Reviews (Review of Second Edition)
"The rich content of ideas sketched or presented in some detail in this book is supplemented by a list of over three hundred references, most of them of 1980 or more recent. The book also contains some relevant typical programs." —Zentralblatt MATH (Review of Second Edition)
"This book is devoted to the computation of elementary functions (such as sine, cosine, tan, exponentials and logarithms) and it is intended for specialists and inquiring minds as the author says in his preface. I also think that the book will be very valuable to students both in numerical analysis and in computer science. The author is well known among people working on computer arithmetic. 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 First Edition)
"This book is intended for two different audiences: specialists, who have to design floatingpoint systems…or to do research on algorithms, and inquiring minds, who just want to know what kind of methods are used to compute mathematical functions in current computers or pocket calculators. Because of this, it will be helpful for postgraduate and advanced undergraduate students in computer science or applied mathematics as well as for professionals engaged in the design of algorithms, programs or circuits that implement floatingpoint arithmetic, or simply for engineers or scientists who want to improve their culture in that domain. Much of the book can be understood with only a basic grounding in computer science and mathematics." —Mathematica Bohemia (Review of First Edition)
"The author presents a stateoftheart review of techniques used to compute the values of common elementary functions. Chapter 1 introduces the goals of techniques that produce good approximations. Chapter 2 reviews topics in computer arithmetic, including number representation (redundant and nonredundant) and the IEEE standard for binary floatingpoint arithmetic. Chapters 3 and 4 review the techniques (polynomial, rational, and tablebased) used in some current microprocessors. Chapters 5, 6, and 7 review shiftandadd techniques, including the CORDIC method frequently used by calculator designers. Chapter 8 discusses range reduction. Chapter 9 discusses techniques that help produce correctly rounded results." —Mathematical Reviews (Review of First Edition)
"A must for those involved with designing numerical processors or mathematical software, the book should also interest calculus students for the new perspectives it offers on topics they might think they know very well. Suitable for upperdivision undergraduates through faculty." —Choice (Review of First Edition)
"This fascinating book describes the techniques used by highlevel compilers and by pocket book calculators to generate values of the common elementary mathematical functions." —ASLIB Book Guide (Review of First Edition)
"The author fully accomplishes his aim of giving the necessary theoretical background in order to both understand and build algorithms for the computation of elementary functions (such as sine, cosine, exponential, logarithms), that are the most commonly used mathematical functions. Hardware as well as softwareoriented algorithms are presented, together with a pertinent analysis of accurate floatingpoint implementations…Good examples are always chosen in order to introduce or to illustrate the methods, following the given cases. The book is very well structured…" —Analele Stiintifice ale Universitatii “Al. I. Cuza” din Iasi
 Table of contents (12 chapters)


Introduction
Pages 17

Some Basic Things About Computer Arithmetic
Pages 924

Polynomial or Rational Approximations
Pages 2766

TableBased Methods
Pages 6787

MultiplePrecision Evaluation of Functions
Pages 89100

Table of contents (12 chapters)
Buy this book
Services for this Book
Bibliographic Information
 Bibliographic Information

 Book Title
 Elementary Functions
 Book Subtitle
 Algorithms and Implementation
 Authors

 JeanMichel Muller
 Copyright
 2006
 Publisher
 Birkhäuser Basel
 Copyright Holder
 Birkhäuser Boston
 eBook ISBN
 9780817644086
 DOI
 10.1007/b137928
 Edition Number
 2
 Number of Pages
 XXII, 266
 Number of Illustrations
 36 b/w illustrations
 Topics