Parallel computation of entries of A-1
type: Dataset
description: 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.
identifier: Report N°: RR-8142
issued: 2026-05-29T16:14:35.032299
language: en
modified: 2026-05-29T16:14:35.032310
contact point: Organization
  fn: CCSD
keyword: direct-methods
keyword: direct-solver
keyword: infoeu-reposemanticsreport
keyword: infoinfo-dccomputer-science-csdistributed-parallel-and-cluster-computing-csdc
keyword: matrix-inverse
keyword: parallelism
keyword: reports
keyword: sparse-matrices
landing page: https://inria.hal.science/hal-00759556

Parallel computation of entries of A-1
type: Distribution
format: HTML
issued: 2026-05-29T16:14:35.115111
modified: 2026-05-29T16:14:34.993880
access URL: https://inria.hal.science/hal-00759556

test_moissonnage_selune
type: Agent