國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Modern computer algebra /

Gathen, Joachim von zur,

Modern computer algebra /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Modern computer algebra /Joachim von zur Gathen, Jürgen Gerhard.
作者:	Gathen, Joachim von zur,
其他作者:	Gerhard, Jürgen,
出版者:	Cambridge :Cambridge University Press,2013.
面頁冊數:	xiii, 795 p. :ill. (some col.) ;26 cm.
附註:	First published in 1999.
標題:	AlgebraData processing.
ISBN:	1107039037

Modern computer algebra /
Gathen, Joachim von zur,

Modern computer algebra /Joachim von zur Gathen, Jürgen Gerhard. - 3rd ed. - Cambridge :Cambridge University Press,2013. - xiii, 795 p. :ill. (some col.) ;26 cm.

First published in 1999.

Includes bibliographical references (p. 734-767) and index.

1. Cyclohexane, cryptography, codes, and computer algebra -- 2. Fundamental algorithms -- 3. The Euclidean algorithm -- 4. Applications of the Euclidean algorithm -- 5. Modular algorithms and interpolation -- 6. The resultant and gcd computation -- 7. Application: decoding BCH codes -- 8. Fast multiplication -- 9. Newton iteration -- 10. Fast polynomial evaluation and interpolation -- 11. Fast Euclidean algorithm -- 12. Fast linear algebra --13. Fourier transform and image compression -- 14. Factoring polynomials over finite fields -- 15. Hensel lifting and factoring polynomials -- 16. Short vectors in lattices -- 17. Applications of basis reduction -- 18. Primality testing -- 19. Factoring integers -- 20. Application: public key cryptography -- 21. Gröbner bases -- 22. Symbolic integration -- 23. Symbolic summation -- 24. Applications -- 25. Fundamental concepts.

Computer algebra systems are now ubiquitous in all areas of science and engineering. This highly successful textbook, widely regarded as the "bible of computer algebra", gives a thorough introduction to the algorithmic basis of the mathematical engine in computer algebra systems. Designed to accompany one- or two- semester courses for advanced undergraduate or graduate students in computer science or mathematics, its comprehensiveness and reliability has also made it an essential reference for professionals in the area. Special features include: detailed study of algorithms including time analysis; implementation reports on several topics; complete proofs of the mathematical underpinnings; and a wide variety of applications (among others, in chemistry, coding theory, crytopgraphy, computational logic, and the design of calendars and musical scales). A great deal of historical information and illustration enlivens the text.

ISBN: 1107039037

LCCN: 2013431595

Nat. Bib. Agency Control No.: 016416953UkSubjects--Topical Terms:

191027
Algebra
--Data processing.

LC Class. No.: QA155.7.E4 / Z87 2013

Dewey Class. No.: 512.0028

Modern computer algebra /
LDR:02628cam a2200265 a 450 001 480687
005 20160819141730.0
008 160930s2013 enka b 001 0 eng d
010 $a 2013431595
016 7 $a 016416953 $2 Uk
020 $a 1107039037
020 $a 9781107039032 : $c NT$3711
035 $a (OCoLC)ocn842411159
035 $a 17943748
040 $a CDX $b eng $c CDX $d YDXCP $d UAT $d UKMGB $d MUU $d OCLCQ $d MYG $d HEBIS $d DLC
042 $a lccopycat
050 0 0 $a QA155.7.E4 $b Z87 2013
082 0 4 $a 512.0028
100 1 $a Gathen, Joachim von zur, $e author. $3 736450
245 1 0 $a Modern computer algebra / $c Joachim von zur Gathen, Jürgen Gerhard.
250 $a 3rd ed.
260 $a Cambridge : $b Cambridge University Press, $c 2013.
300 $a xiii, 795 p. : $b ill. (some col.) ; $c 26 cm.
500 $a First published in 1999.
504 $a Includes bibliographical references (p. 734-767) and index.
505 0 $a 1. Cyclohexane, cryptography, codes, and computer algebra -- 2. Fundamental algorithms -- 3. The Euclidean algorithm -- 4. Applications of the Euclidean algorithm -- 5. Modular algorithms and interpolation -- 6. The resultant and gcd computation -- 7. Application: decoding BCH codes -- 8. Fast multiplication -- 9. Newton iteration -- 10. Fast polynomial evaluation and interpolation -- 11. Fast Euclidean algorithm -- 12. Fast linear algebra --13. Fourier transform and image compression -- 14. Factoring polynomials over finite fields -- 15. Hensel lifting and factoring polynomials -- 16. Short vectors in lattices -- 17. Applications of basis reduction -- 18. Primality testing -- 19. Factoring integers -- 20. Application: public key cryptography -- 21. Gröbner bases -- 22. Symbolic integration -- 23. Symbolic summation -- 24. Applications -- 25. Fundamental concepts.
520 3 $a Computer algebra systems are now ubiquitous in all areas of science and engineering. This highly successful textbook, widely regarded as the "bible of computer algebra", gives a thorough introduction to the algorithmic basis of the mathematical engine in computer algebra systems. Designed to accompany one- or two- semester courses for advanced undergraduate or graduate students in computer science or mathematics, its comprehensiveness and reliability has also made it an essential reference for professionals in the area. Special features include: detailed study of algorithms including time analysis; implementation reports on several topics; complete proofs of the mathematical underpinnings; and a wide variety of applications (among others, in chemistry, coding theory, crytopgraphy, computational logic, and the design of calendars and musical scales). A great deal of historical information and illustration enlivens the text.
650 0 $a Algebra $x Data processing. $3 191027
650 0 $a Computer algorithms. $3 184478
650 0 $a Computer science $x Mathematics. $3 181991
700 1 $a Gerhard, Jürgen, $d 1967-, $e author. $3 736451