Buchberger,s Algorithm
المؤلف:
Becker, T. and Weispfenning, V
المصدر:
Gröbner Bases: A Computational Approach to Commutative Algebra. New York: Springer-Verlag
الجزء والصفحة:
...
19-1-2019
1080
Buchberger's Algorithm
The algorithm for the construction of a Gröbner basis from an arbitrary ideal basis. Buchberger's algorithm relies on the concepts of 
-polynomial and polynomial reduction modulo a set of polynomials, the latter being the most computationally intensive part of the algorithm.
REFERENCES:
Becker, T. and Weispfenning, V. Gröbner Bases: A Computational Approach to Commutative Algebra. New York: Springer-Verlag, pp. 213-214, 1993.
Buchberger, B. "Theoretical Basis for the Reduction of Polynomials to Canonical Forms." SIGSAM Bull. 39, 19-24, Aug. 1976.
Cox, D.; Little, J.; and O'Shea, D. Ideals, Varieties, and Algorithms: An Introduction to Algebraic Geometry and Commutative Algebra, 2nd ed. New York: Springer-Verlag, 1996.
Giovini, A.; Mora, T.; Niesi, G.; Robbiano, L.; and Traverso, C. "One Sugar Cube, Please?, or Selection Strategies in the Buchberger Algorithm." Proceedings of the International Symposium on Symbolic and Algebraic Computation. pp. 49-54, June 1991.
الاكثر قراءة في مواضيع عامة في الجبر
اخر الاخبار
اخبار العتبة العباسية المقدسة
