A fast implementation of polynomial factorization

Authors:
Michael Lucks
Affiliations:
IBM T. J. Watson Research Center, Yorktown Heights, NY
Venue:
SYMSAC '86 Proceedings of the fifth ACM symposium on Symbolic and algebraic computation
Year:
1986

Citing 5
Cited 0

The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms

The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Probabilistic algorithms for sparse polynomials

EUROSAM '79 Proceedings of the International Symposiumon on Symbolic and Algebraic Computation
Implementing a polynomial factorization and GCD package

SYMSAC '81 Proceedings of the fourth ACM symposium on Symbolic and algebraic computation
Computational aspects of Hensel-type univariate polynomial greatest common divisor algorithms

ACM SIGSAM Bulletin
A comparison of the Vaxima and Reduce factorization packages

ACM SIGSAM Bulletin

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new package for factoring polynomials with integer coefficients is described which yields significant improvements over previous implementations in both time and space requirements. For multivariate problems, the package features an inexpensive method for early detection and correction of spurious factors. This essentially solves the multivariate extraneous factor problem and eliminates the need to factor more than one univariate image, except in rare cases. Also included is an improved technique for coefficient prediction which is successful more frequently than prior versions at short-circuiting the expensive multivariate Hensel lifting stage. In addition some new approaches are discussed for the univariate case as well as for the problem of finding good integer substitution values. The package has been implemented both in Scratchpad II and in an experimental version of muMATH.