<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
  <record>
    <leader>03465pam a2200313 a 4500</leader>
    <controlfield tag="001">elementaryfuncti0000mull</controlfield>
    <controlfield tag="003">CaSfIA</controlfield>
    <controlfield tag="005">20250723113006.0</controlfield>
    <controlfield tag="006">m     o  d</controlfield>
    <controlfield tag="007">cr||||||||||||</controlfield>
    <controlfield tag="008">050520t20062006maua    ob    001 0 eng  </controlfield>
    <datafield tag="010" ind1=" " ind2=" ">
      <subfield code="z">  2005048094</subfield>
    </datafield>
    <datafield tag="020" ind1=" " ind2=" ">
      <subfield code="z">0817643729 (alk. paper)</subfield>
    </datafield>
    <datafield tag="035" ind1=" " ind2=" ">
      <subfield code="a">(OCoLC)1391402827</subfield>
    </datafield>
    <datafield tag="040" ind1=" " ind2=" ">
      <subfield code="a">DLC</subfield>
      <subfield code="c">DLC</subfield>
      <subfield code="d">YDX</subfield>
      <subfield code="d">BAKER</subfield>
      <subfield code="d">OHX</subfield>
      <subfield code="d">OrLoB-B</subfield>
      <subfield code="d">CaSfIA</subfield>
    </datafield>
    <datafield tag="050" ind1="0" ind2="4">
      <subfield code="a">QA331</subfield>
      <subfield code="b">.M866 2006</subfield>
    </datafield>
    <datafield tag="082" ind1="0" ind2="4">
      <subfield code="a">518/.1</subfield>
      <subfield code="2">22</subfield>
    </datafield>
    <datafield tag="100" ind1="1" ind2=" ">
      <subfield code="a">Muller, J. M.</subfield>
      <subfield code="q">(Jean-Michel),</subfield>
      <subfield code="d">1961-</subfield>
      <subfield code="0">http://id.loc.gov/authorities/names/n97043073</subfield>
    </datafield>
    <datafield tag="245" ind1="1" ind2="0">
      <subfield code="a">Elementary functions :</subfield>
      <subfield code="b">algorithms and implementation /</subfield>
      <subfield code="c">Jean-Michel Muller.</subfield>
    </datafield>
    <datafield tag="250" ind1=" " ind2=" ">
      <subfield code="a">2nd ed.</subfield>
    </datafield>
    <datafield tag="260" ind1=" " ind2=" ">
      <subfield code="a">Boston :</subfield>
      <subfield code="b">Birkhäuser,</subfield>
      <subfield code="c">[2006], ©2006.</subfield>
    </datafield>
    <datafield tag="300" ind1=" " ind2=" ">
      <subfield code="a">1 online resource (xxii, 265 pages :</subfield>
      <subfield code="b">illustrations)</subfield>
    </datafield>
    <datafield tag="336" ind1=" " ind2=" ">
      <subfield code="a">text</subfield>
      <subfield code="b">txt</subfield>
      <subfield code="2">rdacontent</subfield>
    </datafield>
    <datafield tag="337" ind1=" " ind2=" ">
      <subfield code="a">unmediated</subfield>
      <subfield code="b">n</subfield>
      <subfield code="2">rdamedia</subfield>
    </datafield>
    <datafield tag="504" ind1=" " ind2=" ">
      <subfield code="a">Includes bibliographical references (p. [233]-259) and index.</subfield>
    </datafield>
    <datafield tag="505" ind1="0" ind2="0">
      <subfield code="g">1.</subfield>
      <subfield code="t">Introduction -- </subfield>
      <subfield code="g">2.</subfield>
      <subfield code="t">Some basic things about computer arithmetic -- </subfield>
      <subfield code="g">I.</subfield>
      <subfield code="t">Algorithms based on polynomial approximation and/or table lookup, multiple-precision evaluation of functions -- </subfield>
      <subfield code="g">3.</subfield>
      <subfield code="t">Polynomial or rational approximations -- </subfield>
      <subfield code="g">4.</subfield>
      <subfield code="t">Table-based methods -- </subfield>
      <subfield code="g">5.</subfield>
      <subfield code="t">Multiple-precision evaluation of functions -- </subfield>
      <subfield code="g">II.</subfield>
      <subfield code="t">Shift-and-add algorithms -- </subfield>
      <subfield code="g">6.</subfield>
      <subfield code="t">Introduction to shift-and-add algorithms -- </subfield>
      <subfield code="g">7.</subfield>
      <subfield code="t">The CORDIC algorithm -- </subfield>
      <subfield code="g">8.</subfield>
      <subfield code="t">Some other shift-and-add algorithms -- </subfield>
      <subfield code="g">III.</subfield>
      <subfield code="t">Range reduction, final rounding and exceptions -- </subfield>
      <subfield code="g">9.</subfield>
      <subfield code="t">Range reduction -- </subfield>
      <subfield code="g">10.</subfield>
      <subfield code="t">Final rounding -- </subfield>
      <subfield code="g">11.</subfield>
      <subfield code="t">Miscellaneous -- </subfield>
      <subfield code="g">12.</subfield>
      <subfield code="t">Examples of implementation.</subfield>
    </datafield>
    <datafield tag="520" ind1="1" ind2=" ">
      <subfield code="a">"This 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."--BOOK JACKET.</subfield>
    </datafield>
    <datafield tag="650" ind1=" " ind2="0">
      <subfield code="a">Functions</subfield>
      <subfield code="x">Data processing.</subfield>
      <subfield code="0">http://id.loc.gov/authorities/subjects/sh2008121325</subfield>
    </datafield>
    <datafield tag="650" ind1=" " ind2="0">
      <subfield code="a">Algorithms.</subfield>
      <subfield code="0">http://id.loc.gov/authorities/subjects/sh85003487</subfield>
    </datafield>
    <datafield tag="852" ind1="0" ind2="0">
      <subfield code="b">off,eng</subfield>
      <subfield code="h">QA331</subfield>
      <subfield code="i">.M866 2006</subfield>
    </datafield>
    <datafield tag="856" ind1="4" ind2="0">
      <subfield code="u">https://archive.org/details/elementaryfuncti0000mull</subfield>
      <subfield code="z">Free eBook from the Internet Archive</subfield>
    </datafield>
    <datafield tag="856" ind1="4" ind2="0">
      <subfield code="u">https://openlibrary.org/books/OL8074842M</subfield>
      <subfield code="z">Additional information and access via Open Library</subfield>
    </datafield>
    <datafield tag="955" ind1=" " ind2=" ">
      <subfield code="q">elementaryfuncti0000mull</subfield>
      <subfield code="b">ark:/13960/s2760gsxb6z</subfield>
    </datafield>
  </record>
</collection>
