+612 9045 4394
Hardcover
Published: 31st July 1993
ISBN: 9780792393757
Number Of Pages: 363
Paperback
View Product
Published: 8th October 2012Effective 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.
| Euclid's Algorithm | p. 1 |
| Continued Fractions | p. 11 |
| Diophantine Equations | p. 41 |
| Lattice Techniques | p. 57 |
| Arithmetic Functions | p. 73 |
| Residue Rings | p. 85 |
| Polynomial Arithmetic | p. 107 |
| Polynomial GCD's: Classical Algorithms | p. 125 |
| Polynomial Elimination | p. 137 |
| Formal Power Series | p. 157 |
| Bounds on Polynomials | p. 173 |
| Zero Equivalence Testing | p. 189 |
| Univariate Interpolation | p. 207 |
| Multivariate Interpolation | p. 231 |
| Polynomial GCD's: Interpolation Algorithms | p. 247 |
| Hensel Algorithms | p. 261 |
| Sparse Hensel Algorithms | p. 285 |
| Factoring over Finite Fields | p. 293 |
| Irreducibility of Polynomials | p. 303 |
| Univariate Factorization | p. 321 |
| Multivariate Factorization | p. 329 |
| List of symbols | p. 341 |
| Bibliography | p. 343 |
| Index | p. 357 |
| Table of Contents provided by Blackwell. All Rights Reserved. |
ISBN: 9780792393757
ISBN-10: 0792393759
Series: Evaluation in Education and Human Services
Audience:
Professional
Format:
Hardcover
Language:
English
Number Of Pages: 363
Published: 31st July 1993
Publisher: SPRINGER VERLAG GMBH
Country of Publication: NL
Dimensions (cm): 24.28 x 16.56
x 2.64
Weight (kg): 0.71
