Parallel Algorithms for Groebner-Basis Reduction

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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Sep 25, 1987
Accession Number
ADA196102

Entities

People

  • Carl Ponder

Organizations

  • University of California, Berkeley

Tags

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Applied Mathematics
  • California
  • Computations
  • Computer Science
  • Computers
  • Convergence
  • Electrical Engineering
  • Engineering
  • Equations
  • Mathematics
  • Naval Warfare
  • Numbers
  • Parallel Computing
  • Polynomials
  • Simplex Method

Readers

  • Graph Algorithms and Convex Optimization.
  • Linear Algebra
  • Systems Analysis and Design