skip to main content


This content will become publicly available on October 28, 2018

Title: Incomplete Sparse Approximate Inverses for Parallel Preconditioning

In this study, 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 “Incomplete Sparse Approximate Inverses” (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. Finally, 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.
 [1] ;  [2] ;  [2] ;  [3]
  1. Karlsruhe Inst. of Technology (KIT) (Germany); Univ. of Tennessee, Knoxville, TN (United States). Innovative Computing Lab.
  2. Technical Univ. of Munich (Germany). Dept. of Informatics
  3. Univ. of Tennessee, Knoxville, TN (United States). Innovative Computing Lab.; Univ. of Manchester (United Kingdom). School of Computer Science; Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States)
Publication Date:
Grant/Contract Number:
Accepted Manuscript
Journal Name:
Parallel Computing
Additional Journal Information:
Journal Volume: 71; Journal ID: ISSN 0167-8191
Research Org:
Univ. of Tennessee, Knoxville, TN (United States)
Sponsoring Org:
USDOE Office of Science (SC), Advanced Scientific Computing Research (ASCR) (SC-21); USDOE National Nuclear Security Administration (NNSA)
Country of Publication:
United States
97 MATHEMATICS AND COMPUTING; preconditioning; incomplete sparse approximate inverse; incomplete LU factorization; approximate sparse triangular solves; parallel computing
OSTI Identifier: