In the field of computer algebra, joining separate computer a lgebra systems with individual strengths into problem solving environments is an important recent research direction. In this paper we describe how we wrapped a specialized computer algebra syst em, which uses shared-memory parallelism to speed up Gröbner b asis computations, into a Web component that can be used by oth er systems. By this component also a new algorithmic developme nt in Gröbner basis computations—the use of the fractal Gröbner walk—was made available to various general purpose computer algebra systems in the form of a single optimized implementati on. Previously, all of the important algorithmic improvements to an algorithm had to be reimplemented in the general purpose syste ms . Our implementation allows access to the Gröbner basis com putations via “intelligent” graphical user interfaces and vi a scripting from existing general purpose algebra systems.
[1]
Paul S. Wang,et al.
MP: a protocol for efficient exchange of mathematical expressions
,
1994,
ISSAC '94.
[2]
Heinz Kredel,et al.
Gröbner Bases: A Computational Approach to Commutative Algebra
,
1993
.
[3]
Samuel B. Williams,et al.
ASSOCIATION FOR COMPUTING MACHINERY
,
2000
.
[4]
Wolfgang Küchlin,et al.
Walking Faster
,
1996,
DISCO.
[5]
Michael Kalkbrener,et al.
Converting Bases with the Gröbner Walk
,
1997,
J. Symb. Comput..
[6]
Wolfgang Küchlin,et al.
A case study of multi-threaded Gröbner basis completion
,
1996,
ISSAC '96.
[7]
Wolfgang Küchlin,et al.
On the Walk
,
1997,
Theor. Comput. Sci..
[8]
Stephen M. Watt,et al.
An OpenMath 1.0 implementation
,
1997,
ISSAC.
[9]
B. Buchberger.
Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems
,
1970
.