Parallel computation of entries in A-1 - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles SIAM Journal on Scientific Computing Year : 2015

Parallel computation of entries in A-1


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.

Dates and versions

hal-01237166 , version 1 (02-12-2015)



Patrick Amestoy, Iain S. Duff, Jean-Yves L'Excellent, François-Henry Rouet. Parallel computation of entries in A-1. SIAM Journal on Scientific Computing, 2015, 37 (2), pp.C268-C284. ⟨10.1137/120902616⟩. ⟨hal-01237166⟩
97 View
0 Download



Gmail Facebook X LinkedIn More