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.
Type de document :
Article dans une revue
SIAM Journal on Scientific Computing, Society for Industrial and Applied Mathematics, 2015, 37 (2), pp.C268-C284. 〈10.1137/120902616〉
Liste complète des métadonnées

https://hal.inria.fr/hal-01237166
Contributeur : Equipe Roma <>
Soumis le : mercredi 2 décembre 2015 - 18:53:25
Dernière modification le : mardi 16 janvier 2018 - 16:10:51

Identifiants

Collections

Citation

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〉

Partager

Métriques

Consultations de la notice

106