“One sugar cube, please” or selection strategies in the Buchberger algorithm
ISSAC '91 Proceedings of the 1991 international symposium on Symbolic and algebraic computation
A case study of multi-threaded Gröbner basis completion
ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation
Strategy-accurate parallel Buchberger algorithms
Journal of Symbolic Computation - Special issue on parallel symbolic computation
Involutive bases of polynomial ideals
Mathematics and Computers in Simulation - Special issue: Simplification of systems of algebraic and differential equations with applications
Mathematics and Computers in Simulation - Special issue: Simplification of systems of algebraic and differential equations with applications
On an Algorithmic Optimization in Computation of Involutive Bases
Programming and Computing Software
Parallelization of an Algorithm for Computation of Involutive Janet Bases
Programming and Computing Software
Parallel modular computation of Gröbner and involutive bases
Programming and Computing Software
| Hi-index | 0.00 |
In this paper, a parallel algorithm for computation of polynomial Janet bases is considered. After construction of a Janet basis, a reduced Gröbner basis (which is a subset of the Janet basis) is extracted from it without any additional reductions. The algorithm discussed is an improved version of an earlier suggested parallel algorithm. The efficiency of a C implementation of the algorithm and its scalability are illustrated by way of the standard test examples that are often used for comparing various algorithms and codes for computing Gröbner bases.