Paralielization of the Buchberger algorithm
Copyright policy )Paralielization of the Buchberger algorithm
The author discusses parallelization of Buchberger's completion algorithm for polynomial ideals. He first give a declarative representation of the algorithm as a system of rewriting rules which are applied to lists of typed polynomials. He next considers parallel and distributed implementations of the algorithm in the APS system which was developed by the author and others.
Distributed algorithms, Buchberger's completion algorithm, Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases), Symbolic computation and algebraic computation
Distributed algorithms, Buchberger's completion algorithm, Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases), Symbolic computation and algebraic computation
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).0 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!