Date of Award
11-1975
Degree Type
Thesis
Degree Name
Master of Science (MS)
Department
Computation
Supervisor
P.C. Chakravarti
Abstract
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.
Recommended Citation
Goyal, Virendra K., "Bandwidth Minimization for Sparse Matrices" (1975). Open Access Dissertations and Theses. Paper 2558.
http://digitalcommons.mcmaster.ca/opendissertations/2558