Skip to Main content Skip to Navigation
New interface
Reports (Research report)

Parallel computation of entries of A-1

Abstract : In this paper, we are concerned about computing in parallel 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 efficacy by runs using the MUMPS code that implements a parallel multifrontal method.
Document type :
Reports (Research report)
Complete list of metadata

Cited literature [16 references]  Display  Hide  Download
Contributor : Jean-Yves L'Excellent Connect in order to contact the contributor
Submitted on : Friday, December 21, 2012 - 11:55:14 AM
Last modification on : Wednesday, October 26, 2022 - 8:15:58 AM
Long-term archiving on: : Friday, March 22, 2013 - 3:47:19 AM


Files produced by the author(s)


  • HAL Id : hal-00759556, version 2


Patrick Amestoy, Iain S. Duff, Jean-Yves L'Excellent, François-Henry Rouet. Parallel computation of entries of A-1. [Research Report] RR-8142, INRIA. 2012. ⟨hal-00759556v2⟩



Record views


Files downloads