Polynomial preconditioners based on factorized sparse approximate inverses
Applied Mathematics and Computation
Preconditioning techniques for large linear systems: a survey
Journal of Computational Physics
The effect of orderings on sparse approximate inverse preconditioners for non-symmetric problems
Advances in Engineering Software - Engineering computational technology
Preconditioner updates applied to CFD model problems
Applied Numerical Mathematics
Numerical study on incomplete orthogonal factorization preconditioners
Journal of Computational and Applied Mathematics
A comparison of projective and direct solvers for finite elements in elastostatics
Advances in Engineering Software
| Hi-index | 0.01 |
The influence of reorderings on the performance of factorized sparse approximate inverse preconditioners is considered. Some theoretical results on the effect of orderings on the fill-in and decay behavior of the inverse factors of a sparse matrix are presented. It is shown experimentally that certain reorderings, like minimum degree and nested dissection, can be very beneficial. The benefit consists of a reduction in the storage and time required for constructing the preconditioner, and of faster convergence of the preconditioned iteration in many cases of practical interest.