000 04084nam a22003735i 4500
001 280876
003 MX-SnUAN
005 20160429154041.0
007 cr nn 008mamaa
008 150903s2006 xxu| o |||| 0|eng d
020 _a9780817644086
_99780817644086
024 7 _a10.1007/b137928
_2doi
035 _avtls000333464
039 9 _a201509030433
_bVLOAD
_c201405070509
_dVLOAD
_y201402041111
_zstaff
040 _aMX-SnUAN
_bspa
_cMX-SnUAN
_erda
050 4 _aQA297-299.4
100 1 _aMuller, Jean-Michel.
_eautor
_9305671
245 1 0 _aElementary Functions :
_bAlgorithms and Implementation /
_cby Jean-Michel Muller.
250 _aSecond Edition.
264 1 _aBoston, MA :
_bBirkhäuser Boston,
_c2006.
300 _axxii, 266 páginas 36 ilustraciones
_brecurso en línea.
336 _atexto
_btxt
_2rdacontent
337 _acomputadora
_bc
_2rdamedia
338 _arecurso en línea
_bcr
_2rdacarrier
347 _aarchivo de texto
_bPDF
_2rda
500 _aSpringer eBooks
505 0 _aSome 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.
520 _a"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.
590 _aPara consulta fuera de la UANL se requiere clave de acceso remoto.
710 2 _aSpringerLink (Servicio en línea)
_9299170
776 0 8 _iEdición impresa:
_z9780817643720
856 4 0 _uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/b137928
_zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL)
942 _c14
999 _c280876
_d280876