Modern computer arithmetic:
Modern Computer Arithmetic focuses on arbitrary-precision algorithms for efficiently performing arithmetic operations such as addition, multiplication and division, and their connections to topics such as modular arithmetic, greatest common divisors, the Fast Fourier Transform (FFT), and the computa...
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Elektronisch E-Book |
Sprache: | English |
Veröffentlicht: |
Cambridge
Cambridge University Press
2011
|
Schriftenreihe: | Cambridge monographs on applied and computational mathematics
18 |
Schlagworte: | |
Online-Zugang: | BSB01 FHN01 Volltext |
Zusammenfassung: | Modern Computer Arithmetic focuses on arbitrary-precision algorithms for efficiently performing arithmetic operations such as addition, multiplication and division, and their connections to topics such as modular arithmetic, greatest common divisors, the Fast Fourier Transform (FFT), and the computation of elementary and special functions. Brent and Zimmermann present algorithms that are ready to implement in your favourite language, while keeping a high-level description and avoiding too low-level or machine-dependent details. The book is intended for anyone interested in the design and implementation of efficient high-precision algorithms for computer arithmetic, and more generally efficient multiple-precision numerical algorithms. It may also be used in a graduate course in mathematics or computer science, for which exercises are included. These vary considerably in difficulty, from easy to small research projects, and expand on topics discussed in the text. Solutions to selected exercises are available from the authors |
Beschreibung: | Title from publisher's bibliographic system (viewed on 05 Oct 2015) |
Beschreibung: | 1 online resource (xvi, 221 pages) |
ISBN: | 9780511921698 |
DOI: | 10.1017/CBO9780511921698 |
Internformat
MARC
LEADER | 00000nmm a2200000zcb4500 | ||
---|---|---|---|
001 | BV043940759 | ||
003 | DE-604 | ||
005 | 00000000000000.0 | ||
007 | cr|uuu---uuuuu | ||
008 | 161206s2011 |||| o||u| ||||||eng d | ||
020 | |a 9780511921698 |c Online |9 978-0-511-92169-8 | ||
024 | 7 | |a 10.1017/CBO9780511921698 |2 doi | |
035 | |a (ZDB-20-CBO)CR9780511921698 | ||
035 | |a (OCoLC)844957335 | ||
035 | |a (DE-599)BVBBV043940759 | ||
040 | |a DE-604 |b ger |e rda | ||
041 | 0 | |a eng | |
049 | |a DE-12 |a DE-92 | ||
082 | 0 | |a 004.0151 |2 22 | |
084 | |a ST 125 |0 (DE-625)143586: |2 rvk | ||
100 | 1 | |a Brent, R. P. |e Verfasser |4 aut | |
245 | 1 | 0 | |a Modern computer arithmetic |c Richard P. Brent, Paul Zimmermann |
264 | 1 | |a Cambridge |b Cambridge University Press |c 2011 | |
300 | |a 1 online resource (xvi, 221 pages) | ||
336 | |b txt |2 rdacontent | ||
337 | |b c |2 rdamedia | ||
338 | |b cr |2 rdacarrier | ||
490 | 0 | |a Cambridge monographs on applied and computational mathematics |v 18 | |
500 | |a Title from publisher's bibliographic system (viewed on 05 Oct 2015) | ||
520 | |a Modern Computer Arithmetic focuses on arbitrary-precision algorithms for efficiently performing arithmetic operations such as addition, multiplication and division, and their connections to topics such as modular arithmetic, greatest common divisors, the Fast Fourier Transform (FFT), and the computation of elementary and special functions. Brent and Zimmermann present algorithms that are ready to implement in your favourite language, while keeping a high-level description and avoiding too low-level or machine-dependent details. The book is intended for anyone interested in the design and implementation of efficient high-precision algorithms for computer arithmetic, and more generally efficient multiple-precision numerical algorithms. It may also be used in a graduate course in mathematics or computer science, for which exercises are included. These vary considerably in difficulty, from easy to small research projects, and expand on topics discussed in the text. Solutions to selected exercises are available from the authors | ||
650 | 4 | |a Computer arithmetic | |
650 | 0 | 7 | |a Genauigkeit |0 (DE-588)4234398-7 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Computerarithmetik |0 (DE-588)4135485-0 |2 gnd |9 rswk-swf |
689 | 0 | 0 | |a Computerarithmetik |0 (DE-588)4135485-0 |D s |
689 | 0 | 1 | |a Genauigkeit |0 (DE-588)4234398-7 |D s |
689 | 0 | |8 1\p |5 DE-604 | |
700 | 1 | |a Zimmermann, Paul |d 1964- |e Sonstige |4 oth | |
776 | 0 | 8 | |i Erscheint auch als |n Druckausgabe |z 978-0-521-19469-3 |
856 | 4 | 0 | |u https://doi.org/10.1017/CBO9780511921698 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
912 | |a ZDB-20-CBO | ||
999 | |a oai:aleph.bib-bvb.de:BVB01-029349729 | ||
883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
966 | e | |u https://doi.org/10.1017/CBO9780511921698 |l BSB01 |p ZDB-20-CBO |q BSB_PDA_CBO |x Verlag |3 Volltext | |
966 | e | |u https://doi.org/10.1017/CBO9780511921698 |l FHN01 |p ZDB-20-CBO |q FHN_PDA_CBO |x Verlag |3 Volltext |
Datensatz im Suchindex
_version_ | 1804176881669373952 |
---|---|
any_adam_object | |
author | Brent, R. P. |
author_facet | Brent, R. P. |
author_role | aut |
author_sort | Brent, R. P. |
author_variant | r p b rp rpb |
building | Verbundindex |
bvnumber | BV043940759 |
classification_rvk | ST 125 |
collection | ZDB-20-CBO |
ctrlnum | (ZDB-20-CBO)CR9780511921698 (OCoLC)844957335 (DE-599)BVBBV043940759 |
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 |
doi_str_mv | 10.1017/CBO9780511921698 |
format | Electronic eBook |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03010nmm a2200493zcb4500</leader><controlfield tag="001">BV043940759</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">161206s2011 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511921698</subfield><subfield code="c">Online</subfield><subfield code="9">978-0-511-92169-8</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1017/CBO9780511921698</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-20-CBO)CR9780511921698</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)844957335</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV043940759</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-12</subfield><subfield code="a">DE-92</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004.0151</subfield><subfield code="2">22</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 125</subfield><subfield code="0">(DE-625)143586:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Brent, R. P.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Modern computer arithmetic</subfield><subfield code="c">Richard P. Brent, Paul Zimmermann</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">2011</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (xvi, 221 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">Cambridge monographs on applied and computational mathematics</subfield><subfield code="v">18</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Title from publisher's bibliographic system (viewed on 05 Oct 2015)</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Modern Computer Arithmetic focuses on arbitrary-precision algorithms for efficiently performing arithmetic operations such as addition, multiplication and division, and their connections to topics such as modular arithmetic, greatest common divisors, the Fast Fourier Transform (FFT), and the computation of elementary and special functions. Brent and Zimmermann present algorithms that are ready to implement in your favourite language, while keeping a high-level description and avoiding too low-level or machine-dependent details. The book is intended for anyone interested in the design and implementation of efficient high-precision algorithms for computer arithmetic, and more generally efficient multiple-precision numerical algorithms. It may also be used in a graduate course in mathematics or computer science, for which exercises are included. These vary considerably in difficulty, from easy to small research projects, and expand on topics discussed in the text. Solutions to selected exercises are available from the authors</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer arithmetic</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Genauigkeit</subfield><subfield code="0">(DE-588)4234398-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</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="689" ind1="0" 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="0" ind2="1"><subfield code="a">Genauigkeit</subfield><subfield code="0">(DE-588)4234398-7</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="700" ind1="1" ind2=" "><subfield code="a">Zimmermann, Paul</subfield><subfield code="d">1964-</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druckausgabe</subfield><subfield code="z">978-0-521-19469-3</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1017/CBO9780511921698</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CBO</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-029349729</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="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/CBO9780511921698</subfield><subfield code="l">BSB01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">BSB_PDA_CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/CBO9780511921698</subfield><subfield code="l">FHN01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">FHN_PDA_CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
id | DE-604.BV043940759 |
illustrated | Not Illustrated |
indexdate | 2024-07-10T07:39:14Z |
institution | BVB |
isbn | 9780511921698 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-029349729 |
oclc_num | 844957335 |
open_access_boolean | |
owner | DE-12 DE-92 |
owner_facet | DE-12 DE-92 |
physical | 1 online resource (xvi, 221 pages) |
psigel | ZDB-20-CBO ZDB-20-CBO BSB_PDA_CBO ZDB-20-CBO FHN_PDA_CBO |
publishDate | 2011 |
publishDateSearch | 2011 |
publishDateSort | 2011 |
publisher | Cambridge University Press |
record_format | marc |
series2 | Cambridge monographs on applied and computational mathematics |
spelling | Brent, R. P. Verfasser aut Modern computer arithmetic Richard P. Brent, Paul Zimmermann Cambridge Cambridge University Press 2011 1 online resource (xvi, 221 pages) txt rdacontent c rdamedia cr rdacarrier Cambridge monographs on applied and computational mathematics 18 Title from publisher's bibliographic system (viewed on 05 Oct 2015) Modern Computer Arithmetic focuses on arbitrary-precision algorithms for efficiently performing arithmetic operations such as addition, multiplication and division, and their connections to topics such as modular arithmetic, greatest common divisors, the Fast Fourier Transform (FFT), and the computation of elementary and special functions. Brent and Zimmermann present algorithms that are ready to implement in your favourite language, while keeping a high-level description and avoiding too low-level or machine-dependent details. The book is intended for anyone interested in the design and implementation of efficient high-precision algorithms for computer arithmetic, and more generally efficient multiple-precision numerical algorithms. It may also be used in a graduate course in mathematics or computer science, for which exercises are included. These vary considerably in difficulty, from easy to small research projects, and expand on topics discussed in the text. Solutions to selected exercises are available from the authors Computer arithmetic Genauigkeit (DE-588)4234398-7 gnd rswk-swf Computerarithmetik (DE-588)4135485-0 gnd rswk-swf Computerarithmetik (DE-588)4135485-0 s Genauigkeit (DE-588)4234398-7 s 1\p DE-604 Zimmermann, Paul 1964- Sonstige oth Erscheint auch als Druckausgabe 978-0-521-19469-3 https://doi.org/10.1017/CBO9780511921698 Verlag URL des Erstveröffentlichers Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
spellingShingle | Brent, R. P. Modern computer arithmetic Computer arithmetic Genauigkeit (DE-588)4234398-7 gnd Computerarithmetik (DE-588)4135485-0 gnd |
subject_GND | (DE-588)4234398-7 (DE-588)4135485-0 |
title | Modern computer arithmetic |
title_auth | Modern computer arithmetic |
title_exact_search | Modern computer arithmetic |
title_full | Modern computer arithmetic Richard P. Brent, Paul Zimmermann |
title_fullStr | Modern computer arithmetic Richard P. Brent, Paul Zimmermann |
title_full_unstemmed | Modern computer arithmetic Richard P. Brent, Paul Zimmermann |
title_short | Modern computer arithmetic |
title_sort | modern computer arithmetic |
topic | Computer arithmetic Genauigkeit (DE-588)4234398-7 gnd Computerarithmetik (DE-588)4135485-0 gnd |
topic_facet | Computer arithmetic Genauigkeit Computerarithmetik |
url | https://doi.org/10.1017/CBO9780511921698 |
work_keys_str_mv | AT brentrp moderncomputerarithmetic AT zimmermannpaul moderncomputerarithmetic |