|Title:|| A PARALLELIZABLE
PRECONDITIONER FOR THE SOLUTION OF SPARSE LINEAR SYSTEMS.
|Authors:|| Y. Shapira, A. Sidi and M. Israeli
An algebraic condition ensuring stability of the ILU (1,1) decomposition of sparse matrices is given. A stability and convergence theory for some multi-dimensional recursions that are relevant to the ILU preconditioning method for the solution of sparse linear systems is presented. Relying on this theory, a parallelizable truncated ILU (PTILU) preconditioning method is developed. Numerical experiments show that for grids of size up to 160 \times 160, with 8 \times 8 subdomains, the amount of arithmetic operations of PTILU is very similar to that of standard ILU, no more than 3 times larger when implemented as a modification of Row-Sum ILU (RSILU) and no more that twice larger when implemented as a modification of Alternating Direction Implicit (ADI) methods. In addition, PTILU is applicable as a smoother in multigrid methods.
|Copyright||The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information|
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1994/CS/CS0799), rather than to the URL of the PDF files directly. The latter URLs may change without notice.
To the list of the CS technical reports of 1994
To the main CS technical reports page
Computer science department, Technion