Coloring and degeneracy for determining very large and sparse derivative matrices

dc.contributor.authorSuny, Ashraful Huq
dc.contributor.authorUniversity of Lethbridge. Faculty of Arts and Science
dc.contributor.supervisorHossain, Shahadat
dc.date.accessioned2017-01-19T17:49:23Z
dc.date.available2017-01-19T17:49:23Z
dc.date.issued2016
dc.degree.levelMastersen_US
dc.description.abstractEstimation 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.embargoNoen_US
dc.identifier.urihttps://hdl.handle.net/10133/4766
dc.language.isoenen_US
dc.proquest.subject0984en_US
dc.proquestyesYesen_US
dc.publisherLethbridge, Alta : University of Lethbridge, Dept. of Mathematics and Computer Scienceen_US
dc.publisher.departmentDepartment of Mathematics and Computer Scienceen_US
dc.publisher.facultyArts and Scienceen_US
dc.relation.ispartofseriesThesis (University of Lethbridge. Faculty of Arts and Science)en_US
dc.subjectdegeneracyen_US
dc.subjectgraph coloringen_US
dc.subjectgreedy coloringen_US
dc.subjectmaximum k-coreen_US
dc.subjectoptimal partitioningen_US
dc.subjectunidirectional partitioningen_US
dc.titleColoring and degeneracy for determining very large and sparse derivative matricesen_US
dc.typeThesisen_US
Files
Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
SUNY_ASHRAFUL_MSC_2016.pdf
Size:
260.95 KB
Format:
Adobe Portable Document Format
Description:
License bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
1.75 KB
Format:
Item-specific license agreed upon to submission
Description: