Factorized sparse approximate inverse preconditioning for singular M-matrices
Abstract
Here we consider the factorized sparse approximate inverse (FSAI) preconditioner. We apply the FSAI preconditioner to singular irreducible M-matrices. These matrices arise e.g. in discrete Markov chain modeling or as graph Laplacians. We show, that there are some restrictions on the nonzero pattern needed for a stable construction of the FSAI preconditioner in this case. With these restrictions FSAI is well-defined. Moreover, we proved that the FSAI preconditioner shares some important properties with the original system. The lower triangular matrix LG and the upper triangular matrix UG, generated by FSAI, are non-singular and non-negative. The diagonal entries of LGAUG are positive and LGAUG, the preconditioned matrix, is a singular M-matrix. Even more, we establish that a (1,2)-inverse is computed for the complete nonzero patter.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.