Farr-Gao algorithm is a state-of-the-art algorithm for reduced Gr?bner bases of vanishing ideals of finite points, which has been implemented in Maple as a build-in command. This paper presents a two-dimensional impro...Farr-Gao algorithm is a state-of-the-art algorithm for reduced Gr?bner bases of vanishing ideals of finite points, which has been implemented in Maple as a build-in command. This paper presents a two-dimensional improvement for it that employs a preprocessing strategy for computing reduced Gr?bner bases associated with tower subsets of given point sets. Experimental results show that the preprocessed Farr-Gao algorithm is more efficient than the classical one.展开更多
基金supported by the National Natural Science Foundation of China under Grant Nos.11101185 and 11171133
文摘Farr-Gao algorithm is a state-of-the-art algorithm for reduced Gr?bner bases of vanishing ideals of finite points, which has been implemented in Maple as a build-in command. This paper presents a two-dimensional improvement for it that employs a preprocessing strategy for computing reduced Gr?bner bases associated with tower subsets of given point sets. Experimental results show that the preprocessed Farr-Gao algorithm is more efficient than the classical one.
