Effective Polynomial Computation (The Springer International Series in Engineering and Computer Scie pdf epub mobi txt 電子書下載 2024

☆☆☆☆☆
簡體網頁||繁體網頁

Richard Zippel

Springer

1993-07-31

374

USD 149.00

Hardcover

9780792393757

圖書標籤: computation algorithm

喜歡 Effective Polynomial Computation (The Springer International Series in Engineering and Computer Scie 的讀者還喜歡

下載链接在页面底部

點擊這裡下載

facebook linkedin mastodon messenger pinterest reddit telegram twitter viber vkontakte whatsapp 複製鏈接

想要找書就要到小哈圖書下載中心

qciss.net

立刻按 ctrl+D收藏本頁

你會得到大驚喜!!

发表于2024-11-14

Effective Polynomial Computation (The Springer International Series in Engineering and Computer Scie epub 下載 mobi 下載 pdf 下載 txt 電子書下載 2024

Effective Polynomial Computation (The Springer International Series in Engineering and Computer Scie pdf epub mobi txt 電子書下載 2024

圖書描述

Effective Polynomial Computation is an introduction to the algorithms of computer algebra. It discusses the basic algorithms for manipulating polynomials including factoring polynomials. These algorithms are discussed from both a theoretical and practical perspective. Those cases where theoretically optimal algorithms are inappropriate are discussed and the practical alternatives are explained. Effective Polynomial Computation provides much of the mathematical motivation of the algorithms discussed to help the reader appreciate the mathematical mechanisms underlying the algorithms, and so that the algorithms will not appear to be constructed out of whole cloth. Preparatory to the discussion of algorithms for polynomials, the first third of this book discusses related issues in elementary number theory. These results are either used in later algorithms (e.g. the discussion of lattices and Diophantine approximation), or analogs of the number theoretic algorithms are used for polynomial problems (e.g. Euclidean algorithm and p-adic numbers). Among the unique features of Effective Polynomial Computation is the detailed material on greatest common divisor and factoring algorithms for sparse multivariate polynomials. In addition, both deterministic and probabilistic algorithms for irreducibility testing of polynomials are discussed.

Effective Polynomial Computation (The Springer International Series in Engineering and Computer Scie 下載 mobi epub pdf txt 電子書