Accession Number : ADA196102


Title :   Parallel Algorithms for Groebner-Basis Reduction


Descriptive Note : Technical rept. 7 Aug 1984-6 Aug 1987


Corporate Author : CALIFORNIA UNIV BERKELEY DEPT OF ELECTRICAL ENGINEERING AND COMPUTER SCIENCE


Personal Author(s) : Ponder, Carl


Full Text : https://apps.dtic.mil/dtic/tr/fulltext/u2/a196102.pdf


Report Date : 25 Sep 1987


Pagination or Media Count : 20


Abstract : A variety of ways is presented to parallelize Groebner-basis reduction, ranging from incorrect to ineffectual. The superiority is demonstrated of the method used by Zacharias, which is not readily parallelizable. The efficiency issues of generating reduced Groebner-bases, is discussed. Keywords: Algorithms; design; Computer algebra; Groebner bases; parallel computation; polynomial ideals; simplification.


Descriptors :   *PARALLEL PROCESSING , COMPUTATIONS , PARALLEL ORIENTATION , ALGEBRA , ALGORITHMS , COMPUTERS


Subject Categories : Theoretical Mathematics


Distribution Statement : APPROVED FOR PUBLIC RELEASE