Back to search

McMaster University

Bandwidth Minimization for Sparse Matrices

Abstract

dc:description.abstract

<p>A short survey of recent developments in sparse matrix techniques is presented in this project. One of the problems in this area is concerned with bandwidth reduction. Several algorithms for finding symmetric row and column permutations for a given sparse symmetric matrix, such that the resulting matrix has minimum bandwidth, are discussed. A few modified algorithms yielding a better bandwidth reduction are also presented. Six well known Example problems are utilized to illustrate the work.</p>

Degree

thesis:*
Department dc:contributor.department
Computation
Year dc:date.issued
1975

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Goyal, Virendra K.
Advisor dc:contributor.advisor
  • Chakravarti, P.C.

Subjects

dc:subject × 1

Identifiers

dc:identifier.*
Dc Identifier Other
opendissertations/2558
3642
1396135

Chain of custody

source
Harvested from
McMaster University
Base URL
macsphere.mcmaster.ca/server/oai/request
Last updated
2026-11-18
Source record
OAI-PMH GetRecord
citation

Goyal, Virendra K.. Bandwidth Minimization for Sparse Matrices. 1975. http://hdl.handle.net/11375/7275