Bibtex de la publication

@Unpublished{ AmDuL'RoUç2011.1,
author = {Amestoy, Patrick and Duff, Iain and L'Excellent, Jean-Yves and Rouet, François-Henry and Uçar, Bora},
title = "{Parallel computation of entries of A-1 (SIAM Workshop on Combinatorial Scientific Computing (CSC11), Darmstadt, Germany, 19/05/2011-21/05/2011)}",
year = {2011},
language = {francais},
URL = {http://amestoy.perso.enseeiht.fr/doc/CSC11.pdf},
keywords = {sparse matrices, matrix inversion, multifrontal method ,elimination tree},
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. We develop an efficient approach aimed at balancing the contrasting requirement of both parallel and computational efficiency, and show its efficacy by runs using the MUMPS code that implements a parallel multifrontal method.}
}