{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/19563"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/19563","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Multiprocessor sparse SVD algorithms and applications","abstract":"In this thesis, we develop four numerical methods for computing the singular value decomposition (SVD) of large sparse matrices on a multiprocessor architecture. We particularly consider the SVD of unstructured sparse matrices in which the number of rows may be substantially larger or smaller than the number of columns. On vector machines, considerable progress has been made over the past 10 years in developing robust algorithms for the solution of the sparse symmetric eigenvalue problem using Lanczos (with or without re-orthogonalization) and subspace iteration methods. Our intent is to extend and refine this knowledge for computing the sparse singular value decomposition on a parallel computer. We emphasize Lanczos, block-Lanczos, subspace iteration, and trace minimization methods for determining several of the largest (or smallest) singular triplets (singular values and corresponding left- and right-singular vectors) for sparse matrices arising from certain practical applications. The target architectures for implementations of such methods include the Alliant FX/80 and the Cray-2S/4128. This algorithmic research is particularly motivated by recent information-retrieval techniques in which high-rank approximations to large sparse term-document matrices are needed, and by nonlinear inverse problems arising from seismic reflection tomography applications.","abstract_html":"In this thesis, we develop four numerical methods for computing the singular value decomposition (SVD) of large sparse matrices on a multiprocessor architecture. We particularly consider the SVD of unstructured sparse matrices in which the number of rows may be substantially larger or smaller than the number of columns. On vector machines, considerable progress has been made over the past 10 years in developing robust algorithms for the solution of the sparse symmetric eigenvalue problem using Lanczos (with or without re-orthogonalization) and subspace iteration methods. Our intent is to extend and refine this knowledge for computing the sparse singular value decomposition on a parallel computer. We emphasize Lanczos, block-Lanczos, subspace iteration, and trace minimization methods for determining several of the largest (or smallest) singular triplets (singular values and corresponding left- and right-singular vectors) for sparse matrices arising from certain practical applications. The target architectures for implementations of such methods include the Alliant FX/80 and the Cray-2S/4128. This algorithmic research is particularly motivated by recent information-retrieval techniques in which high-rank approximations to large sparse term-document matrices are needed, and by nonlinear inverse problems arising from seismic reflection tomography applications.","abstract_has_math":false,"creators":["Berry, Michael Waitsel"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Sameh, Ahmed H."],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2011,"date_issued":"2011-05-07T12:11:32Z","date_published":"2011-05-07T12:11:32Z","updated_at":"2026-07-22T22:25:14Z","subjects":["Computer Science"],"languages":["eng"],"rights":["Copyright 1991 Berry, Michael Waitsel"],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["AAI9124383","(UMI)AAI9124383"],"render_values":[{"text":"AAI9124383","href":null,"code":true},{"text":"(UMI)AAI9124383","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/19563","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Sameh, Ahmed H."]},{"key":"dc:creator","label":"Author","values":["Berry, Michael Waitsel"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2011-05-07T12:11:32Z","10000-01-01","1991"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph.D."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Computer Science"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright 1991 Berry, Michael Waitsel"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["AAI9124383","(UMI)AAI9124383","http://hdl.handle.net/2142/19563"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["In this thesis, we develop four numerical methods for computing the singular value decomposition (SVD) of large sparse matrices on a multiprocessor architecture. We particularly consider the SVD of unstructured sparse matrices in which the number of rows may be substantially larger or smaller than the number of columns. On vector machines, considerable progress has been made over the past 10 years in developing robust algorithms for the solution of the sparse symmetric eigenvalue problem using Lanczos (with or without re-orthogonalization) and subspace iteration methods. Our intent is to extend and refine this knowledge for computing the sparse singular value decomposition on a parallel computer. We emphasize Lanczos, block-Lanczos, subspace iteration, and trace minimization methods for determining several of the largest (or smallest) singular triplets (singular values and corresponding left- and right-singular vectors) for sparse matrices arising from certain practical applications. The target architectures for implementations of such methods include the Alliant FX/80 and the Cray-2S/4128. This algorithmic research is particularly motivated by recent information-retrieval techniques in which high-rank approximations to large sparse term-document matrices are needed, and by nonlinear inverse problems arising from seismic reflection tomography applications.","Made available in DSpace on 2011-05-07T12:11:32Z (GMT). No. of bitstreams: 2 license.txt: 4922 bytes, checksum: 910b249b4beec47e7ab768910c8f966f (MD5) 9124383.pdf: 5313211 bytes, checksum: ecc0ac80fa1376a1bd7b9790cbdc300c (MD5) Previous issue date: 1991","Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by Howard Ding (hding2@illinois.edu) on 2011-05-07T14:37:53Z Item is restricted indefinitely.","Restriction data tranferred 2014-07-01T11:15:39-05:00 Original Data Group with Access UIUC Users [automated] Release Date: none Reason: ETDs are only available to UIUC Users without author permission","ETDs are only available to UIUC Users without author permission","U of I Only"]},{"key":"dc:title","label":"Title","values":["Multiprocessor sparse SVD algorithms and applications"]}]}],"canonical_facts":{"dc:contributor":["Sameh, Ahmed H."],"dc:creator":["Berry, Michael Waitsel"],"dc:date":["2011-05-07T12:11:32Z","10000-01-01","1991"],"dc:description":["In this thesis, we develop four numerical methods for computing the singular value decomposition (SVD) of large sparse matrices on a multiprocessor architecture. We particularly consider the SVD of unstructured sparse matrices in which the number of rows may be substantially larger or smaller than the number of columns. On vector machines, considerable progress has been made over the past 10 years in developing robust algorithms for the solution of the sparse symmetric eigenvalue problem using Lanczos (with or without re-orthogonalization) and subspace iteration methods. Our intent is to extend and refine this knowledge for computing the sparse singular value decomposition on a parallel computer. We emphasize Lanczos, block-Lanczos, subspace iteration, and trace minimization methods for determining several of the largest (or smallest) singular triplets (singular values and corresponding left- and right-singular vectors) for sparse matrices arising from certain practical applications. The target architectures for implementations of such methods include the Alliant FX/80 and the Cray-2S/4128. This algorithmic research is particularly motivated by recent information-retrieval techniques in which high-rank approximations to large sparse term-document matrices are needed, and by nonlinear inverse problems arising from seismic reflection tomography applications.","Made available in DSpace on 2011-05-07T12:11:32Z (GMT). No. of bitstreams: 2 license.txt: 4922 bytes, checksum: 910b249b4beec47e7ab768910c8f966f (MD5) 9124383.pdf: 5313211 bytes, checksum: ecc0ac80fa1376a1bd7b9790cbdc300c (MD5) Previous issue date: 1991","Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by Howard Ding (hding2@illinois.edu) on 2011-05-07T14:37:53Z Item is restricted indefinitely.","Restriction data tranferred 2014-07-01T11:15:39-05:00 Original Data Group with Access UIUC Users [automated] Release Date: none Reason: ETDs are only available to UIUC Users without author permission","ETDs are only available to UIUC Users without author permission","U of I Only"],"dc:identifier":["AAI9124383","(UMI)AAI9124383","http://hdl.handle.net/2142/19563"],"dc:language":["eng"],"dc:rights":["Copyright 1991 Berry, Michael Waitsel"],"dc:subject":["Computer Science"],"dc:title":["Multiprocessor sparse SVD algorithms and applications"],"dc:type":["text"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Ph.D."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:25:14Z"}