Skip to Main content Skip to Navigation
Journal articles

Parallel computation of entries in A-1

Abstract : In this paper, we consider the computation in parallel of several entries of the inverse of a large sparse matrix. We assume that the matrix has already been factorized by a direct method and that the factors are distributed. Entries are efficiently computed by exploiting sparsity of the right-hand sides and the solution vectors in the triangular solution phase. We demonstrate that in this setting, parallelism and computational efficiency are two contrasting objectives. We develop an efficient approach and show its efficiency on a general purpose parallel multifrontal solver.
Complete list of metadatas
Contributor : Equipe Roma <>
Submitted on : Wednesday, December 2, 2015 - 6:53:25 PM
Last modification on : Monday, September 21, 2020 - 11:34:08 AM

Links full text




Patrick R. Amestoy, Iain S. Duff, Jean-Yves l'Excellent, François-Henry Rouet. Parallel computation of entries in A-1. SIAM Journal on Scientific Computing, Society for Industrial and Applied Mathematics, 2015, 37 (2), pp.C268-C284. ⟨10.1137/120902616⟩. ⟨hal-01237166⟩



Record views