Parallel computation of entries of A-1 - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2012

Parallel computation of entries of A-1


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.
Fichier principal
Vignette du fichier
RR-8142.pdf (585.22 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00759556 , version 1 (01-12-2012)
hal-00759556 , version 2 (21-12-2012)


  • 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⟩
208 View
566 Download


Gmail Facebook X LinkedIn More