Effective Polynomial Computation
Richard Zippel
des. 2012 · The Springer International Series in Engineering and Computer Science Bók 241 · Springer Science & Business Media
Rafbók
363
Síður
reportEinkunnir og umsagnir eru ekki staðfestar Nánar
Um þessa rafbók
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.
Gefa þessari rafbók einkunn.
Segðu okkur hvað þér finnst.
Upplýsingar um lestur
Snjallsímar og spjaldtölvur
Settu upp forritið Google Play Books fyrir Android og iPad/iPhone. Það samstillist sjálfkrafa við reikninginn þinn og gerir þér kleift að lesa með eða án nettengingar hvar sem þú ert.
Fartölvur og tölvur
Hægt er að hlusta á hljóðbækur sem keyptar eru í Google Play í vafranum í tölvunni.
Lesbretti og önnur tæki
Til að lesa af lesbrettum eins og Kobo-lesbrettum þarftu að hlaða niður skrá og flytja hana yfir í tækið þitt. Fylgdu nákvæmum leiðbeiningum hjálparmiðstöðvar til að flytja skrár yfir í studd lesbretti.
