Computer arithmetic and validity: theory, implementation, and applications
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Elektronisch E-Book |
Sprache: | English |
Veröffentlicht: |
Berlin ; Boston
De Gruyter
©2013
|
Ausgabe: | 2nd ed |
Schriftenreihe: | De Gruyter studies in mathematics
33 |
Schlagworte: | |
Online-Zugang: | FAW01 FAW02 Volltext |
Beschreibung: | 8.6 Scalar product computation units (SPUs) Print version record |
Beschreibung: | 1 online resource (456 pages) |
ISBN: | 3110301792 9783110301731 9783110301793 |
Internformat
MARC
LEADER | 00000nmm a2200000zcb4500 | ||
---|---|---|---|
001 | BV043034040 | ||
003 | DE-604 | ||
005 | 00000000000000.0 | ||
007 | cr|uuu---uuuuu | ||
008 | 151120s2013 |||| o||u| ||||||eng d | ||
020 | |a 3110301792 |c electronic bk. |9 3-11-030179-2 | ||
020 | |a 9783110301731 |9 978-3-11-030173-1 | ||
020 | |a 9783110301793 |c electronic bk. |9 978-3-11-030179-3 | ||
035 | |a (OCoLC)857276812 | ||
035 | |a (DE-599)BVBBV043034040 | ||
040 | |a DE-604 |b ger |e rda | ||
041 | 0 | |a eng | |
049 | |a DE-1046 |a DE-1047 | ||
082 | 0 | |a 004.0151 |2 23 | |
100 | 1 | |a Kulisch, Ulrich |e Verfasser |4 aut | |
245 | 1 | 0 | |a Computer arithmetic and validity |b theory, implementation, and applications |c Ulrich Kulisch |
250 | |a 2nd ed | ||
264 | 1 | |a Berlin ; Boston |b De Gruyter |c ©2013 | |
300 | |a 1 online resource (456 pages) | ||
336 | |b txt |2 rdacontent | ||
337 | |b c |2 rdamedia | ||
338 | |b cr |2 rdacarrier | ||
490 | 0 | |a De Gruyter studies in mathematics |v 33 | |
500 | |a 8.6 Scalar product computation units (SPUs) | ||
500 | |a Print version record | ||
505 | 8 | |a Foreword to the second edition; Preface; Introduction; I Theory of computer arithmetic; 1 First concepts; 1.1 Ordered sets; 1.2 Complete lattices and complete subnets; 1.3 Screens and roundings; 1.4 Arithmetic operations and roundings; 2 Ringoids and vectoids; 2.1 Ringoids; 2.2 Vectoids; 3 Definition of computer arithmetic; 3.1 Introduction; 3.2 Preliminaries; 3.3 The traditional definition of computer arithmetic; 3.4 Definition of computer arithmetic by semimorphisms; 3.5 A remark about roundings; 3.6 Uniqueness of the minus operator; 3.7 Rounding near zero; 4 Interval arithmetic | |
505 | 8 | |a 4.1 Interval sets and arithmetic4.2 Interval arithmetic over a linearly ordered set; 4.3 Interval matrices; 4.4 Interval vectors; 4.5 Interval arithmetic on a screen; 4.6 Interval matrices and interval vectors on a screen; 4.7 Complex interval arithmetic; 4.8 Complex interval matrices and interval vectors; 4.9 Extended interval arithmetic; 4.10 Exception-free arithmetic for extended intervals; 4.11 Extended interval arithmetic on the computer; 4.12 Exception-free arithmetic for closed real intervals on the computer; 4.13 Comparison relations and lattice operations | |
505 | 8 | |a 4.14 Algorithmic implementation of interval multiplication and divisionII Implementation of arithmetic on computers; 5 Floating-point arithmetic; 5.1 Definition and properties of the real numbers; 5.2 Floating-point numbers and roundings; 5.3 Floating-point operations; 5.4 Subnormal floating-point numbers; 5.5 On the IEEE floating-point arithmetic standard; 6 Implementation of floating-point arithmetic on a computer; 6.1 A brief review of the realization of integer arithmetic; 6.2 Introductory remarks about the level 1 operations; 6.3 Addition and subtraction; 6.4 Normalization | |
505 | 8 | |a 6.5 Multiplication6.6 Division; 6.7 Rounding; 6.8 A universal rounding unit; 6.9 Overflow and underflow treatment; 6.10 Algorithms using the short accumulator; 6.11 The level 2 operations; 7 Hardware support for interval arithmetic; 7.1 Introduction; 7.2 Arithmetic interval operations; 7.2.1 Algebraic operations; 7.2.2 Comments on the algebraic operations; 7.3 Circuitry for the arithmetic interval operations; 7.4 Comparisons and lattice operations; 7.4.1 Comments on comparisons and lattice operations; 7.4.2 Hardware support for comparisons and lattice operations | |
505 | 8 | |a 7.5 Alternative circuitry for interval operations and comparisons7.5.1 Hardware support for interval arithmetic on x86-processors; 7.5.2 Accurate evaluation of interval scalar products; 8 Scalar products and complete arithmetic; 8.1 Introduction and motivation; 8.2 Historical remarks; 8.3 The ubiquity of the scalar product in numerical analysis; 8.4 Implementation principles; 8.4.1 Long adder and long shift; 8.4.2 Short adder with local memory on the arithmetic unit; 8.4.3 Remarks; 8.4.4 Fast carry resolution; 8.5 Informal sketch for computing an exact dot product | |
505 | 8 | |a This is the revised and extended second edition of the successful basic book on computer arithmetic. It is consistent with the newest recent standard developments in the field. The book shows how the arithmetic capability of the computer can be enhanced. The work is motivated by the desire and the need to improve the accuracy of numerical computing and to control the quality of the computed results (validity). The accuracy requirements for the elementary floating-point operations are extended to the customary product spaces of computations including interval spaces. The mathematical properties | |
650 | 7 | |a COMPUTERS / Computer Literacy |2 bisacsh | |
650 | 7 | |a COMPUTERS / Computer Science |2 bisacsh | |
650 | 7 | |a COMPUTERS / Data Processing |2 bisacsh | |
650 | 7 | |a COMPUTERS / Hardware / General |2 bisacsh | |
650 | 7 | |a COMPUTERS / Information Technology |2 bisacsh | |
650 | 7 | |a COMPUTERS / Machine Theory |2 bisacsh | |
650 | 7 | |a COMPUTERS / Reference |2 bisacsh | |
650 | 7 | |a Computer arithmetic |2 fast | |
650 | 7 | |a Computer arithmetic and logic units |2 fast | |
650 | 7 | |a Floating-point arithmetic |2 fast | |
650 | 4 | |a Informatik | |
650 | 4 | |a Computer arithmetic | |
650 | 4 | |a Computer arithmetic and logic units | |
650 | 4 | |a Floating-point arithmetic | |
650 | 0 | 7 | |a Computerarithmetik |0 (DE-588)4135485-0 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Intervallalgebra |0 (DE-588)4139152-4 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Richtigkeit von Ergebnissen |0 (DE-588)4127444-1 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Gleitkommarechnung |0 (DE-588)4157582-9 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Numerische Mathematik |0 (DE-588)4042805-9 |2 gnd |9 rswk-swf |
689 | 0 | 0 | |a Numerische Mathematik |0 (DE-588)4042805-9 |D s |
689 | 0 | 1 | |a Richtigkeit von Ergebnissen |0 (DE-588)4127444-1 |D s |
689 | 0 | |8 1\p |5 DE-604 | |
689 | 1 | 0 | |a Gleitkommarechnung |0 (DE-588)4157582-9 |D s |
689 | 1 | |8 2\p |5 DE-604 | |
689 | 2 | 0 | |a Intervallalgebra |0 (DE-588)4139152-4 |D s |
689 | 2 | |8 3\p |5 DE-604 | |
689 | 3 | 0 | |a Computerarithmetik |0 (DE-588)4135485-0 |D s |
689 | 3 | |8 4\p |5 DE-604 | |
776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |a Kulisch, Ulrich |t Computer Arithmetic and Validity : Theory, Implementation, and Applications |
856 | 4 | 0 | |u http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=604262 |x Aggregator |3 Volltext |
912 | |a ZDB-4-EBA | ||
999 | |a oai:aleph.bib-bvb.de:BVB01-028458688 | ||
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 | |
883 | 1 | |8 3\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
883 | 1 | |8 4\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
966 | e | |u http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=604262 |l FAW01 |p ZDB-4-EBA |q FAW_PDA_EBA |x Aggregator |3 Volltext | |
966 | e | |u http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=604262 |l FAW02 |p ZDB-4-EBA |q FAW_PDA_EBA |x Aggregator |3 Volltext |
Datensatz im Suchindex
_version_ | 1804175392568770560 |
---|---|
any_adam_object | |
author | Kulisch, Ulrich |
author_facet | Kulisch, Ulrich |
author_role | aut |
author_sort | Kulisch, Ulrich |
author_variant | u k uk |
building | Verbundindex |
bvnumber | BV043034040 |
collection | ZDB-4-EBA |
contents | Foreword to the second edition; Preface; Introduction; I Theory of computer arithmetic; 1 First concepts; 1.1 Ordered sets; 1.2 Complete lattices and complete subnets; 1.3 Screens and roundings; 1.4 Arithmetic operations and roundings; 2 Ringoids and vectoids; 2.1 Ringoids; 2.2 Vectoids; 3 Definition of computer arithmetic; 3.1 Introduction; 3.2 Preliminaries; 3.3 The traditional definition of computer arithmetic; 3.4 Definition of computer arithmetic by semimorphisms; 3.5 A remark about roundings; 3.6 Uniqueness of the minus operator; 3.7 Rounding near zero; 4 Interval arithmetic 4.1 Interval sets and arithmetic4.2 Interval arithmetic over a linearly ordered set; 4.3 Interval matrices; 4.4 Interval vectors; 4.5 Interval arithmetic on a screen; 4.6 Interval matrices and interval vectors on a screen; 4.7 Complex interval arithmetic; 4.8 Complex interval matrices and interval vectors; 4.9 Extended interval arithmetic; 4.10 Exception-free arithmetic for extended intervals; 4.11 Extended interval arithmetic on the computer; 4.12 Exception-free arithmetic for closed real intervals on the computer; 4.13 Comparison relations and lattice operations 4.14 Algorithmic implementation of interval multiplication and divisionII Implementation of arithmetic on computers; 5 Floating-point arithmetic; 5.1 Definition and properties of the real numbers; 5.2 Floating-point numbers and roundings; 5.3 Floating-point operations; 5.4 Subnormal floating-point numbers; 5.5 On the IEEE floating-point arithmetic standard; 6 Implementation of floating-point arithmetic on a computer; 6.1 A brief review of the realization of integer arithmetic; 6.2 Introductory remarks about the level 1 operations; 6.3 Addition and subtraction; 6.4 Normalization 6.5 Multiplication6.6 Division; 6.7 Rounding; 6.8 A universal rounding unit; 6.9 Overflow and underflow treatment; 6.10 Algorithms using the short accumulator; 6.11 The level 2 operations; 7 Hardware support for interval arithmetic; 7.1 Introduction; 7.2 Arithmetic interval operations; 7.2.1 Algebraic operations; 7.2.2 Comments on the algebraic operations; 7.3 Circuitry for the arithmetic interval operations; 7.4 Comparisons and lattice operations; 7.4.1 Comments on comparisons and lattice operations; 7.4.2 Hardware support for comparisons and lattice operations 7.5 Alternative circuitry for interval operations and comparisons7.5.1 Hardware support for interval arithmetic on x86-processors; 7.5.2 Accurate evaluation of interval scalar products; 8 Scalar products and complete arithmetic; 8.1 Introduction and motivation; 8.2 Historical remarks; 8.3 The ubiquity of the scalar product in numerical analysis; 8.4 Implementation principles; 8.4.1 Long adder and long shift; 8.4.2 Short adder with local memory on the arithmetic unit; 8.4.3 Remarks; 8.4.4 Fast carry resolution; 8.5 Informal sketch for computing an exact dot product This is the revised and extended second edition of the successful basic book on computer arithmetic. It is consistent with the newest recent standard developments in the field. The book shows how the arithmetic capability of the computer can be enhanced. The work is motivated by the desire and the need to improve the accuracy of numerical computing and to control the quality of the computed results (validity). The accuracy requirements for the elementary floating-point operations are extended to the customary product spaces of computations including interval spaces. The mathematical properties |
ctrlnum | (OCoLC)857276812 (DE-599)BVBBV043034040 |
dewey-full | 004.0151 |
dewey-hundreds | 000 - Computer science, information, general works |
dewey-ones | 004 - Computer science |
dewey-raw | 004.0151 |
dewey-search | 004.0151 |
dewey-sort | 14.0151 |
dewey-tens | 000 - Computer science, information, general works |
discipline | Informatik |
edition | 2nd ed |
format | Electronic eBook |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>07093nmm a2200853zcb4500</leader><controlfield tag="001">BV043034040</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">151120s2013 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3110301792</subfield><subfield code="c">electronic bk.</subfield><subfield code="9">3-11-030179-2</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783110301731</subfield><subfield code="9">978-3-11-030173-1</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783110301793</subfield><subfield code="c">electronic bk.</subfield><subfield code="9">978-3-11-030179-3</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)857276812</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV043034040</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-1046</subfield><subfield code="a">DE-1047</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004.0151</subfield><subfield code="2">23</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Kulisch, Ulrich</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Computer arithmetic and validity</subfield><subfield code="b">theory, implementation, and applications</subfield><subfield code="c">Ulrich Kulisch</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">2nd ed</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin ; Boston</subfield><subfield code="b">De Gruyter</subfield><subfield code="c">©2013</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (456 pages)</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">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">De Gruyter studies in mathematics</subfield><subfield code="v">33</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">8.6 Scalar product computation units (SPUs)</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Print version record</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">Foreword to the second edition; Preface; Introduction; I Theory of computer arithmetic; 1 First concepts; 1.1 Ordered sets; 1.2 Complete lattices and complete subnets; 1.3 Screens and roundings; 1.4 Arithmetic operations and roundings; 2 Ringoids and vectoids; 2.1 Ringoids; 2.2 Vectoids; 3 Definition of computer arithmetic; 3.1 Introduction; 3.2 Preliminaries; 3.3 The traditional definition of computer arithmetic; 3.4 Definition of computer arithmetic by semimorphisms; 3.5 A remark about roundings; 3.6 Uniqueness of the minus operator; 3.7 Rounding near zero; 4 Interval arithmetic</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">4.1 Interval sets and arithmetic4.2 Interval arithmetic over a linearly ordered set; 4.3 Interval matrices; 4.4 Interval vectors; 4.5 Interval arithmetic on a screen; 4.6 Interval matrices and interval vectors on a screen; 4.7 Complex interval arithmetic; 4.8 Complex interval matrices and interval vectors; 4.9 Extended interval arithmetic; 4.10 Exception-free arithmetic for extended intervals; 4.11 Extended interval arithmetic on the computer; 4.12 Exception-free arithmetic for closed real intervals on the computer; 4.13 Comparison relations and lattice operations</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">4.14 Algorithmic implementation of interval multiplication and divisionII Implementation of arithmetic on computers; 5 Floating-point arithmetic; 5.1 Definition and properties of the real numbers; 5.2 Floating-point numbers and roundings; 5.3 Floating-point operations; 5.4 Subnormal floating-point numbers; 5.5 On the IEEE floating-point arithmetic standard; 6 Implementation of floating-point arithmetic on a computer; 6.1 A brief review of the realization of integer arithmetic; 6.2 Introductory remarks about the level 1 operations; 6.3 Addition and subtraction; 6.4 Normalization</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">6.5 Multiplication6.6 Division; 6.7 Rounding; 6.8 A universal rounding unit; 6.9 Overflow and underflow treatment; 6.10 Algorithms using the short accumulator; 6.11 The level 2 operations; 7 Hardware support for interval arithmetic; 7.1 Introduction; 7.2 Arithmetic interval operations; 7.2.1 Algebraic operations; 7.2.2 Comments on the algebraic operations; 7.3 Circuitry for the arithmetic interval operations; 7.4 Comparisons and lattice operations; 7.4.1 Comments on comparisons and lattice operations; 7.4.2 Hardware support for comparisons and lattice operations</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">7.5 Alternative circuitry for interval operations and comparisons7.5.1 Hardware support for interval arithmetic on x86-processors; 7.5.2 Accurate evaluation of interval scalar products; 8 Scalar products and complete arithmetic; 8.1 Introduction and motivation; 8.2 Historical remarks; 8.3 The ubiquity of the scalar product in numerical analysis; 8.4 Implementation principles; 8.4.1 Long adder and long shift; 8.4.2 Short adder with local memory on the arithmetic unit; 8.4.3 Remarks; 8.4.4 Fast carry resolution; 8.5 Informal sketch for computing an exact dot product</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">This is the revised and extended second edition of the successful basic book on computer arithmetic. It is consistent with the newest recent standard developments in the field. The book shows how the arithmetic capability of the computer can be enhanced. The work is motivated by the desire and the need to improve the accuracy of numerical computing and to control the quality of the computed results (validity). The accuracy requirements for the elementary floating-point operations are extended to the customary product spaces of computations including interval spaces. The mathematical properties</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS / Computer Literacy</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS / Computer Science</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS / Data Processing</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS / Hardware / General</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS / Information Technology</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS / Machine Theory</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS / Reference</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer arithmetic</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer arithmetic and logic units</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Floating-point arithmetic</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Informatik</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer arithmetic</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer arithmetic and logic units</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Floating-point arithmetic</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Computerarithmetik</subfield><subfield code="0">(DE-588)4135485-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Intervallalgebra</subfield><subfield code="0">(DE-588)4139152-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Richtigkeit von Ergebnissen</subfield><subfield code="0">(DE-588)4127444-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Gleitkommarechnung</subfield><subfield code="0">(DE-588)4157582-9</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="689" ind1="0" 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="0" ind2="1"><subfield code="a">Richtigkeit von Ergebnissen</subfield><subfield code="0">(DE-588)4127444-1</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">Gleitkommarechnung</subfield><subfield code="0">(DE-588)4157582-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="689" ind1="2" ind2="0"><subfield code="a">Intervallalgebra</subfield><subfield code="0">(DE-588)4139152-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="8">3\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="3" ind2="0"><subfield code="a">Computerarithmetik</subfield><subfield code="0">(DE-588)4135485-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2=" "><subfield code="8">4\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="a">Kulisch, Ulrich</subfield><subfield code="t">Computer Arithmetic and Validity : Theory, Implementation, and Applications</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=604262</subfield><subfield code="x">Aggregator</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-4-EBA</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-028458688</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><datafield tag="883" ind1="1" ind2=" "><subfield code="8">3\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">4\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="966" ind1="e" ind2=" "><subfield code="u">http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=604262</subfield><subfield code="l">FAW01</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FAW_PDA_EBA</subfield><subfield code="x">Aggregator</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=604262</subfield><subfield code="l">FAW02</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FAW_PDA_EBA</subfield><subfield code="x">Aggregator</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
id | DE-604.BV043034040 |
illustrated | Not Illustrated |
indexdate | 2024-07-10T07:15:34Z |
institution | BVB |
isbn | 3110301792 9783110301731 9783110301793 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-028458688 |
oclc_num | 857276812 |
open_access_boolean | |
owner | DE-1046 DE-1047 |
owner_facet | DE-1046 DE-1047 |
physical | 1 online resource (456 pages) |
psigel | ZDB-4-EBA ZDB-4-EBA FAW_PDA_EBA |
publishDate | 2013 |
publishDateSearch | 2013 |
publishDateSort | 2013 |
publisher | De Gruyter |
record_format | marc |
series2 | De Gruyter studies in mathematics |
spelling | Kulisch, Ulrich Verfasser aut Computer arithmetic and validity theory, implementation, and applications Ulrich Kulisch 2nd ed Berlin ; Boston De Gruyter ©2013 1 online resource (456 pages) txt rdacontent c rdamedia cr rdacarrier De Gruyter studies in mathematics 33 8.6 Scalar product computation units (SPUs) Print version record Foreword to the second edition; Preface; Introduction; I Theory of computer arithmetic; 1 First concepts; 1.1 Ordered sets; 1.2 Complete lattices and complete subnets; 1.3 Screens and roundings; 1.4 Arithmetic operations and roundings; 2 Ringoids and vectoids; 2.1 Ringoids; 2.2 Vectoids; 3 Definition of computer arithmetic; 3.1 Introduction; 3.2 Preliminaries; 3.3 The traditional definition of computer arithmetic; 3.4 Definition of computer arithmetic by semimorphisms; 3.5 A remark about roundings; 3.6 Uniqueness of the minus operator; 3.7 Rounding near zero; 4 Interval arithmetic 4.1 Interval sets and arithmetic4.2 Interval arithmetic over a linearly ordered set; 4.3 Interval matrices; 4.4 Interval vectors; 4.5 Interval arithmetic on a screen; 4.6 Interval matrices and interval vectors on a screen; 4.7 Complex interval arithmetic; 4.8 Complex interval matrices and interval vectors; 4.9 Extended interval arithmetic; 4.10 Exception-free arithmetic for extended intervals; 4.11 Extended interval arithmetic on the computer; 4.12 Exception-free arithmetic for closed real intervals on the computer; 4.13 Comparison relations and lattice operations 4.14 Algorithmic implementation of interval multiplication and divisionII Implementation of arithmetic on computers; 5 Floating-point arithmetic; 5.1 Definition and properties of the real numbers; 5.2 Floating-point numbers and roundings; 5.3 Floating-point operations; 5.4 Subnormal floating-point numbers; 5.5 On the IEEE floating-point arithmetic standard; 6 Implementation of floating-point arithmetic on a computer; 6.1 A brief review of the realization of integer arithmetic; 6.2 Introductory remarks about the level 1 operations; 6.3 Addition and subtraction; 6.4 Normalization 6.5 Multiplication6.6 Division; 6.7 Rounding; 6.8 A universal rounding unit; 6.9 Overflow and underflow treatment; 6.10 Algorithms using the short accumulator; 6.11 The level 2 operations; 7 Hardware support for interval arithmetic; 7.1 Introduction; 7.2 Arithmetic interval operations; 7.2.1 Algebraic operations; 7.2.2 Comments on the algebraic operations; 7.3 Circuitry for the arithmetic interval operations; 7.4 Comparisons and lattice operations; 7.4.1 Comments on comparisons and lattice operations; 7.4.2 Hardware support for comparisons and lattice operations 7.5 Alternative circuitry for interval operations and comparisons7.5.1 Hardware support for interval arithmetic on x86-processors; 7.5.2 Accurate evaluation of interval scalar products; 8 Scalar products and complete arithmetic; 8.1 Introduction and motivation; 8.2 Historical remarks; 8.3 The ubiquity of the scalar product in numerical analysis; 8.4 Implementation principles; 8.4.1 Long adder and long shift; 8.4.2 Short adder with local memory on the arithmetic unit; 8.4.3 Remarks; 8.4.4 Fast carry resolution; 8.5 Informal sketch for computing an exact dot product This is the revised and extended second edition of the successful basic book on computer arithmetic. It is consistent with the newest recent standard developments in the field. The book shows how the arithmetic capability of the computer can be enhanced. The work is motivated by the desire and the need to improve the accuracy of numerical computing and to control the quality of the computed results (validity). The accuracy requirements for the elementary floating-point operations are extended to the customary product spaces of computations including interval spaces. The mathematical properties COMPUTERS / Computer Literacy bisacsh COMPUTERS / Computer Science bisacsh COMPUTERS / Data Processing bisacsh COMPUTERS / Hardware / General bisacsh COMPUTERS / Information Technology bisacsh COMPUTERS / Machine Theory bisacsh COMPUTERS / Reference bisacsh Computer arithmetic fast Computer arithmetic and logic units fast Floating-point arithmetic fast Informatik Computer arithmetic Computer arithmetic and logic units Floating-point arithmetic Computerarithmetik (DE-588)4135485-0 gnd rswk-swf Intervallalgebra (DE-588)4139152-4 gnd rswk-swf Richtigkeit von Ergebnissen (DE-588)4127444-1 gnd rswk-swf Gleitkommarechnung (DE-588)4157582-9 gnd rswk-swf Numerische Mathematik (DE-588)4042805-9 gnd rswk-swf Numerische Mathematik (DE-588)4042805-9 s Richtigkeit von Ergebnissen (DE-588)4127444-1 s 1\p DE-604 Gleitkommarechnung (DE-588)4157582-9 s 2\p DE-604 Intervallalgebra (DE-588)4139152-4 s 3\p DE-604 Computerarithmetik (DE-588)4135485-0 s 4\p DE-604 Erscheint auch als Druck-Ausgabe Kulisch, Ulrich Computer Arithmetic and Validity : Theory, Implementation, and Applications http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=604262 Aggregator Volltext 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 3\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 4\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
spellingShingle | Kulisch, Ulrich Computer arithmetic and validity theory, implementation, and applications Foreword to the second edition; Preface; Introduction; I Theory of computer arithmetic; 1 First concepts; 1.1 Ordered sets; 1.2 Complete lattices and complete subnets; 1.3 Screens and roundings; 1.4 Arithmetic operations and roundings; 2 Ringoids and vectoids; 2.1 Ringoids; 2.2 Vectoids; 3 Definition of computer arithmetic; 3.1 Introduction; 3.2 Preliminaries; 3.3 The traditional definition of computer arithmetic; 3.4 Definition of computer arithmetic by semimorphisms; 3.5 A remark about roundings; 3.6 Uniqueness of the minus operator; 3.7 Rounding near zero; 4 Interval arithmetic 4.1 Interval sets and arithmetic4.2 Interval arithmetic over a linearly ordered set; 4.3 Interval matrices; 4.4 Interval vectors; 4.5 Interval arithmetic on a screen; 4.6 Interval matrices and interval vectors on a screen; 4.7 Complex interval arithmetic; 4.8 Complex interval matrices and interval vectors; 4.9 Extended interval arithmetic; 4.10 Exception-free arithmetic for extended intervals; 4.11 Extended interval arithmetic on the computer; 4.12 Exception-free arithmetic for closed real intervals on the computer; 4.13 Comparison relations and lattice operations 4.14 Algorithmic implementation of interval multiplication and divisionII Implementation of arithmetic on computers; 5 Floating-point arithmetic; 5.1 Definition and properties of the real numbers; 5.2 Floating-point numbers and roundings; 5.3 Floating-point operations; 5.4 Subnormal floating-point numbers; 5.5 On the IEEE floating-point arithmetic standard; 6 Implementation of floating-point arithmetic on a computer; 6.1 A brief review of the realization of integer arithmetic; 6.2 Introductory remarks about the level 1 operations; 6.3 Addition and subtraction; 6.4 Normalization 6.5 Multiplication6.6 Division; 6.7 Rounding; 6.8 A universal rounding unit; 6.9 Overflow and underflow treatment; 6.10 Algorithms using the short accumulator; 6.11 The level 2 operations; 7 Hardware support for interval arithmetic; 7.1 Introduction; 7.2 Arithmetic interval operations; 7.2.1 Algebraic operations; 7.2.2 Comments on the algebraic operations; 7.3 Circuitry for the arithmetic interval operations; 7.4 Comparisons and lattice operations; 7.4.1 Comments on comparisons and lattice operations; 7.4.2 Hardware support for comparisons and lattice operations 7.5 Alternative circuitry for interval operations and comparisons7.5.1 Hardware support for interval arithmetic on x86-processors; 7.5.2 Accurate evaluation of interval scalar products; 8 Scalar products and complete arithmetic; 8.1 Introduction and motivation; 8.2 Historical remarks; 8.3 The ubiquity of the scalar product in numerical analysis; 8.4 Implementation principles; 8.4.1 Long adder and long shift; 8.4.2 Short adder with local memory on the arithmetic unit; 8.4.3 Remarks; 8.4.4 Fast carry resolution; 8.5 Informal sketch for computing an exact dot product This is the revised and extended second edition of the successful basic book on computer arithmetic. It is consistent with the newest recent standard developments in the field. The book shows how the arithmetic capability of the computer can be enhanced. The work is motivated by the desire and the need to improve the accuracy of numerical computing and to control the quality of the computed results (validity). The accuracy requirements for the elementary floating-point operations are extended to the customary product spaces of computations including interval spaces. The mathematical properties COMPUTERS / Computer Literacy bisacsh COMPUTERS / Computer Science bisacsh COMPUTERS / Data Processing bisacsh COMPUTERS / Hardware / General bisacsh COMPUTERS / Information Technology bisacsh COMPUTERS / Machine Theory bisacsh COMPUTERS / Reference bisacsh Computer arithmetic fast Computer arithmetic and logic units fast Floating-point arithmetic fast Informatik Computer arithmetic Computer arithmetic and logic units Floating-point arithmetic Computerarithmetik (DE-588)4135485-0 gnd Intervallalgebra (DE-588)4139152-4 gnd Richtigkeit von Ergebnissen (DE-588)4127444-1 gnd Gleitkommarechnung (DE-588)4157582-9 gnd Numerische Mathematik (DE-588)4042805-9 gnd |
subject_GND | (DE-588)4135485-0 (DE-588)4139152-4 (DE-588)4127444-1 (DE-588)4157582-9 (DE-588)4042805-9 |
title | Computer arithmetic and validity theory, implementation, and applications |
title_auth | Computer arithmetic and validity theory, implementation, and applications |
title_exact_search | Computer arithmetic and validity theory, implementation, and applications |
title_full | Computer arithmetic and validity theory, implementation, and applications Ulrich Kulisch |
title_fullStr | Computer arithmetic and validity theory, implementation, and applications Ulrich Kulisch |
title_full_unstemmed | Computer arithmetic and validity theory, implementation, and applications Ulrich Kulisch |
title_short | Computer arithmetic and validity |
title_sort | computer arithmetic and validity theory implementation and applications |
title_sub | theory, implementation, and applications |
topic | COMPUTERS / Computer Literacy bisacsh COMPUTERS / Computer Science bisacsh COMPUTERS / Data Processing bisacsh COMPUTERS / Hardware / General bisacsh COMPUTERS / Information Technology bisacsh COMPUTERS / Machine Theory bisacsh COMPUTERS / Reference bisacsh Computer arithmetic fast Computer arithmetic and logic units fast Floating-point arithmetic fast Informatik Computer arithmetic Computer arithmetic and logic units Floating-point arithmetic Computerarithmetik (DE-588)4135485-0 gnd Intervallalgebra (DE-588)4139152-4 gnd Richtigkeit von Ergebnissen (DE-588)4127444-1 gnd Gleitkommarechnung (DE-588)4157582-9 gnd Numerische Mathematik (DE-588)4042805-9 gnd |
topic_facet | COMPUTERS / Computer Literacy COMPUTERS / Computer Science COMPUTERS / Data Processing COMPUTERS / Hardware / General COMPUTERS / Information Technology COMPUTERS / Machine Theory COMPUTERS / Reference Computer arithmetic Computer arithmetic and logic units Floating-point arithmetic Informatik Computerarithmetik Intervallalgebra Richtigkeit von Ergebnissen Gleitkommarechnung Numerische Mathematik |
url | http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=604262 |
work_keys_str_mv | AT kulischulrich computerarithmeticandvaliditytheoryimplementationandapplications |