Virginia Tech
Preconditioned iterative methods for highly sparse, nonsymmetric, unstructured linear algebra problems
Abstract
dc:description.abstractA number of significant problems require the solution of a system of linear equations Ax = b in which A is large, highly sparse, nonsymmetric, and unstructured. Several iterative methods which are applicable to nonsymmetric and indefinite problems are applied to a suite of test problems derived from simulations of actual bipolar circuits and to a viscous flow problem. Methods tested include Craig’s method, GMRES(k), BiCGSTAB, QMR, KACZ (a row-projection method) and LSQR. The convergence rates of these methods may be improved by use of a suitable preconditioner. Several such techniques are considered, including incomplete LU factorization (ILU), sparse submatrix ILU, and ILU allowing restricted fill in bands or blocks. Timings and convergence statistics are given for each iterative method and preconditioner.
Degree
thesis:*- Name thesis:degree_name
- Master of Science
- Level thesis:degree_level
- masters
- Discipline thesis:degree_discipline
- Computer Science and Applications
- Department dc:contributor.department
- Computer Science and Applications
- Grantor dc:publisher
- Virginia Tech
- Year dc:date.issued
- 1992
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- McQuain, William D.
Rights
dc:rights- Statement dc:rights
-
- In Copyright
- Licence dc:rights.uri
- Language dc:language.iso
- en
Identifiers
dc:identifier.*- Dc Identifier Other
- etd-09052009-040457
- OAI identifier oai:identifier
- oai:vtechworks.lib.vt.edu:10919/44561