Alfonso Miola
Abstract
Two Hensel-type univariate polynomial Greatest Common Divisor (GCD) algorithms are presented and compared. The regular linear Hensel construction is shown to be generally more efficient than the Zassenhaus quadratic construction. The UNIGCD algorithm for UNIvariate polynomial GCD computations, based on the regular Hensel construction is then presented and compared with the Modular algorithm based on the Chinese Remainder Algorithm. From both an analytical and an experimental point of view, the UNIGCD algorithm is shown to be preferable for many common univariate GCD computations. This is true even for dense polynomials, which was considered to be the most suitable case for the application of the Modular algorithm.
- {BER67} Berlekamp, E. R., "Factoring Polynomials over Finite Field", Bell System Technical Journal, Vol. 46, 1967, pp. 1853--1859.Google Scholar
Cross Ref
- {BR071} Brown, W. S., "On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors", JACM, Vol. 18, No. 4, October 1971, pp. 478--504. Google ScholarDigital Library
- {COL66} Collins, G. E., "Polynomial Remainder Sequence and Determinants", Am. Math. Monthly, 73, Aug.-Sept. 1966, pp. 708--712.Google ScholarCross Ref
- {COL67} Collins, G. E., "Subresultant and Reduced Polynomial Remainder Sequences", JACM, Vol. 14, January 1967, pp. 128--142. Google ScholarDigital Library
- {COL73} Collins, G. E., "The Computing Time of Euclindean Algorithm", Stanford Artificial Intelligence Laboratory Memo AIM - 187, Stanford Computer Science Department Report CS - 331, January 1973. Google ScholarDigital Library
- {HOR71} Horowitz, E., "Modular Arithmetic and Finite Field Theory", {PET71}, March 1971, pp. 188--194.Google Scholar
- {KNU69} Knuth, D. E., "The Art of Computer Programming", Vol. 2: Seminumerical Algorithms, Addison Wesley, Reading, Mass., 1969. Google ScholarDigital Library
- {MUS71} Musser, D. R., "Algorithms for Polynomial Factorization", Ph.D. Thesis, Computer Science Department, University of Wisconsin, August 1971. Google ScholarDigital Library
- {M&Y73} Moses, J., and Yun, D. Y. Y., "The EZ GCD Algorithm", Proceedings of ACM Annual Conference, August 1973, Atlanta, pp. 159--166. Google ScholarDigital Library
- {PET71} "Proc. of the Second Symposium on Symbolic and Algebraic Manipulation", Petrick, S. R., ed., ACM, March 1971.Google Scholar
- {VDW49} Van Der Waerden, B. L., "Modern Algebra", Vol. 1, Frederic Ungar Publishing Co., N.Y., 1949.Google Scholar
- {W&R73} Wang, P. S., and Rothschile, L. P., "Factoring Multivariate Polynomials over the Integers", ACM SIGSAM Bulletin No. 28, Dec. 1973. Google ScholarDigital Library
- {YUN73} Yun, D. Y. Y., "The Hensel Lemma in Algebraic Manipulation", Ph.D. Thesis, Department of Mathematics, MIT, November 1973.Google Scholar
- {ZAS69} Zassenhaus, H., "On Hensel Factorization I", Journal of Number Theory, Vol. 1, 1969, pp. 291--311.Google ScholarCross Ref
Index Terms
- Computational aspects of Hensel-type univariate polynomial greatest common divisor algorithms
Recommendations
Barnett's Theorems About the Greatest Common Divisor of Several Univariate Polynomials Through Bezout-like Matrices
This article provides a new presentation of Barnett s theorems giving the degree (resp. coefficients) of the greatest common divisor of several univariate polynomials with coefficients in an integral domain by means of the rank (resp. linear ...
Univariate polynomials: nearly optimal algorithms for factorization and rootfinding
ISSAC '01: Proceedings of the 2001 international symposium on Symbolic and algebraic computationTo approximate all roots (zeros) of a univariate polynomial, we develop two effective algorithms and combine them in a single recursive process. One algorithm computes a basic well isolated zero-free annulus on the complex plane, whereas another ...
Computing the Greatest Common Divisor of Polynomials Using the Comrade Matrix
Computer MathematicsAbstractThe comrade matrix of a polynomial is an analogue of the companion matrix when the matrix is expressed in terms of a general basis such that the basis is a set of orthogonal polynomials satisfying the three-term recurrence relation. We present the ...
Comments