DMCA
A multilevel block incomplete factorization preconditioning (1999)
Cached
Download Links
| Venue: | APPLIED NUMERICAL MATHEMATICS 31 (1999) 209–225 |
| Citations: | 3 - 1 self |
BibTeX
@MISC{Notay99amultilevel,
author = {Y. Notay},
title = { A multilevel block incomplete factorization preconditioning},
year = {1999}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Incomplete factorization preconditioners based on recursive red–black orderings have been shown efficient for discrete second order elliptic PDEs with isotropic coefficients. However, they suffer for some weakness in presence of anisotropy or grid stretching. Here we propose to combine these orderings with block incomplete factorization preconditioning techniques. For implementation considerations, the latter are extended to the case where the block pivots are generalized tridiagonal matrices, say matrices that have at most one nonzero entry per row in their strictly upper triangular part. On the other hand, a new block method is introduced for the improvement of the performance. This method is called IMBILU (improved modified block ILU). Numerical results show that the resulting preconditioner is efficient and robust with respect to both discontinuity
Keyphrases
multilevel block incomplete factorization preconditioning incomplete factorization preconditioners tridiagonal matrix numerical result isotropic coefficient recursive red black ordering discrete second order elliptic pdes block pivot block incomplete factorization grid stretching new block method triangular part block ilu nonzero entry implementation consideration
