On the use of iterative methods and blocking for solving sparse triangular systems in incomplete factorization preconditioning

ePubs

The open archive for STFC research publications

Persistent URL	http://purl.org/net/epubs/work/24499513
Record Status	Checked
Record Id	24499513
Title	On the use of iterative methods and blocking for solving sparse triangular systems in incomplete factorization preconditioning
Contributors	E Chow (Georgia Institute of Technology), JA Scott (STFC Rutherford Appleton Lab.)
Abstract	When using incomplete factorization preconditioners with an iterative method to solve large sparse linear systems, each application of the preconditioner involves solving two sparse triangular systems. These triangular systems are challenging to solve efficiently on computers with high levels of concurrency. On such computers, it has recently been proposed to use Jacobi iterations to solve the triangular systems from incomplete factorizations. These Jacobi iterations may not always converge, or converge quickly enough, for all problems. Thus in this paper we investigate the range of problems for which this approach is effective. We also show that by using block Jacobi relaxation, we can extend the range of problems for which such an approach can be effective.
Organisation	STFC , SCI-COMP , SCI-COMP-CM
Keywords	iterative solvers , preconditioning , triangular solves , sparse linear systems
Funding Information
Related Research Object(s):
Licence Information:
Language	English (EN)

Type	Details	URI(s)	Local file(s)	Year
Preprint	RAL Preprints RAL-P-2016-006, SIAM J Sci Comput 2016.		RAL-P-2016-006.pdf	2016