| 書目名稱 | Effective Polynomial Computation |
| 編輯 | Richard Zippel |
| 視頻video | http://file.papertrans.cn/303/302799/302799.mp4 |
| 叢書名稱 | The Springer International Series in Engineering and Computer Science |
| 圖書封面 |  |
| 描述 | .Effective Polynomial Computation. is an introduction tothe algorithms of computer algebra. It discusses the basic algorithmsfor manipulating polynomials including factoring polynomials. Thesealgorithms are discussed from both a theoretical and practicalperspective. Those cases where theoretically optimal algorithms areinappropriate are discussed and the practical alternatives areexplained...Effective Polynomial Computation. provides much of themathematical motivation of the algorithms discussed to help the readerappreciate the mathematical mechanisms underlying the algorithms, andso that the algorithms will not appear to be constructed out of wholecloth..Preparatory to the discussion of algorithms for polynomials, the firstthird of this book discusses related issues in elementary numbertheory. These results are either used in later algorithms (e.g. thediscussion of lattices and Diophantine approximation), or analogs ofthe number theoretic algorithms are used for polynomial problems (e.g.Euclidean algorithm and .p.-adic numbers)..Among the unique features of .Effective Polynomial Computation. isthe detailed material on greatest common divisor and factoringalgorithms for sparse mult |
| 出版日期 | Book 1993 |
| 關(guān)鍵詞 | Approximation; Diophantine approximation; Interpolation; Mathematica; algebra; algorithms; computer; comput |
| 版次 | 1 |
| doi | https://doi.org/10.1007/978-1-4615-3188-3 |
| isbn_softcover | 978-1-4613-6398-9 |
| isbn_ebook | 978-1-4615-3188-3Series ISSN 0893-3405 |
| issn_series | 0893-3405 |
| copyright | Springer Science+Business Media New York 1993 |
|Archiver|手機版|小黑屋|
派博傳思國際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-12 19:31
發(fā)表于 2025-3-21 18:29:09
