𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Asymmetric approach to computation of Gröbner bases

✍ Scribed by E. V. Pankratiev; A. S. Semenov

Book ID
106434984
Publisher
Springer US
Year
2008
Tongue
English
Weight
143 KB
Volume
149
Category
Article
ISSN
1573-8795

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Gröbner Approach to Involutive Bases
A Gröbner Approach to Involutive Bases
✍ Joachim Apel 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 574 KB

Recently, Zharkov and Blinkov introduced the notion of involutive bases of polynomial ideals. This involutive approach has its origin in the theory of partial differential equations and is a translation of results of Janet and Pommaret. In this paper we present a pure algebraic foundation of involut

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