Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
485926 | Procedia Computer Science | 2015 | 10 Pages |
Abstract
Krylov methods preconditioned by Factorized Sparse Approximate Inverses (FSAI) are an efficient approach for the solution of symmetric positive definite linear systems on massively parallel computers. However, FSAI often suffers from a high set-up cost, especially in ill-conditioned problems. In this communication we propose a novel algorithm for the FSAI computation that makes use of the concept of supernode borrowed from sparse LU factorizations and direct methods.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)