Bandwidth Minimization for Sparse Matrices

Please use this identifier to cite or link to this item: http://hdl.handle.net/11375/7275

Full metadata record

DC Field	Value	Language
dc.contributor.advisor	Chakravarti, P.C.	en_US
dc.contributor.author	Goyal, Virendra K.	en_US
dc.date.accessioned	2014-06-18T16:38:50Z	-
dc.date.available	2014-06-18T16:38:50Z	-
dc.date.created	2010-07-15	en_US
dc.date.issued	1975-11	en_US
dc.identifier.other	opendissertations/2558	en_US
dc.identifier.other	3642	en_US
dc.identifier.other	1396135	en_US
dc.identifier.uri	http://hdl.handle.net/11375/7275	-
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>	en_US
dc.subject	Computational Engineering	en_US
dc.subject	Computational Engineering	en_US
dc.title	Bandwidth Minimization for Sparse Matrices	en_US
dc.type	thesis	en_US
dc.contributor.department	Computation	en_US
dc.description.degree	Master of Science (MS)	en_US
Appears in Collections:	Open Access Dissertations and Theses

Files in This Item:

File	Size	Format
fulltext.pdf Open Access	2.63 MB	Adobe PDF	View/Open