Modern Computer Algebra, 2/e
暫譯: 現代計算代數,第二版
Joachim von zur Gathen, Jürgen Gerhard
- 出版商: Cambridge
- 出版日期: 2003-09-01
- 售價: $2,150
- 貴賓價: 9.8 折 $2,107
- 語言: 英文
- 頁數: 800
- 裝訂: Hardcover
- ISBN: 0521826462
- ISBN-13: 9780521826464
下單後立即進貨 (約5~7天)
買這商品的人也買了...
-
$650$553 -
$980$774 -
$650$429 -
$590$466 -
$820$804 -
$560$476 -
$580$458 -
$850$723 -
$480$379 -
$750$593 -
$780$702 -
$490$382 -
$620$484 -
$2,530$2,404 -
$680$578 -
$650$553 -
$650$507 -
$460$363 -
$520$406 -
$580$452 -
$620$527 -
$880$748 -
$820$697 -
$680$646 -
$650$507
相關主題
商品描述
Desription:
Computer algebra systems are gaining importance in all areas of science and engineering. This textbook gives a thorough introduction to the algorithmic basis of the mathematical engine in computer algebra systems. It is designed to accompany one- or two-semester courses for advanced undergraduate or graduate students in computer science or mathematics. Its comprehensiveness and authority also make 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; a wide variety of applications (among others, in chemistry, coding theory, cryptography, computational logic, and the design of calendars and musical scales). Some of this material has never appeared before in book form. For the new edition, errors have been corrected, the text has been smoothed and updated, and new sections on greatest common divisors and symbolic integration have been added.
Table of Contents:
Introduction; 1. Cyclohexane, cryptography, codes and computer algebra; Part I. Euclid: 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; Part II. Newton: 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; Part III. Gauss: 14. Factoring polynomials over finite fields; 15. Hensel lifting and factoring polynomials; 16. Short vectors in lattices; 17. Applications of basis reduction; Part IV. Fermat: 18. Primality testing; 19. Factoring integers; 20. Application: Public key cryptography; Part V. Hilbert: 21. Gröbner bases; 22. Symbolic integration; 23. Symbolic summation; 24. Applications; Appendix: 25. Fundamental concepts; Sources of illustrations; Sources of quotations; List of algorithms; List of figures and tables; References; List of notation; Index.
商品描述(中文翻譯)
描述:
計算機代數系統在科學和工程的各個領域中越來越重要。本教科書對計算機代數系統中的數學引擎的算法基礎進行了全面的介紹。它旨在配合高級本科生或研究生的計算機科學或數學的一至兩學期課程。其全面性和權威性也使其成為該領域專業人士的重要參考資料。特別的特點包括:詳細研究算法,包括時間分析;多個主題的實現報告;數學基礎的完整證明;各種應用(包括化學、編碼理論、密碼學、計算邏輯以及日曆和音階設計等)。其中一些材料在書籍形式中從未出現過。對於新版本,已經修正了錯誤,文本已經平滑和更新,並新增了有關最大公因數和符號積分的新章節。
目錄:
引言;1. 環己烷、密碼學、代碼和計算機代數;第一部分。歐幾里得:2. 基本算法;3. 歐幾里得算法;4. 歐幾里得算法的應用;5. 模算法和插值;6. 結果和最大公因數計算;7. 應用:解碼 BCH 代碼;第二部分。牛頓:8. 快速乘法;9. 牛頓迭代;10. 快速多項式評估和插值;11. 快速歐幾里得算法;12. 快速線性代數;13. 傅里葉變換和圖像壓縮;第三部分。高斯:14. 在有限域上因式分解多項式;15. 亨塞爾提升和多項式因式分解;16. 格中的短向量;17. 基底約簡的應用;第四部分。費馬:18. 質數性測試;19. 整數因式分解;20. 應用:公鑰密碼學;第五部分。希爾伯特:21. Gröbner 基;22. 符號積分;23. 符號求和;24. 應用;附錄:25. 基本概念;插圖來源;引用來源;算法列表;圖表列表;參考文獻;符號列表;索引。