Show simple item record

dc.contributor.supervisor Hossain, Shahadat
dc.contributor.author Suny, Ashraful Huq
dc.contributor.author University of Lethbridge. Faculty of Arts and Science
dc.date.accessioned 2017-01-19T17:49:23Z
dc.date.available 2017-01-19T17:49:23Z
dc.date.issued 2016
dc.identifier.uri https://hdl.handle.net/10133/4766
dc.description.abstract Estimation of large sparse Jacobian matrix is a prerequisite for many scientific and engineering problems. It is known that determining the nonzero entries of a sparse matrix can be modeled as a graph coloring problem. To find out the optimal partitioning, we have proposed a new algorithm that combines existing exact and heuristic algorithms. We have introduced degeneracy and maximum k-core for sparse matrices to solve the problem in stages. Our combined approach produce better results in terms of partitioning than DSJM and for some test instances, we report optimal partitioning for the first time. en_US
dc.language.iso en en_US
dc.publisher Lethbridge, Alta : University of Lethbridge, Dept. of Mathematics and Computer Science en_US
dc.relation.ispartofseries Thesis (University of Lethbridge. Faculty of Arts and Science) en_US
dc.subject degeneracy en_US
dc.subject graph coloring en_US
dc.subject greedy coloring en_US
dc.subject maximum k-core en_US
dc.subject optimal partitioning en_US
dc.subject unidirectional partitioning en_US
dc.title Coloring and degeneracy for determining very large and sparse derivative matrices en_US
dc.type Thesis en_US
dc.publisher.faculty Arts and Science en_US
dc.publisher.department Department of Mathematics and Computer Science en_US
dc.degree.level Masters en_US
dc.proquest.subject 0984 en_US
dc.proquestyes Yes en_US
dc.embargo No en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record