Effective Polynomial Computation
Richard Zippel
Π΄Π΅Ρ 2012. Β· The Springer International Series in Engineering and Computer Science 241. ΠΊΡΠΈΠ³Π° Β· Springer Science & Business Media
Π-ΠΊΡΠΈΠ³Π°
363
Π‘ΡΡΠ°Π½ΠΈΡΠ°
reportΠΡΠ΅Π½Π΅ ΠΈ ΡΠ΅ΡΠ΅Π½Π·ΠΈΡΠ΅ Π½ΠΈΡΡ Π²Π΅ΡΠΈΡΠΈΠΊΠΎΠ²Π°Π½Π΅ Β Π‘Π°Π·Π½Π°ΡΡΠ΅ Π²ΠΈΡΠ΅
Π ΠΎΠ²ΠΎΡ Π΅-ΠΊΡΠΈΠ·ΠΈ
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 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.
ΠΡΠ΅Π½ΠΈΡΠ΅ ΠΎΠ²Ρ Π΅-ΠΊΡΠΈΠ³Ρ
ΠΠ°Π²ΠΈΡΠ΅ Π½Π°ΠΌ ΡΠ²ΠΎΡΠ΅ ΠΌΠΈΡΡΠ΅ΡΠ΅.
ΠΠ½ΡΠΎΡΠΌΠ°ΡΠΈΡΠ΅ ΠΎ ΡΠΈΡΠ°ΡΡ
ΠΠ°ΠΌΠ΅ΡΠ½ΠΈ ΡΠ΅Π»Π΅ΡΠΎΠ½ΠΈ ΠΈ ΡΠ°Π±Π»Π΅ΡΠΈ
ΠΠ½ΡΡΠ°Π»ΠΈΡΠ°ΡΡΠ΅ Π°ΠΏΠ»ΠΈΠΊΠ°ΡΠΈΡΡ Google Play ΠΊΡΠΈΠ³Π΅ Π·Π° Android ΠΈ iPad/iPhone. ΠΡΡΠΎΠΌΠ°ΡΡΠΊΠΈ ΡΠ΅ ΡΠΈΠ½Ρ
ΡΠΎΠ½ΠΈΠ·ΡΡΠ΅ ΡΠ° Π½Π°Π»ΠΎΠ³ΠΎΠΌ ΠΈ ΠΎΠΌΠΎΠ³ΡΡΠ°Π²Π° Π²Π°ΠΌ Π΄Π° ΡΠΈΡΠ°ΡΠ΅ ΠΎΠ½Π»Π°ΡΠ½ ΠΈ ΠΎΡΠ»Π°ΡΠ½ Π³Π΄Π΅ Π³ΠΎΠ΄ Π΄Π° ΡΠ΅ Π½Π°Π»Π°Π·ΠΈΡΠ΅.
ΠΠ°ΠΏΡΠΎΠΏΠΎΠ²ΠΈ ΠΈ ΡΠ°ΡΡΠ½Π°ΡΠΈ
ΠΠΎΠΆΠ΅ΡΠ΅ Π΄Π° ΡΠ»ΡΡΠ°ΡΠ΅ Π°ΡΠ΄ΠΈΠΎ-ΠΊΡΠΈΠ³Π΅ ΠΊΡΠΏΡΠ΅Π½Π΅ Π½Π° Google Play-Ρ ΠΏΠΎΠΌΠΎΡΡ Π²Π΅Π±-ΠΏΡΠ΅Π³Π»Π΅Π΄Π°ΡΠ° Π½Π° ΡΠ°ΡΡΠ½Π°ΡΡ.
Π-ΡΠΈΡΠ°ΡΠΈ ΠΈ Π΄ΡΡΠ³ΠΈ ΡΡΠ΅ΡΠ°ΡΠΈ
ΠΠ° Π±ΠΈΡΡΠ΅ ΡΠΈΡΠ°Π»ΠΈ Π½Π° ΡΡΠ΅ΡΠ°ΡΠΈΠΌΠ° ΠΊΠΎΡΠ΅ ΠΊΠΎΡΠΈΡΡΠ΅ Π΅-ΠΌΠ°ΡΡΠΈΠ»ΠΎ, ΠΊΠ°ΠΎ ΡΡΠΎ ΡΡ Kobo Π΅-ΡΠΈΡΠ°ΡΠΈ, ΡΡΠ΅Π±Π° Π΄Π° ΠΏΡΠ΅ΡΠ·ΠΌΠ΅ΡΠ΅ ΡΠ°ΡΠ» ΠΈ ΠΏΡΠ΅Π½Π΅ΡΠ΅ΡΠ΅ Π³Π° Π½Π° ΡΡΠ΅ΡΠ°Ρ. ΠΡΠ°ΡΠΈΡΠ΅ Π΄Π΅ΡΠ°ΡΠ½Π° ΡΠΏΡΡΡΡΠ²Π° ΠΈΠ· ΡΠ΅Π½ΡΡΠ° Π·Π° ΠΏΠΎΠΌΠΎΡ Π΄Π° Π±ΠΈΡΡΠ΅ ΠΏΡΠ΅Π½Π΅Π»ΠΈ ΡΠ°ΡΠ»ΠΎΠ²Π΅ Ρ ΠΏΠΎΠ΄ΡΠΆΠ°Π½Π΅ Π΅-ΡΠΈΡΠ°ΡΠ΅.
