𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Parallelization of matrix algorithms for Gröbner basis computation

✍ Scribed by D. E. Alexandrov; V. V. Galkin; A. I. Zobnin; M. V. Levin

Publisher
Springer US
Year
2009
Tongue
English
Weight
218 KB
Volume
163
Category
Article
ISSN
1573-8795

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Modular algorithms for computing Gröbner
Modular algorithms for computing Gröbner bases
✍ Elizabeth A. Arnold 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 190 KB

Intermediate coefficient swell is a well-known difficulty with Buchberger's algorithm for computing Gröbner bases over the rational numbers. p-Adic and modular methods have been successful in limiting intermediate coefficient growth in other computations, and in particular in the Euclidian algorithm

A Fast Algorithm for Gröbner Basis Conve
A Fast Algorithm for Gröbner Basis Conversion and its Applications
✍ Quoc-Nam Tran 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 362 KB

The Gröbner walk method converts a Gröbner basis by partitioning the computation of the basis into several smaller computations following a path in the Gröbner fan of the ideal generated by the system of equations. The method works with ideals of zerodimension as well as positive dimension. Typicall

Parallel Computation of Gröbner Bases on
Parallel Computation of Gröbner Bases on Distributed Memory Machines
✍ Hiroyuki Sawada; Satoshi Terasaki; Akira Aiba 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 539 KB

This paper reports our work on parallelizing an algorithm computing Gröbner bases on a distributed memory parallel machine. When computing Gröbner bases, the efficiency of computation is dominated by the total number of S-polynomials. To decrease the total number of S-polynomials it is necessary to