IDEALS Home University of Illinois at Urbana-Champaign logo The Alma Mater The Main Quad

Incomplete factorization preconditioning for linear least squares problems

Show full item record

Bookmark or cite this item: http://hdl.handle.net/2142/20281

Files in this item

File Description Format
PDF 9416449.pdf (10MB) Restricted to U of Illinois (no description provided) PDF
Title: Incomplete factorization preconditioning for linear least squares problems
Author(s): Wang, Xiaoge
Doctoral Committee Chair(s): Gallivan, Kyle A.
Department / Program: Computer Science
Discipline: Computer Science
Degree Granting Institution: University of Illinois at Urbana-Champaign
Degree: Ph.D.
Genre: Dissertation
Subject(s): Mathematics Computer Science
Abstract: A new family of preconditioners for conjugate gradient-like iterative methods applied to large sparse linear least squares problems, $min\Vert Ax-b\Vert\sb2$, is proposed. The family is based on incomplete Gram-Schmidt (IGS) factorizations of A. Particular attention has been given to the following members of the family: Incomplete Classical Gram-Schmidt (ICGS), Incomplete Modified Gram-Schmidt (IMGS) and Compressed Incomplete Modified Gram-Schmidt (CIMGS) factorizations. The numerical properties of each of these methods have been considered as well as the relationships between the methods concerning the preservation of sparsity, computational efficiency and the quality of the preconditioner. The implementation of these methods has been investigated and all of the important family members have been coded. One of the important topics in this portion of the dissertation is the careful symbolic analysis of the production of the preconditioner and its use during the incomplete factorization phase to avoid excessive unnecessary work.We have also analyzed some of the implications of viewing the incomplete Cholesky (IC) factorization as a limit case of the IGS family. When certain conditions are imposed on the sparsity pattern of the preconditioning matrix, IC is identical to IMGS. Therefore, a sufficient condition on the sparsity pattern for a stable IC factorization can be derived. Based on this condition, two algorithms for modifying a sparsity pattern for which IC may not succeed have been designed. The altered IC method with the pattern modifications (ICPM) has been studied and its performance evaluated. These methods differ from previously proposed methods to guarantee the existence and improve the stability of the IC factorization since they do not require numerical information. Of course, for a particular matrix we can then use numerical information in addition to the pattern modification techniques to further improve the preconditioner.Numerical experiments illustrating the capabilities of the preconditioners are also presented. These include matrices from the standard Harwell-Boeing collection and various test matrices from different practical application problems.
Issue Date: 1994
Type: Text
Language: English
URI: http://hdl.handle.net/2142/20281
Rights Information: Copyright 1994 Wang, Xiaoge
Date Available in IDEALS: 2011-05-07
Identifier in Online Catalog: AAI9416449
OCLC Identifier: (UMI)AAI9416449
 

This item appears in the following Collection(s)

Show full item record

Item Statistics

  • Total Downloads: 1
  • Downloads this Month: 0
  • Downloads Today: 0

Browse

My Account

Information

Access Key