Back to results

Lethbridge, Alta. : Universtiy of Lethbridge, Department of Mathematics and Computer Science

A Computational study of sparse or structured matrix operations

Abstract

dc:description.abstract

Matrix computation is an important area in high-performance scientific computing. Major computer manufacturers and vendors typically provide architecture- aware implementation libraries such as Basic Linear Algebra Subroutines (BLAS). In this thesis, we perform an experimental study of a subset of matrix operations, where the matrices are dense, sparse, or structured in Java. We implement a subset of BLAS operations in Java and compare their performance with standard data structures Compressed Row Storage (CRS) and Java Sparse Array (JSA) for dense and sparse structured matrices. The diagonal storage format is shown to be a viable alternative for dense and structured matrices.

Degree

thesis:*
Level thesis:degree_level
Masters
Grantor dc:publisher
Lethbridge, Alta. : Universtiy of Lethbridge, Department of Mathematics and Computer Science
Year dc:date.issued
2018

Author and committee

dc:creator, dc:contributor.*
Authors dc:creator
  • Aimaiti, Nuerrennisahan (Nurgul)
  • University of Lethbridge. Faculty of Arts and Science
Advisor dc:contributor.supervisor
  • Hossain, Shahadat

Subjects

dc:subject × 14

Rights

Language dc:language.iso
en_US

Identifiers

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

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

Aimaiti, Nuerrennisahan (Nurgul); University of Lethbridge. Faculty of Arts and Science. A Computational study of sparse or structured matrix operations. Masters thesis, Lethbridge, Alta. : Universtiy of Lethbridge, Department of Mathematics and Computer Science, 2018. https://hdl.handle.net/10133/5268