Parallelization of Modular Algorithms

详细信息    查看全文

• 作者：Nazeran Idrees^a ; ^{nazeranjawwad@gmail.com} ; Gerhard Pfister^b ; ^{pfister@mathematik.uni-kl.de} ; ; Stefan Steidel^b ; ¹ ; ^{steidel@mathematik.uni-kl.de} ;
• 关键词：Gr&#xf6 ; bner bases ; Primary decomposition ; Modular computation ; Parallel computation
• 刊名：Journal of Symbolic Computation
• 出版年：2011
• 出版时间：June 2011
• 年：2011
• 卷：46
• 期：6
• 页码：672-684
• 全文大小：308 K

文摘

In this paper we investigate the parallelization of two modular algorithms. In fact, we consider the modular computation of Gröbner bases (resp. standard bases) and the modular computation of the associated primes of a zero-dimensional ideal and describe their parallel implementation in Singular. Our modular algorithms for solving problems over mainly consist of three parts: solving the problem modulo p for several primes p, lifting the result to by applying the Chinese remainder algorithm (resp. rational reconstruction), and verification. Arnold proved using the Hilbert function that the verification part in the modular algorithm for computing Gröbner bases can be simplified for homogeneous ideals (cf. Arnold, 2003). The idea of the proof could easily be adapted to the local case, i.e. for local orderings and not necessarily homogeneous ideals, using the Hilbert–Samuel function (cf. Pfister, 2007). In this paper we prove the corresponding theorem for non-homogeneous ideals in the case of a global ordering.