1. THE USE OF SUPERNODES IN FACTORED SPARSE APPROXIMATE INVERSE PRECONDITIONING.
- Author
-
JANNA, CARLO, FERRONATO, MASSIMILIANO, and GAMBOLATI, GIUSEPPE
- Subjects
- *
SUPERCOMPUTERS , *ITERATIVE methods (Mathematics) , *APPROXIMATION theory , *FACTORIZATION , *NUMERICAL analysis - Abstract
In recent years the growing popularity of supercomputers has fostered the development of algorithms able to take advantage of the massive parallelism offered by multiple processors. Direct methods, though robust and computationally efficient, hardly exploit high degrees of parallelism. By contrast, Krylov methods preconditioned by Factored Sparse Approximate Inverses (FSAI) provide, at least in principle, a perfectly parallel approach but are often thwarted by an excessive set-up cost. In this paper we extend the concept of supernode from sparse LU factorizations to approximate inverses, and use it to accelerate the computation of an FSAI-type preconditioner. The numerical experiments on real-world problems show that the overall FSAI efficiency can be significantly increased while preserving its intrinsic parallelism. [ABSTRACT FROM AUTHOR]
- Published
- 2015
- Full Text
- View/download PDF