Fault tolerant variants of the fine-grained parallel incomplete LU factorization

Abstract

This paper presents an investigation into fault tolerance for the fine-grained parallel algorithm for computing an incomplete LU factorization. Results concerning the convergence of the algorithm with respect to the occurrence of faults, and the impact of any sub-optimality in the produced incomplete factors in Krylov subspace solvers are given. Numerical… (More)

4 Figures and Tables

Topics

  • Presentations referencing similar topics