Work

An Improved Multivariate Polynomial Factoring Algorithm

Year: 1978

Type: article

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.

Source: Mathematics of Computation

DOI: 10.1090/s0025-5718-1978-0568284-3

Author: Paul S. Wang

Institution: Kent State University

Language: English

Topic: Polynomial and algebraic computation

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: bronze

Funders: National Science Foundation, U.S. Department of Energy, National Aeronautics and Space Administration, Kent State University

Award: New and Improved Computer Algorithms and Systems For Multivariate Polynomial Manipulation