{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/66452"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/66452","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"On Solving the Large Sparse Generalized Eigenvalue Problem","abstract":"This thesis presents an algorithm for solving the large sparse generalized eigenvalue problem Ax = (lamda)Bx. The matrices A and B are assumed to be symmetric, and haphazardly sparse, with B being positive definite. The problem is treated from a constrained optimization approach and an inverse iteration is developed which requires the solution of linear algebraic systems only to the accuracy demanded by a given subspace. The convergence of the method is discussed, and the rate of convergence is improved by using shifting with the Ritz approximations. Numerical results are presented, and aspects concerning an implementation on a parallel computer are discussed.","abstract_html":"This thesis presents an algorithm for solving the large sparse generalized eigenvalue problem Ax = (lamda)Bx. The matrices A and B are assumed to be symmetric, and haphazardly sparse, with B being positive definite. The problem is treated from a constrained optimization approach and an inverse iteration is developed which requires the solution of linear algebraic systems only to the accuracy demanded by a given subspace. The convergence of the method is discussed, and the rate of convergence is improved by using shifting with the Ritz approximations. Numerical results are presented, and aspects concerning an implementation on a parallel computer are discussed.","abstract_has_math":false,"creators":["Wisniewski, John Aruthur"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2014,"date_issued":"2014-12-13T18:02:22Z","date_published":"2014-12-13T18:02:22Z","updated_at":"2026-07-22T22:25:56Z","subjects":["Computer Science"],"languages":["eng"],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["(UMI)AAI8114504"],"render_values":[{"text":"(UMI)AAI8114504","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/66452","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Wisniewski, John Aruthur"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2014-12-13T18:02:22Z","10000-01-01","1981"]},{"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"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/66452","(UMI)AAI8114504"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["This thesis presents an algorithm for solving the large sparse generalized eigenvalue problem Ax = (lamda)Bx. The matrices A and B are assumed to be symmetric, and haphazardly sparse, with B being positive definite. The problem is treated from a constrained optimization approach and an inverse iteration is developed which requires the solution of linear algebraic systems only to the accuracy demanded by a given subspace. The convergence of the method is discussed, and the rate of convergence is improved by using shifting with the Ritz approximations. Numerical results are presented, and aspects concerning an implementation on a parallel computer are discussed.","Made available in DSpace on 2014-12-13T18:02:22Z (GMT). No. of bitstreams: 1 8114504.pdf: 3950119 bytes, checksum: ebc4d2dc69822931c89dd31ceff5953f (MD5) Previous issue date: 1981","Embargo set by: Seth Robbins for item 66630 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","145 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1981."]},{"key":"dc:title","label":"Title","values":["On Solving the Large Sparse Generalized Eigenvalue Problem"]}]}],"canonical_facts":{"dc:creator":["Wisniewski, John Aruthur"],"dc:date":["2014-12-13T18:02:22Z","10000-01-01","1981"],"dc:description":["This thesis presents an algorithm for solving the large sparse generalized eigenvalue problem Ax = (lamda)Bx. The matrices A and B are assumed to be symmetric, and haphazardly sparse, with B being positive definite. The problem is treated from a constrained optimization approach and an inverse iteration is developed which requires the solution of linear algebraic systems only to the accuracy demanded by a given subspace. The convergence of the method is discussed, and the rate of convergence is improved by using shifting with the Ritz approximations. Numerical results are presented, and aspects concerning an implementation on a parallel computer are discussed.","Made available in DSpace on 2014-12-13T18:02:22Z (GMT). No. of bitstreams: 1 8114504.pdf: 3950119 bytes, checksum: ebc4d2dc69822931c89dd31ceff5953f (MD5) Previous issue date: 1981","Embargo set by: Seth Robbins for item 66630 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","145 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1981."],"dc:identifier":["http://hdl.handle.net/2142/66452","(UMI)AAI8114504"],"dc:language":["eng"],"dc:subject":["Computer Science"],"dc:title":["On Solving the Large Sparse Generalized Eigenvalue Problem"],"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:56Z"}