{"id":{"repo_id":"mcmaster","oai_identifier":"oai:macsphere.mcmaster.ca:11375/7275"},"canonical_url":"https://search.ndltd.org/etd/mcmaster/oai:macsphere.mcmaster.ca:11375/7275","repository":{"repo_id":"mcmaster","name":"McMaster University","base_url":"https://macsphere.mcmaster.ca/server/oai/request"},"display":{"title":"Bandwidth Minimization for Sparse Matrices","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>","abstract_html":"&lt;p&gt;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.&lt;/p&gt;","abstract_has_math":false,"creators":["Goyal, Virendra K."],"institution":null,"degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Computation","school":null,"contributors":[],"advisors":["Chakravarti, P.C."],"committee_chairs":[],"committee_members":[],"year":1975,"date_issued":"1975-11","date_published":"1975-11","updated_at":"2026-11-18T19:33:35Z","subjects":["Computational Engineering"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://doi.org/10.71548/14537"],"render_values":[{"text":"https://doi.org/10.71548/14537","href":"https://doi.org/10.71548/14537","code":true}]},{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["opendissertations/2558","3642","1396135"],"render_values":[{"text":"opendissertations/2558","href":null,"code":true},{"text":"3642","href":null,"code":true},{"text":"1396135","href":null,"code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/11375/7275","outbound_label":"Handle","outbound_source":"dc:identifier.uri","record_url":"http://hdl.handle.net/11375/7275","record_label":"Repository record","record_kind":"handle","record_source":"dc:identifier.uri","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://macsphere.mcmaster.ca/server/oai/request?verb=GetRecord&metadataPrefix=dim&identifier=oai%3Amacsphere.mcmaster.ca%3A11375%2F7275","prefix":"dim"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Chakravarti, P.C."]},{"key":"dc:contributor.department","label":"Department","values":["Computation"]},{"key":"dc:creator","label":"Author","values":["Goyal, Virendra K."]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2014-06-18T16:38:50Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2014-06-18T16:38:50Z"]},{"key":"dc:date.created","label":"Dc Date Created","values":["2010-07-15"]},{"key":"dc:date.issued","label":"Date","values":["1975-11"]},{"key":"dc:type","label":"Dc Type","values":["thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Computational Engineering"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["opendissertations/2558","3642","1396135"]},{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/11375/7275","https://doi.org/10.71548/14537"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["<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>"]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["Master of Science (MS)"]},{"key":"dc:title","label":"Title","values":["Bandwidth Minimization for Sparse Matrices"]},{"key":"others:access_status","label":"Others Access Status","values":["open.access"]}]}],"canonical_facts":{"dc:contributor.advisor":["Chakravarti, P.C."],"dc:contributor.department":["Computation"],"dc:creator":["Goyal, Virendra K."],"dc:date.accessioned":["2014-06-18T16:38:50Z"],"dc:date.available":["2014-06-18T16:38:50Z"],"dc:date.created":["2010-07-15"],"dc:date.issued":["1975-11"],"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>"],"dc:description.degree":["Master of Science (MS)"],"dc:identifier.other":["opendissertations/2558","3642","1396135"],"dc:identifier.uri":["http://hdl.handle.net/11375/7275","https://doi.org/10.71548/14537"],"dc:subject":["Computational Engineering"],"dc:title":["Bandwidth Minimization for Sparse Matrices"],"dc:type":["thesis"],"others:access_status":["open.access"]},"updated_at":"2026-11-18T19:33:35Z"}