Elementary functions: algorithms and implementation
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | German |
| Veröffentlicht: |
Boston [u.a.]
Birkhäuser
2006
|
| Ausgabe: | 2. ed. |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | XXII, 265 S. graph. Darst. |
| ISBN: | 9780817643720 0817643729 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV021295549 | ||
| 003 | DE-604 | ||
| 005 | 20110801 | ||
| 007 | t | ||
| 008 | 060117s2006 gw d||| |||| 00||| ger d | ||
| 020 | |a 9780817643720 |9 978-0-8176-4372-0 | ||
| 020 | |a 0817643729 |9 0-8176-4372-9 | ||
| 035 | |a (OCoLC)60500353 | ||
| 035 | |a (DE-599)DNB972292802 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a ger | |
| 044 | |a gw |c DE | ||
| 049 | |a DE-824 |a DE-703 |a DE-706 |a DE-83 |a DE-11 |a DE-384 |a DE-898 |a DE-355 | ||
| 050 | 0 | |a QA331 | |
| 082 | 0 | |a 518/.1 |2 22 | |
| 084 | |a SK 905 |0 (DE-625)143269: |2 rvk | ||
| 084 | |a SK 910 |0 (DE-625)143270: |2 rvk | ||
| 084 | |a SK 950 |0 (DE-625)143273: |2 rvk | ||
| 084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
| 084 | |a MAT 650f |2 stub | ||
| 084 | |a MAT 330f |2 stub | ||
| 100 | 1 | |a Muller, Jean-Michel |d 1961- |e Verfasser |0 (DE-588)111675014 |4 aut | |
| 245 | 1 | 0 | |a Elementary functions |b algorithms and implementation |c Jean-Michel Muller |
| 250 | |a 2. ed. | ||
| 264 | 1 | |a Boston [u.a.] |b Birkhäuser |c 2006 | |
| 300 | |a XXII, 265 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 650 | 4 | |a Algorithmes | |
| 650 | 7 | |a Algoritmos |2 larpcal | |
| 650 | 4 | |a Fonctions (Mathématiques) - Informatique | |
| 650 | 7 | |a Matemática (processamento de dados) |2 larpcal | |
| 650 | 4 | |a Datenverarbeitung | |
| 650 | 4 | |a Algorithms | |
| 650 | 4 | |a Functions |x Data processing | |
| 650 | 0 | 7 | |a Numerisches Verfahren |0 (DE-588)4128130-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Numerische Mathematik |0 (DE-588)4042805-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Elementare Funktion |0 (DE-588)4302697-7 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Elementare Funktion |0 (DE-588)4302697-7 |D s |
| 689 | 0 | 1 | |a Numerisches Verfahren |0 (DE-588)4128130-5 |D s |
| 689 | 0 | |8 1\p |5 DE-604 | |
| 689 | 1 | 0 | |a Numerische Mathematik |0 (DE-588)4042805-9 |D s |
| 689 | 1 | |8 2\p |5 DE-604 | |
| 856 | 4 | 2 | |m OEBV Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=014616315&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-014616315 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 2\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
Datensatz im Suchindex
| _version_ | 1804135090251366400 |
|---|---|
| adam_text | CONTENTS LIST OF FIGURES XI LIST OF TABLES XV PREFACE TO THE SECOND
EDITION XIX PREFACE TO THE FIRST EDITION XXI 1 INTRODUCTION 1 SOME BASIC
THINGS ABOUT COMPUTER ARITHMETIC 9 ....................... 2.1
FLOATING-POINT ARITHMETIC 9 ..................... 2.1.1 FLOATING-POINT
FORMATS 9 ........................ 2.1.2 ROUNDING MODES 11 .............
2.1.3 SUBNORMAL NUMBERS AND EXCEPTIONS 13
............................... 2.1.4 ULPS 14 ................ 2.1.5
FUSED MULTIPLY-ADD OPERATIONS 15 .......... 2.1 -6 TESTING YOUR
COMPUTATIONAL ENVIRONMENT 16 ............. 2.1.7 FLOATING-POINT
ARITHMETIC AND PROOFS 17 2.1.8 MAPLE PROGRAMS THAT COMPUTE
DOUBLE-PRECISION ......................... APPROXIMATIONS 17
..................... 2.2 REDUNDANT NUMBER SYSTEMS 19 .................
2.2.1 SIGNED-DIGIT NUMBER SYSTEMS 19 ............. 2.2.2 RADIX-2
REDUNDANT NUMBER SYSTEMS 21 I ALGORITHMS BASED ON POLYNOMIAL
APPROXIMATION ANDLOR TABLE LOOKUP. MULTIPLE-PRECISION EVALUATION OF
FUNCTIONS 25 3 POLYNOMIAL OR RATIONAL APPROXIMATIONS 27 .............
3.1 LEAST SQUARES POLYNOMIAL APPROXIMATIONS 28 .....................
3.1.1 LEGENDRE POLYNOMIALS 29 .................... 3.1.2 CHEBYSHEV
POLYNOMIALS 29 ....................... 3.1.3 JACOBI POLYNOMIALS 31
CONTENTS ..................... 3.1.4 LAGUERRE POLYNOMIALS 31 3.1.5 USING
THESE ORTHOGONAL POLYNOMIALS IN ANY INTERVAL .... 31 ............ 3.2
LEAST MAXIMUM POLYNORNIAL APPROXIMATIONS 32
............................. 3.3 SOME EXAMPLES 33
......................... 3.4 SPEED OF CONVERGENCE 39
........................... 3.5 REMEZ S ALGORITHM 41
....................... 3.6 RATIONAL APPROXIMATIONS 46 ...............
3.7 ACTUAL COMPUTATION OF APPROXIMATIONS 50 .............. 3.7.1 GETTING
GENERAL APPROXIMATIONS 50 3.7.2 GETTING APPROXIMATIONS WITH SPECIAL
CONSTRAINTS ...... 51 3.8 ALGORITHMS AND ARCHITECTURES FOR THE
EVALUATION OF POLYNOMIALS . 54 .......................... 3.8.1 THE
E-METHOD 57 ......................... 3.8.2 ESTRIN S METHOD 58 3.9
EVALUATION ERROR ASSUMING HORNER S SCHEME IS USED ....... 59 3.9.1
EVALUATION USING FLOATING-POINT ADDITIONS AND .........................
MULTIPLICATIONS 60 3.9.2 EVALUATION USING FUSED MULTIPLY-ACCUMULATE
........................... INSTRUCTIONS 64
.............................. 3.10 MISCELLANEOUS 66 4 TABLE-BASED
METHODS 67 ............................... 4.1 INTRODUCTION 67
........................ 4.2 TABLE-DRIVEN ALGORITHMS 70 4.2.1 TANG S
ALGORITHM FOR EXP(X) IN IEEE FLOATING-POINT ARITHMETIC 71
.......................... 4.2.2 LN(X) ON [L, 21 72
........................ 4.2.3 SIN(X) ON [O, ~/4] 73
..................... 4.3 GAL S ACCURATE TABLES METHOD 73 4.4 TABLE
METHODS REQUIRING SPECIALIZED HARDWARE .......... 77 4.4.1 WONG AND
GOTO S ALGORITHM FOR COMPUTING ............................ LOGARITHMS
78 4.4.2 WONG AND GOTO S ALGORITHM FOR COMPUTING
........................... EXPONENTIALS 81 .................. 4.4.3
ERCEGOVAC ET AL. S ALGORITHM 82 ............. 4.4.4 BIPARTITE AND
MULTIPARTITE METHODS 83 .......................... 4.4.5 MISCELLANEOUS
87 5 MULTIPLE-PRECISION EVALUATION OF FUNCTIONS 89
............................... 5.1 INTRODUCTION 89 5.2 JUST A FEW WORDS
ON MULTIPLE-PRECISION MULTIPLICATION ...... 90 ......................
5.2.1 KARATSUBA S METHOD 91 ...................... 5.2.2 FET-BASED
METHODS 92 ............ 5.3 MULTIPLE-PRECISION DIVISION AND SQUARE-ROOT
92 .................. 5.3.1 NEWTON-RAPHSON ITERATION 92 CONTENTS VII 5.4
ALGORITHMS BASED ON THE EVALUATION OF POWER SERIES
............................... 94 5.5 THE ARITHMETIC-GEOMETRIC (AGM)
MEAN ............... 95 5.5.1 PRESENTATION OF THE AGM
.................... 95 5.5.2 COMPUTING LOGARITHMS WITH THE AGM
............ 95 5.5.3 COMPUTING EXPONENTIALS WITH THE AGM ........... 98
5.5.4 VERY FAST COMPUTATION OF TRIGONOMETRIC FUNCTIONS ..... 98 I1 SHIF
T-AND-ADD ALGORITHMS 101 6 INTRODUCTION TO SHIFT-AND-ADD ALGORITHMS 103
6.1 THE RESTORING AND NONRESTORING ALGORITHMS ............ 105 6.2
SIMPLE ALGORITHMS FOR EXPONENTIALS AND LOGARITHMS ....... 109 6.2.1 THE
RESTORING ALGORITHM FOR EXPONENTIALS .......... 109 6.2.2 THE RESTORING
ALGORITHM FOR LOGARITHMS ........... 111 6.3 FASTER SHIFT-AND-ADD
ALGORITHMS ................... 113 6.3.1 FASTER COMPUTATION OF
EXPONENTIALS ............. 113 6.3.2 FASTER COMPUTATION OF LOGARITHMS
.............. 119 6.4 BAKER S PREDICTIVE ALGORITHM
..................... 122 6.5 BIBLIOGRAPHIC NOTES
.......................... 131 7 THE CORDIC ALGORITHM 133 7.1
INTRODUCTION ............................... 133 7.2 THE CONVENTIONAL
CORDIC ITERATION ................. 134 7.3 SCALE FACTOR COMPENSATION
...................... 139 7.4 CORDIC WITH REDUNDANT NUMBER SYSTEMS AND
A VARIABLE FACTOR 141 7.4.1 SIGNED-DIGIT IMPLEMENTATION
................. 142 7.4.2 CARRY-SAVE IRNPLEMENTATION
.................. 143 7.4.3 THE VARIABLE SCALE FACTOR PROBLEM
............... 143 7.5 THE DOUBLE ROTATION METHOD .....................
144 7.6 THE BRANCHING CORDIC ALGORITHM .................. 146 7.7 THE
DIFFERENTIAL CORDIC ALGORITHM ................. 150 7.8 COMPUTATION OF
COS-I AND SINPL USING CORDIC .......... 153 7.9 VARIATIONS ON CORDIC
......................... 156 8 SOME OTHER SHIFT-AND-ADD ALGONTHMS 157
8.1 HIGH-RADIX ALGORITHMS ........................ 157 8.1.1 ERCEGOVAC S
RADIX-16 ALGORITHMS ............... 157 8.2 THE BKM ALGORITHM
.......................... 162 8.2.1 THE BKM ITERATION
....................... 162 8.2.2 COMPUTATION OF THE EXPONENTIAL
FUNCTION (E-MODE) .... 162 8.2.3 COMPUTATION OF THE LOGARITHM FUNCTION
(L-MODE) ..... 166 CONTENTS 8.2.4 APPLICATION TO THE COMPUTATION OF
ELEMENTARY ............................. FUNCTIONS 167 I11 RANGE
REDUCTION. FINAL ROUNDING AND EXCEPTIONS 171 9 RANGE REDUCTION 173
............................... 9.1 INTRODUCTION 173 9.2 CODY AND
WAITE S METHOD FOR RANGE REDUCTION .......... 177 ............. 9.3
FINDING WORST CASES FOR RANGE REDUCTION? 179 ......... 9.3.1 A FEW BASIC
NOTIONS ON CONTINUED FRACTIONS 179 ....... 9.3.2 FINDING WORST CASES
USING CONTINUED FRACTIONS 180 ............. 9.4 THE PAYNE AND HANEK
REDUCTION ALGORITHM 184 .............. 9.5 THE MODULAR RANGE REDUCTION
ALGORITHM 187 ..................... 9.5.1 FIXED-POINT REDUCTION 188
.................... 9.5.2 FLOATING-POINT REDUCTION 190 .............
9.5.3 ARCHITECTURES FOR MODULAR REDUCTION 190
........................... 9.6 ALTERNATE METHODS 191 10 FINAL ROUNDING
193 ............................... 10.1 INTRODUCTION 193
.............................. 10.2 MONOTONICITY 194 ........... 10.3
CORRECT ROUNDING: PRESENTATION OF THE PROBLEM 195
........................... 10.4 SOME EXPERIMENTS 198 ............. 10.5
A PROBABILISTIC APPROACH TO THE PROBLEM 198 ..........................
10.6 UPPER BOUNDS ON M 202 ............. 10.7 OBTAINED WORST CASES FOR
DOUBLE-PRECISION 203 ...................... 10.7.1 SPECIAL INPUT VALUES
203 ...................... 10.7.2 LEFEVRE S EXPERIMENT 203 11
MISCELLANEOUS 11.1 EXCEPTIONS ............................... 11.1.1
NANS .............................. 11.1.2 EXACT RESULTS
.......................... 11.2 NOTES ON XY
.............................. 11.3 SPECIAL FUNCTIONS, FUNCTIONS OF
COMPLEX NUMBERS ....... 12 EXAMPLES OF IMPLEMENTATION 225 12.1 EXAMPLE
1: THE CYRIX FASTMATH PROCESSOR ..... : ........ 225 12.2 THE INTEL
FUNCTIONS DESIGNED FOR THE ITANIUM PROCESSOR ..... 226
......................... 12.2.1 SINE AND COSINE 227
............................ 12.2.2 ARCTANGENT 228
......................... 12.3 THE LIBULTIM LIBRARY 229
.......................... 12.4 THE CRLIBM LIBRARY 229 ....... 12.4.1
COMPUTATIONOF SIN(X) OR COS(X) (QUICKPHASE) 230 CONTENTS IX
..................... 12.4.2 COMPUTATION OF LN(X) 230
........................ 12.5 SUN S LIBMCR LIBRARY 231 .......... 12.6
THE HP-UX COMPILER FOR THE ITANIUM PROCESSOR 231 BIBLIOGRAPHY 233 INDEX
261
|
| adam_txt |
CONTENTS LIST OF FIGURES XI LIST OF TABLES XV PREFACE TO THE SECOND
EDITION XIX PREFACE TO THE FIRST EDITION XXI 1 INTRODUCTION 1 SOME BASIC
THINGS ABOUT COMPUTER ARITHMETIC 9 . 2.1
FLOATING-POINT ARITHMETIC 9 . 2.1.1 FLOATING-POINT
FORMATS 9 . 2.1.2 ROUNDING MODES 11 .
2.1.3 SUBNORMAL NUMBERS AND EXCEPTIONS 13
. 2.1.4 ULPS 14 . 2.1.5
FUSED MULTIPLY-ADD OPERATIONS 15 . 2.1 -6 TESTING YOUR
COMPUTATIONAL ENVIRONMENT 16 . 2.1.7 FLOATING-POINT
ARITHMETIC AND PROOFS 17 2.1.8 MAPLE PROGRAMS THAT COMPUTE
DOUBLE-PRECISION . APPROXIMATIONS 17
. 2.2 REDUNDANT NUMBER SYSTEMS 19 .
2.2.1 SIGNED-DIGIT NUMBER SYSTEMS 19 . 2.2.2 RADIX-2
REDUNDANT NUMBER SYSTEMS 21 I ALGORITHMS BASED ON POLYNOMIAL
APPROXIMATION ANDLOR TABLE LOOKUP. MULTIPLE-PRECISION EVALUATION OF
FUNCTIONS 25 3 POLYNOMIAL OR RATIONAL APPROXIMATIONS 27 .
3.1 LEAST SQUARES POLYNOMIAL APPROXIMATIONS 28 .
3.1.1 LEGENDRE POLYNOMIALS 29 . 3.1.2 CHEBYSHEV
POLYNOMIALS 29 . 3.1.3 JACOBI POLYNOMIALS 31
CONTENTS . 3.1.4 LAGUERRE POLYNOMIALS 31 3.1.5 USING
THESE ORTHOGONAL POLYNOMIALS IN ANY INTERVAL . 31 . 3.2
LEAST MAXIMUM POLYNORNIAL APPROXIMATIONS 32
. 3.3 SOME EXAMPLES 33
. 3.4 SPEED OF CONVERGENCE 39
. 3.5 REMEZ'S ALGORITHM 41
. 3.6 RATIONAL APPROXIMATIONS 46 .
3.7 ACTUAL COMPUTATION OF APPROXIMATIONS 50 . 3.7.1 GETTING
"GENERAL" APPROXIMATIONS 50 3.7.2 GETTING APPROXIMATIONS WITH SPECIAL
CONSTRAINTS . 51 3.8 ALGORITHMS AND ARCHITECTURES FOR THE
EVALUATION OF POLYNOMIALS . 54 . 3.8.1 THE
E-METHOD 57 . 3.8.2 ESTRIN'S METHOD 58 3.9
EVALUATION ERROR ASSUMING HORNER'S SCHEME IS USED . 59 3.9.1
EVALUATION USING FLOATING-POINT ADDITIONS AND .
MULTIPLICATIONS 60 3.9.2 EVALUATION USING FUSED MULTIPLY-ACCUMULATE
. INSTRUCTIONS 64
. 3.10 MISCELLANEOUS 66 4 TABLE-BASED
METHODS 67 . 4.1 INTRODUCTION 67
. 4.2 TABLE-DRIVEN ALGORITHMS 70 4.2.1 TANG'S
ALGORITHM FOR EXP(X) IN IEEE FLOATING-POINT ARITHMETIC 71
. 4.2.2 LN(X) ON [L, 21 72
. 4.2.3 SIN(X) ON [O, ~/4] 73
. 4.3 GAL'S ACCURATE TABLES METHOD 73 4.4 TABLE
METHODS REQUIRING SPECIALIZED HARDWARE . 77 4.4.1 WONG AND
GOTO'S ALGORITHM FOR COMPUTING . LOGARITHMS
78 4.4.2 WONG AND GOTO'S ALGORITHM FOR COMPUTING
. EXPONENTIALS 81 . 4.4.3
ERCEGOVAC ET AL.'S ALGORITHM 82 . 4.4.4 BIPARTITE AND
MULTIPARTITE METHODS 83 . 4.4.5 MISCELLANEOUS
87 5 MULTIPLE-PRECISION EVALUATION OF FUNCTIONS 89
. 5.1 INTRODUCTION 89 5.2 JUST A FEW WORDS
ON MULTIPLE-PRECISION MULTIPLICATION . 90 .
5.2.1 KARATSUBA'S METHOD 91 . 5.2.2 FET-BASED
METHODS 92 . 5.3 MULTIPLE-PRECISION DIVISION AND SQUARE-ROOT
92 . 5.3.1 NEWTON-RAPHSON ITERATION 92 CONTENTS VII 5.4
ALGORITHMS BASED ON THE EVALUATION OF POWER SERIES
. 94 5.5 THE ARITHMETIC-GEOMETRIC (AGM)
MEAN . 95 5.5.1 PRESENTATION OF THE AGM
. 95 5.5.2 COMPUTING LOGARITHMS WITH THE AGM
. 95 5.5.3 COMPUTING EXPONENTIALS WITH THE AGM . 98
5.5.4 VERY FAST COMPUTATION OF TRIGONOMETRIC FUNCTIONS . 98 I1 SHIF
T-AND-ADD ALGORITHMS 101 6 INTRODUCTION TO SHIFT-AND-ADD ALGORITHMS 103
6.1 THE RESTORING AND NONRESTORING ALGORITHMS . 105 6.2
SIMPLE ALGORITHMS FOR EXPONENTIALS AND LOGARITHMS . 109 6.2.1 THE
RESTORING ALGORITHM FOR EXPONENTIALS . 109 6.2.2 THE RESTORING
ALGORITHM FOR LOGARITHMS . 111 6.3 FASTER SHIFT-AND-ADD
ALGORITHMS . 113 6.3.1 FASTER COMPUTATION OF
EXPONENTIALS . 113 6.3.2 FASTER COMPUTATION OF LOGARITHMS
. 119 6.4 BAKER'S PREDICTIVE ALGORITHM
. 122 6.5 BIBLIOGRAPHIC NOTES
. 131 7 THE CORDIC ALGORITHM 133 7.1
INTRODUCTION . 133 7.2 THE CONVENTIONAL
CORDIC ITERATION . 134 7.3 SCALE FACTOR COMPENSATION
. 139 7.4 CORDIC WITH REDUNDANT NUMBER SYSTEMS AND
A VARIABLE FACTOR 141 7.4.1 SIGNED-DIGIT IMPLEMENTATION
. 142 7.4.2 CARRY-SAVE IRNPLEMENTATION
. 143 7.4.3 THE VARIABLE SCALE FACTOR PROBLEM
. 143 7.5 THE DOUBLE ROTATION METHOD .
144 7.6 THE BRANCHING CORDIC ALGORITHM . 146 7.7 THE
DIFFERENTIAL CORDIC ALGORITHM . 150 7.8 COMPUTATION OF
COS-I AND SINPL USING CORDIC . 153 7.9 VARIATIONS ON CORDIC
. 156 8 SOME OTHER SHIFT-AND-ADD ALGONTHMS 157
8.1 HIGH-RADIX ALGORITHMS . 157 8.1.1 ERCEGOVAC'S
RADIX-16 ALGORITHMS . 157 8.2 THE BKM ALGORITHM
. 162 8.2.1 THE BKM ITERATION
. 162 8.2.2 COMPUTATION OF THE EXPONENTIAL
FUNCTION (E-MODE) . 162 8.2.3 COMPUTATION OF THE LOGARITHM FUNCTION
(L-MODE) . 166 CONTENTS 8.2.4 APPLICATION TO THE COMPUTATION OF
ELEMENTARY . FUNCTIONS 167 I11 RANGE
REDUCTION. FINAL ROUNDING AND EXCEPTIONS 171 9 RANGE REDUCTION 173
. 9.1 INTRODUCTION 173 9.2 CODY AND
WAITE'S METHOD FOR RANGE REDUCTION . 177 . 9.3
FINDING WORST CASES FOR RANGE REDUCTION? 179 . 9.3.1 A FEW BASIC
NOTIONS ON CONTINUED FRACTIONS 179 . 9.3.2 FINDING WORST CASES
USING CONTINUED FRACTIONS 180 . 9.4 THE PAYNE AND HANEK
REDUCTION ALGORITHM 184 . 9.5 THE MODULAR RANGE REDUCTION
ALGORITHM 187 . 9.5.1 FIXED-POINT REDUCTION 188
. 9.5.2 FLOATING-POINT REDUCTION 190 .
9.5.3 ARCHITECTURES FOR MODULAR REDUCTION 190
. 9.6 ALTERNATE METHODS 191 10 FINAL ROUNDING
193 . 10.1 INTRODUCTION 193
. 10.2 MONOTONICITY 194 . 10.3
CORRECT ROUNDING: PRESENTATION OF THE PROBLEM 195
. 10.4 SOME EXPERIMENTS 198 . 10.5
A "PROBABILISTIC" APPROACH TO THE PROBLEM 198 .
10.6 UPPER BOUNDS ON M 202 . 10.7 OBTAINED WORST CASES FOR
DOUBLE-PRECISION 203 . 10.7.1 SPECIAL INPUT VALUES
203 . 10.7.2 LEFEVRE'S EXPERIMENT 203 11
MISCELLANEOUS 11.1 EXCEPTIONS . 11.1.1
NANS . 11.1.2 EXACT RESULTS
. 11.2 NOTES ON XY
. 11.3 SPECIAL FUNCTIONS, FUNCTIONS OF
COMPLEX NUMBERS . 12 EXAMPLES OF IMPLEMENTATION 225 12.1 EXAMPLE
1: THE CYRIX FASTMATH PROCESSOR . : . 225 12.2 THE INTEL
FUNCTIONS DESIGNED FOR THE ITANIUM PROCESSOR . 226
. 12.2.1 SINE AND COSINE 227
. 12.2.2 ARCTANGENT 228
. 12.3 THE LIBULTIM LIBRARY 229
. 12.4 THE CRLIBM LIBRARY 229 . 12.4.1
COMPUTATIONOF SIN(X) OR COS(X) (QUICKPHASE) 230 CONTENTS IX
. 12.4.2 COMPUTATION OF LN(X) 230
. 12.5 SUN'S LIBMCR LIBRARY 231 . 12.6
THE HP-UX COMPILER FOR THE ITANIUM PROCESSOR 231 BIBLIOGRAPHY 233 INDEX
261 |
| any_adam_object | 1 |
| any_adam_object_boolean | 1 |
| author | Muller, Jean-Michel 1961- |
| author_GND | (DE-588)111675014 |
| author_facet | Muller, Jean-Michel 1961- |
| author_role | aut |
| author_sort | Muller, Jean-Michel 1961- |
| author_variant | j m m jmm |
| building | Verbundindex |
| bvnumber | BV021295549 |
| callnumber-first | Q - Science |
| callnumber-label | QA331 |
| callnumber-raw | QA331 |
| callnumber-search | QA331 |
| callnumber-sort | QA 3331 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | SK 905 SK 910 SK 950 ST 134 |
| classification_tum | MAT 650f MAT 330f |
| ctrlnum | (OCoLC)60500353 (DE-599)DNB972292802 |
| dewey-full | 518/.1 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 518 - Numerical analysis |
| dewey-raw | 518/.1 |
| dewey-search | 518/.1 |
| dewey-sort | 3518 11 |
| dewey-tens | 510 - Mathematics |
| discipline | Informatik Mathematik |
| discipline_str_mv | Informatik Mathematik |
| edition | 2. ed. |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02352nam a2200601 c 4500</leader><controlfield tag="001">BV021295549</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20110801 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">060117s2006 gw d||| |||| 00||| ger d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780817643720</subfield><subfield code="9">978-0-8176-4372-0</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0817643729</subfield><subfield code="9">0-8176-4372-9</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)60500353</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB972292802</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">ger</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">DE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-824</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-898</subfield><subfield code="a">DE-355</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA331</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">518/.1</subfield><subfield code="2">22</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 905</subfield><subfield code="0">(DE-625)143269:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 910</subfield><subfield code="0">(DE-625)143270:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 950</subfield><subfield code="0">(DE-625)143273:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 134</subfield><subfield code="0">(DE-625)143590:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 650f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 330f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Muller, Jean-Michel</subfield><subfield code="d">1961-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)111675014</subfield><subfield code="4">aut</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">2. ed.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Boston [u.a.]</subfield><subfield code="b">Birkhäuser</subfield><subfield code="c">2006</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XXII, 265 S.</subfield><subfield code="b">graph. Darst.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithmes</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algoritmos</subfield><subfield code="2">larpcal</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Fonctions (Mathématiques) - Informatique</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Matemática (processamento de dados)</subfield><subfield code="2">larpcal</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Datenverarbeitung</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Functions</subfield><subfield code="x">Data processing</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Numerisches Verfahren</subfield><subfield code="0">(DE-588)4128130-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Numerische Mathematik</subfield><subfield code="0">(DE-588)4042805-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Elementare Funktion</subfield><subfield code="0">(DE-588)4302697-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Elementare Funktion</subfield><subfield code="0">(DE-588)4302697-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Numerisches Verfahren</subfield><subfield code="0">(DE-588)4128130-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Numerische Mathematik</subfield><subfield code="0">(DE-588)4042805-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">OEBV Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=014616315&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-014616315</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield></record></collection> |
| id | DE-604.BV021295549 |
| illustrated | Illustrated |
| index_date | 2024-07-02T13:51:04Z |
| indexdate | 2024-07-09T20:34:58Z |
| institution | BVB |
| isbn | 9780817643720 0817643729 |
| language | German |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-014616315 |
| oclc_num | 60500353 |
| open_access_boolean | |
| owner | DE-824 DE-703 DE-706 DE-83 DE-11 DE-384 DE-898 DE-BY-UBR DE-355 DE-BY-UBR |
| owner_facet | DE-824 DE-703 DE-706 DE-83 DE-11 DE-384 DE-898 DE-BY-UBR DE-355 DE-BY-UBR |
| physical | XXII, 265 S. graph. Darst. |
| publishDate | 2006 |
| publishDateSearch | 2006 |
| publishDateSort | 2006 |
| publisher | Birkhäuser |
| record_format | marc |
| spelling | Muller, Jean-Michel 1961- Verfasser (DE-588)111675014 aut Elementary functions algorithms and implementation Jean-Michel Muller 2. ed. Boston [u.a.] Birkhäuser 2006 XXII, 265 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Algorithmes Algoritmos larpcal Fonctions (Mathématiques) - Informatique Matemática (processamento de dados) larpcal Datenverarbeitung Algorithms Functions Data processing Numerisches Verfahren (DE-588)4128130-5 gnd rswk-swf Numerische Mathematik (DE-588)4042805-9 gnd rswk-swf Elementare Funktion (DE-588)4302697-7 gnd rswk-swf Elementare Funktion (DE-588)4302697-7 s Numerisches Verfahren (DE-588)4128130-5 s 1\p DE-604 Numerische Mathematik (DE-588)4042805-9 s 2\p DE-604 OEBV Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=014616315&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 2\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Muller, Jean-Michel 1961- Elementary functions algorithms and implementation Algorithmes Algoritmos larpcal Fonctions (Mathématiques) - Informatique Matemática (processamento de dados) larpcal Datenverarbeitung Algorithms Functions Data processing Numerisches Verfahren (DE-588)4128130-5 gnd Numerische Mathematik (DE-588)4042805-9 gnd Elementare Funktion (DE-588)4302697-7 gnd |
| subject_GND | (DE-588)4128130-5 (DE-588)4042805-9 (DE-588)4302697-7 |
| title | Elementary functions algorithms and implementation |
| title_auth | Elementary functions algorithms and implementation |
| title_exact_search | Elementary functions algorithms and implementation |
| title_exact_search_txtP | Elementary functions algorithms and implementation |
| title_full | Elementary functions algorithms and implementation Jean-Michel Muller |
| title_fullStr | Elementary functions algorithms and implementation Jean-Michel Muller |
| title_full_unstemmed | Elementary functions algorithms and implementation Jean-Michel Muller |
| title_short | Elementary functions |
| title_sort | elementary functions algorithms and implementation |
| title_sub | algorithms and implementation |
| topic | Algorithmes Algoritmos larpcal Fonctions (Mathématiques) - Informatique Matemática (processamento de dados) larpcal Datenverarbeitung Algorithms Functions Data processing Numerisches Verfahren (DE-588)4128130-5 gnd Numerische Mathematik (DE-588)4042805-9 gnd Elementare Funktion (DE-588)4302697-7 gnd |
| topic_facet | Algorithmes Algoritmos Fonctions (Mathématiques) - Informatique Matemática (processamento de dados) Datenverarbeitung Algorithms Functions Data processing Numerisches Verfahren Numerische Mathematik Elementare Funktion |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=014616315&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT mullerjeanmichel elementaryfunctionsalgorithmsandimplementation |