Parallel computation of entries of A inverse

ePubs

The open archive for STFC research publications

Persistent URL	http://purl.org/net/epubs/work/64321
Record Status	Checked
Record Id	64321
Title	Parallel computation of entries of A inverse
Contributors	PR Amestoy (Toulouse U.), IS Duff (STFC Rutherford Appleton Lab.), J-Y L'Excellent (Lyon U.), F-H Rouet (LBNL)
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. Entries are e ciently 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 e ciency are two contrasting objectives. We develop an e cient approach and show its e cacy by runs using the MUMPS code that implements a parallel multifrontal method.
Organisation	STFC , SCI-COMP
Keywords	sparse matrices , sparse inverse entries , variances and covariances , multifrontal methods
Funding Information
Related Research Object(s):
Licence Information:
Language	English (EN)

Type	Details	URI(s)	Local file(s)	Year
Report	RAL Preprints RAL-P-2012-008. 2012.		RAL-P-2012-008.pdf	2012