ACM Transactions on Mathematical Software (TOMS)
Factorized sparse approximate inverse preconditionings I: theory
SIAM Journal on Matrix Analysis and Applications
Multisplitting Preconditioners Based on Incomplete CholeskiFactorizations
SIAM Journal on Matrix Analysis and Applications
A Sparse Approximate Inverse Preconditioner for the Conjugate Gradient Method
SIAM Journal on Scientific Computing
A comparative study of sparse approximate inverse preconditioners
IMACS'97 Proceedings on the on Iterative methods and preconditioners
Orderings for Factorized Sparse Approximate Inverse Preconditioners
SIAM Journal on Scientific Computing
Application of Threshold Partitioning of Sparse Matrices to Markov Chains
IPDS '96 Proceedings of the 2nd International Computer Performance and Dependability Symposium (IPDS '96)
MPI: A Message-Passing Interface Standard
MPI: A Message-Passing Interface Standard
Hi-index | 0.48 |
Let Ax = b be a linear system where A is a symmetric positive definite matrix. An additive polynomial preconditioner for the Conjugate Gradient method based on multisplittings is proposed. The multisplittings are obtained by computing some factorized sparse approximate inverses of the coefficient matrix. Namely, splittings of the form A = (ZZT)-1 -N, ZZT ≈ A-1 induced by the AINV and FSAI factorized approximate inverse preconditioners applied to diagonal blocks of A are used. The applicability of this preconditioner is studied. Moreover, the results of the numerical experiments obtained on a Cray T3E for a representative set of matrices are presented. Specifically, structural analysis and transport/diffusion problems are considered. The effect of the Reverse Cuthill-McKee (RCM) and Multiple Minimum Degree (MMD) orderings is evaluated.