Skip to Main content Skip to Navigation
Reports

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.
Complete list of metadatas

Cited literature [16 references]  Display  Hide  Download

https://hal.inria.fr/hal-00759556
Contributor : Jean-Yves l'Excellent <>
Submitted on : Friday, December 21, 2012 - 11:55:14 AM
Last modification on : Monday, September 21, 2020 - 11:34:08 AM
Long-term archiving on: : Friday, March 22, 2013 - 3:47:19 AM

File

RR-8142.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00759556, version 2

Citation

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⟩

Share

Metrics

Record views

503

Files downloads

1420