Bibliographic Details
| Title: |
CROUT VERSIONS OF ILU FOR GENERAL SPARSE MATRICES. |
| Authors: |
Li, Na1 nli@cs.umn.edu, Saad, Yousef2 saad@cs.umn.edu, Chow, Edmond echow@llnl.gov |
| Source: |
SIAM Journal on Scientific Computing. 2003, Vol. 25 Issue 2, p716-728. 13p. |
| Subjects: |
Factorization of operators, Algorithms, Iterative methods (Mathematics), Sparse matrices, Linear systems |
| Abstract: |
This paper presents an efficient implementation of the incomplete LU (ILU) factorization derived from the Crout version of Gaussian elimination. At step k of the elimination, the kth row of U and the kth column of L are computed using previously computed rows of U and columns of L. The data structure and implementation borrow from already known techniques used in developing both sparse direct solution codes and incomplete Cholesky factorizations. This version of ILU can be computed much faster than standard threshold-based ILU factorizations computed rowwise or columnwise. In addition, the data structure allows efficient implementations of more rigorous and effective dropping strategies. [ABSTRACT FROM AUTHOR] |
|
Copyright of SIAM Journal on Scientific Computing is the property of Society for Industrial & Applied Mathematics and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
