Please use this identifier to cite or link to this item: http://prr.hec.gov.pk/jspui/handle/123456789/1029
Full metadata record
DC FieldValueLanguage
dc.contributor.authorIdrees, Nazeran-
dc.date.accessioned2017-11-30T09:27:24Z-
dc.date.available2017-11-30T09:27:24Z-
dc.date.issued2006-
dc.identifier.uri http://prr.hec.gov.pk/jspui/handle/123456789//1029-
dc.description.abstractThe 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.en_US
dc.description.sponsorshipHigher Education Commission, Pakistanen_US
dc.language.isoenen_US
dc.publisherGC University Lahore, Pakistanen_US
dc.subjectNatural Sciencesen_US
dc.subjectMathematicsen_US
dc.titleAlgorithms for Primary Decompositionen_US
dc.typeThesisen_US
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.