Title

Parallel Computation of the Diagonal of the Inverse of a Sparse Matrix

Abstract

Abstract

We consider the parallel computation of the diagonal of the inverse of

a large sparse matrix. This problem is critical in many applications such as

quantum mechanics and uncertainty quantification, where a subset of the entries

of the inverse matrix, usually the diagonal, is required. A straightforward

approach involves inverting the matrix explicitly and extracting the diagonal of

the computed inverse. This approach, however, almost always is too costly for

large sparse matrices since the inverse is often dense. In this thesis, a novel

parallel algorithm for computing the diagonal of the inverse is developed and

its parallel scalability and numerical accuracy are compared against the

state-of-the-art algorithms using large and sparse matrices from different

applications.

Biography:

Supervisor(s)

Supervisor(s)

EDONA FASLLIJA

Date and Location

Date and Location

2017-07-21;10:00:00-A101

Category

Category

MSc_Thesis