|Published (Last):||28 April 2014|
|PDF File Size:||20.93 Mb|
|ePub File Size:||13.60 Mb|
|Price:||Free* [*Free Regsitration Required]|
John Garas. Patrick Vandenameele. Andrew Pollard. Home Contact us Help Free delivery worldwide. Free delivery worldwide. Bestselling Series. Harry Potter. Popular Features. Home Learning. Description 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.
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. Product details Format Paperback pages Dimensions x x Other books in this series. Machine Learning Tom M. Add to basket. Sol-Gel Optics Dr. Image and Text Compression James A. Advances in Wireless Communications Jack M. Multimedia Information Systems Marios C.
Table of contents 1. Euclid's Algorithm. Continued Fractions. Diophantine Equations. Lattice Techniques. Arithmetic Functions. Residue Rings. Polynomial Arithmetic. Polynomial Elimination. Formal Power Series. Bounds on Polynomials. Zero Equivalence Testing. Univariate Interpolation. Multivariate Interpolation. Hensel Algorithms. Sparse Hensel Algorithms. Factoring over Finite Fields. Irreducibility of Polynomials. Univariate Factorization. Multivariate Factorization.
List of Symbols. Learn about new offers and get more deals by joining our newsletter. Sign up now. Follow us. Coronavirus delivery updates.
Effective Polynomial Computation
Would you like to tell us about a lower price? If you are a seller for this product, would you like to suggest updates through seller support? 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.
Effective Polynomial Computation / Edition 1
This book contains papers presented at a workshop on the use of parallel techniques in symbolic and algebraic computation held at Cornell University in May The eight papers in the book fall into three groups. The first three papers discuss p Euclid's Algorithm.