@article {1158,
title = {Incomplete Sparse Approximate Inverses for Parallel Preconditioning},
journal = {Parallel Computing},
volume = {71},
year = {2018},
month = {01-2018},
pages = {1{\textendash}22},
abstract = {In this paper, we propose a new preconditioning method that can be seen as a generalization of block-Jacobi methods, or as a simplification of the sparse approximate inverse (SAI) preconditioners. The {\textquotedblleft}Incomplete Sparse Approximate Inverses{\textquotedblright} (ISAI) is in particular efficient in the solution of sparse triangular linear systems of equations. Those arise, for example, in the context of incomplete factorization preconditioning. ISAI preconditioners can be generated via an algorithm providing fine-grained parallelism, which makes them attractive for hardware with a high concurrency level. In a study covering a large number of matrices, we identify the ISAI preconditioner as an attractive alternative to exact triangular solves in the context of incomplete factorization preconditioning.},
issn = {01678191},
doi = {10.1016/j.parco.2017.10.003},
url = {http://www.sciencedirect.com/science/article/pii/S016781911730176X},
author = {Hartwig Anzt and Thomas Huckle and J{\"u}rgen Br{\"a}ckle and Jack Dongarra}
}
@inproceedings {991,
title = {Batched Generation of Incomplete Sparse Approximate Inverses on GPUs},
journal = {Proceedings of the 7th Workshop on Latest Advances in Scalable Algorithms for Large-Scale Systems},
year = {2016},
month = {11-2016},
pages = {49{\textendash}56},
abstract = {Incomplete Sparse Approximate Inverses (ISAI) have recently been shown to be an attractive alternative to exact sparse triangular solves in the context of incomplete factorization preconditioning. In this paper we propose a batched GPU-kernel for the efficient generation of ISAI matrices. Utilizing only thread-local memory allows for computing the ISAI matrix with very small memory footprint. We demonstrate that this strategy is faster than the existing strategy for generating ISAI matrices, and use a large number of test matrices to assess the algorithm{\textquoteright}s efficiency in an iterative solver setting.},
isbn = {978-1-5090-5222-6},
doi = {10.1109/ScalA.2016.11},
author = {Hartwig Anzt and Edmond Chow and Thomas Huckle and Jack Dongarra}
}