Back to search

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

On the determination of sparse Hessian matrices using multi-coloring

Abstract

dc:description.abstract

Efficient determination of large sparse Hessian matrices leads to solving many optimization problems. Exploiting sparsity and symmetry of the Hessian matrix can reduce the number of function evaluations required to determine the matrix. This sparse matrix determination problem can be posed as a graph coloring problem. Graph formulation of the problem using an appropriate model can lead to a better exposition of the matrix compression heuristics.

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
  • Mithila, Nasrin Hakim
  • University of Lethbridge. Faculty of Arts and Science
Advisor dc:contributor.supervisor
  • Hossain, Shahadat

Subjects

dc:subject × 5

Rights

Language dc:language.iso
en_US

Identifiers

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

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

Mithila, Nasrin Hakim; University of Lethbridge. Faculty of Arts and Science. On the determination of sparse Hessian matrices using multi-coloring. Masters thesis, Lethbridge, Alta : University of Lethbridge, Dept. of Mathematics and Computer Science, 2016. https://hdl.handle.net/10133/4782