Elementary Functions Algorithms and Implementation /

• Κύριος συγγραφέας: Muller, Jean-Michel (Συγγραφέας)
• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Boston, MA : Birkhäuser Boston, 2006.
• Έκδοση: Second Edition.
• Θέματα: Computer science.; Architecture, Computer.; Computers.; Computer science > Mathematics.; Numerical analysis.; Applied mathematics.; Engineering mathematics.; Computer mathematics.; Computer Science.; Theory of Computation.; Computer System Implementation.; Applications of Mathematics.; Numeric Computing.; Computational Science and Engineering.; Mathematics of Computing.

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

 Some Basic Things About Computer Arithmetic -- Some Basic Things About Computer Arithmetic -- 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 -- Shift-and-Add Algorithms -- to Shift-and-Add Algorithms -- The CORDIC Algorithm -- Some Other Shift-and-Add Algorithms -- Range Reduction, Final Rounding and Exceptions -- Range Reduction -- Final Rounding -- Miscellaneous -- Examples of Implementation.