GCDHEU: Heuristic polynomial GCD algorithm based on integer GCD computation

Authors:
Bruce W. Char;Keith O. Geddes;Gaston H. Gonnet
Affiliations:
Department of Computer Science University of Waterloo Waterloo, Ontario Canada N2L 3G1;Department of Computer Science University of Waterloo Waterloo, Ontario Canada N2L 3G1;Department of Computer Science University of Waterloo Waterloo, Ontario Canada N2L 3G1
Venue:
Journal of Symbolic Computation
Year:
1989

Citing 10
Cited 6

Subresultants and Reduced Polynomial Remainder Sequences

Journal of the ACM (JACM)
On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors

Journal of the ACM (JACM)
The Subresultant PRS Algorithm

ACM Transactions on Mathematical Software (TOMS)
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
Probabilistic algorithms for sparse polynomials

EUROSAM '79 Proceedings of the International Symposiumon on Symbolic and Algebraic Computation
GCDHEU: Heuristic Polynomial GCD Algorithm Based on Integer GCD Computation

EUROSAM '84 Proceedings of the International Symposium on Symbolic and Algebraic Computation
HEUGCD: How Elementary Upperbounds Generated Cheaper Data

EUROCAL '85 Research Contributions from the European Conference on Computer Algebra-Volume 2
Non-modular computation of polynomial GCD's using trial division

EUROSAM '79 Proceedings of the International Symposiumon on Symbolic and Algebraic Computation
The EZ GCD algorithm

ACM '73 Proceedings of the ACM annual conference
The EEZ-GCD algorithm

ACM SIGSAM Bulletin

A new modular algorithm for computation of algebraic number polynomial gcds

ISSAC '89 Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation
Parallelization of the sparse modular GCD algorithm for multivariate polynomials on shared memory multiprocessors

ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation
The accelerated integer GCD algorithm

ACM Transactions on Mathematical Software (TOMS)
On computing greatest common divisors with polynomials given by black boxes for their evaluations

ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
On the design and implementation of Brown's algorithm over the integers and number fields

ISSAC '00 Proceedings of the 2000 international symposium on Symbolic and algebraic computation
Foreword: In honour of Keith Geddes on his 60th birthday

Journal of Symbolic Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

A heuristic algorithm, GCDHEU, is described for polynomial GCD computation over the integers. The algorithm is based on evaluation at a single large integer value (for each variable), integer GCD computation, and a single-point interpolation scheme. Timing comparisons show that this algorithm is very efficient for most univariate problems and it is also the algorithm of choice for many problems in up to four variables.