<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> / Master of Science (MS)
| Identifer | oai:union.ndltd.org:mcmaster.ca/oai:macsphere.mcmaster.ca:11375/7275 |
| Date | 11 1900 |
| Creators | Goyal, Virendra K. |
| Contributors | Chakravarti, P.C., Computation |
| Source Sets | McMaster University |
| Detected Language | English |
| Type | thesis |
Page generated in 0.0016 seconds