Elementary Functions
Algorithms and Implementation
2nd ed. edition
Our rough guess is there are 66,500 words in this book.
At a pace averaging 250 words per minute, this book will take 4 hours and 26 minutes to read. With a half hour per day, this will take 9 days to read.
How long will it take you?
This book will take an estimated to read at a reading speed averaging words per minute. With 30 minutes per day, this will take to read.
Enter your reading speedYou can take one of our WPM reading speed tests to find your reading speed.
Create a free account to track your reading progress, build your reading list, and set reading goals.
Word Count
66,500 words, Guess
Page Count
266 pages
Physical Format
Hardcover
Identifiers
- Open LibraryOL8074842M
- ISBN-139780817643720
- ISBN-100817643729
- OCLC Control Number60500353
- OCLC Control Numberelementaryfuncti00mull_933
and 3 more
- Library of Congress Control Number2005048094
- Goodreads1059953
- LibraryThing7565444
Classifications
- LCCQA331 .M866 2006
Description
"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.
Subjects
Topics
Other Editions
- Elementary Functions: Algorithms and Implementation
Show 1 more editions
Similar Books
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!