𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Parallel modular computation of Gröbner and involutive bases

✍ Scribed by D. A. Yanovich

Book ID
120755718
Publisher
SP MAIK Nauka/Interperiodica
Year
2013
Tongue
English
Weight
149 KB
Volume
39
Category
Article
ISSN
0361-7688

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

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