Remote Access Mathematics of Computation
Green Open Access

Mathematics of Computation

ISSN 1088-6842(online) ISSN 0025-5718(print)

 

 

An improved multivariate polynomial factoring algorithm


Author: Paul S. Wang
Journal: Math. Comp. 32 (1978), 1215-1231
MSC: Primary 12-04
DOI: https://doi.org/10.1090/S0025-5718-1978-0568284-3
MathSciNet review: 0568284
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: A new algorithm for factoring multivariate polynomials over the integers based on an algorithm by Wang and Rothschild is described. The new algorithm has improved strategies for dealing with the known problems of the original algorithm, namely, the leading coefficient problem, the bad-zero problem and the occurrence of extraneous factors. It has an algorithm for correctly predetermining leading coefficients of the factors. A new and efficient p-adic algorithm named EEZ is described. Basically it is a linearly convergent variable-by-variable parallel construction. The improved algorithm is generally faster and requires less store then the original algorithm. Machine examples with comparative timing are included.


References [Enhancements On Off] (What's this?)


Similar Articles

Retrieve articles in Mathematics of Computation with MSC: 12-04

Retrieve articles in all journals with MSC: 12-04


Additional Information

DOI: https://doi.org/10.1090/S0025-5718-1978-0568284-3
Article copyright: © Copyright 1978 American Mathematical Society