Back to search

Lethbridge, Alta : University of Lethbridge, Dept. of Mathematics and Computer Science

Coloring and degeneracy for determining very large and sparse derivative matrices

Abstract

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.

Degree

thesis:*
Level thesis:degree_level
Masters
Grantor dc:publisher
Lethbridge, Alta : University of Lethbridge, Dept. of Mathematics and Computer Science
Year dc:date.issued
2016

Author and committee

dc:creator, dc:contributor.*
Authors dc:creator
  • Suny, Ashraful Huq
  • University of Lethbridge. Faculty of Arts and Science
Advisor dc:contributor.supervisor
  • Hossain, Shahadat

Subjects

dc:subject × 6

Rights

Language dc:language.iso
en

Identifiers

dc:identifier.*
Handle dc:identifier.uri
https://hdl.handle.net/10133/4766

Chain of custody

source
Harvested from
University of Lethbridge
Base URL
opus.uleth.ca/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Suny, Ashraful Huq; University of Lethbridge. Faculty of Arts and Science. Coloring and degeneracy for determining very large and sparse derivative matrices. Masters thesis, Lethbridge, Alta : University of Lethbridge, Dept. of Mathematics and Computer Science, 2016. https://hdl.handle.net/10133/4766