Improved multivariate polynomial factoring algorithm
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. Bascially 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.
- Research Organization:
- Laboratory for Computer Science
- OSTI ID:
- 6770466
- Journal Information:
- Math. Comput.; (United States), Vol. 32:1144
- Country of Publication:
- United States
- Language:
- English
Similar Records
An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs
Interpolation of sparse multivariate polynomials over large finite fields with applications