Fast Parallel Gcd Algorithms for Several Polynomials Over Integral Domain (Classic Reprint) - Hardcover
Synopsis
Discover how to compute the greatest common divisor of many polynomials in parallel, using subresultants and the PRAM model.
This work extends the subresultant framework from two polynomials to several, delivering a practical parallel approach to GCD computation over an integral domain. It presents how to build a parallel pipeline that matches the time and processor bounds of established methods while handling larger polynomial sets.
This book grounds its methods in the theory of subresultants and Sylvester-type matrices, then shows how to translate that theory into a concrete algorithm. It discusses constructing matrices, analyzing ranks, and using parallel primitives to obtain the GCD efficiently. The study also connects classical results with contemporary parallel computation techniques, offering a clear path from theory to implementation.- Learn how to extend subresultants to multiple polynomials
- See how the Sylvester matrix and rank analysis drive parallel GCD methods
- Explore a PRAM-based model of computation and its implications for efficiency
- Understand the process from matrix construction to det(polynomial) computations and GCD extraction
"synopsis" may belong to another edition of this title.
