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.
Type de document :
Rapport
[Research Report] RR-8142, INRIA. 2012
Liste complète des métadonnées

Littérature citée [16 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-00759556
Contributeur : Jean-Yves L'Excellent <>
Soumis le : vendredi 21 décembre 2012 - 11:55:14
Dernière modification le : mercredi 12 septembre 2018 - 17:46:04
Document(s) archivé(s) le : vendredi 22 mars 2013 - 03:47:19

Fichier

RR-8142.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00759556, version 2

Citation

Patrick R. 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〉

Partager

Métriques

Consultations de la notice

366

Téléchargements de fichiers

204