Abstract de la publi numéro 12583

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.