Please use this identifier to cite or link to this item:
Title: Algorithms for Primary Decomposition
Authors: Idrees, Nazeran
Keywords: Natural Sciences
Issue Date: 2006
Publisher: GC University Lahore, Pakistan
Abstract: The primary decomposition methods of Eisenbud, Huneke and Vasconcelos are anal- ysed in detail providing proofs of important theorems and all the corresponding al- gorithms are programmed in the language of Singular. MOreover, we investigated the parallelization of two modular algorithms. In fact, we consider the modular com- putation of Gr ̈obner bases (resp. standard bases) and the modular computation of the associated primes of a zero–dimensional ideal and describe their parallel imple- mentation in Singular. The algorithms of Shimoyama and Yokoyama for primary decomposition of ideals are generalized to submodules of a free module over the polynomial ring in several variables with coefficients in a field. The algorithms are implemented in Singular.
Appears in Collections:PhD Thesis of All Public / Private Sector Universities / DAIs.

Files in This Item:
File Description SizeFormat 
703S.pdfComplete Thesis476.79 kBAdobe PDFView/Open
703S-0.pdfTable of Contents47.51 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.