Please use this identifier to cite or link to this item:
http://hdl.handle.net/11375/7275| Title: | Bandwidth Minimization for Sparse Matrices |
| Authors: | Goyal, Virendra K. |
| Advisor: | Chakravarti, P.C. |
| Department: | Computation |
| Keywords: | Computational Engineering;Computational Engineering |
| Publication Date: | Nov-1975 |
| 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> |
| URI: | http://hdl.handle.net/11375/7275 |
| Identifier: | opendissertations/2558 3642 1396135 |
| Appears in Collections: | Open Access Dissertations and Theses |
Files in This Item:
| File | Size | Format | |
|---|---|---|---|
| fulltext.pdf | 2.63 MB | Adobe PDF | View/Open |
Items in MacSphere are protected by copyright, with all rights reserved, unless otherwise indicated.
