Files in this item

FilesDescriptionFormat

application/pdf

application/pdfCARRIER-DISSERTATION-2019.pdf (5MB)
(no description provided)PDF

Description

Title:Exploiting compression in solving discretized linear systems
Author(s):Carrier, Erin Elizabeth
Director of Research:Heath, Michael T.
Doctoral Committee Chair(s):Heath, Michael T.
Doctoral Committee Member(s):Olson, Luke; Fischer, Paul; Hansen, Per Christian
Department / Program:Computer Science
Discipline:Computer Science
Degree Granting Institution:University of Illinois at Urbana-Champaign
Degree:Ph.D.
Genre:Dissertation
Subject(s):linear systems
compressed solution
compression basis
projection method
discretized linear system
regularization method
Abstract:Solving systems of linear algebraic equations is crucial for many computational problems in science and engineering. Numerous techniques are available for solving such linear systems, including direct methods such as Gaussian elimination and iterative methods such as GMRES. This thesis proposes a method for exploiting compression while computing the solution to a given discretized system of linear algebraic equations and investigates both its overall effectiveness in practice and which factors determine its effectiveness. The method is based on computing an approximate solution in a reduced space, and thus we seek a basis in which the solution has a compressed representation and can consequently be computed more efficiently. We address three primary issues: (1) how to compute an approximate solution to the given discretized linear system using a given basis, (2) how to choose a basis that yields significant compression, and (3) how to detect when the basis is of sufficient dimension to provide a satisfactory approximation. While all three aspects have antecedents in previous ideas and methods, we combine, adapt, and extend them in a manner we believe to be novel for the purpose of solving discretized linear systems. We demonstrate that the resulting method can be competitive with, and sometimes outperform, current standard methods and is effective for efficiently solving linear systems resulting from the discretization of major classes of continuous problems.
Issue Date:2019-03-05
Type:Text
URI:http://hdl.handle.net/2142/104752
Rights Information:Copyright 2019 Erin Elizabeth Carrier
Date Available in IDEALS:2019-08-23
Date Deposited:2019-05


This item appears in the following Collection(s)

Item Statistics