Performance analysis of a pairwise method for partial inversion of complex block tridiagonal matrices. (2nd October 2018)

• Record Type: Journal Article
• Authors: Spellacy, Louise; Golden, Darach; Rungger, Ivan
• Other Names: Wyrzykowski Roman guestEditor.; Szymanski Boleslaw guestEditor.; Pan Lei guestEditor.; Zhang Jun guestEditor.; Oliver Jonathan guestEditor.
• Is Part Of: Concurrency and computation. Volume 31:Number 19(2019)
• Page Start: n/a
• Page End: n/a
• Publication Date: 2018-10-02
• Subjects: inversion -- matrix -- non‐Hermitian -- parallel -- quantum transport -- sparse -- tridiagonal; Parallel processing (Electronic computers) -- Periodicals; Parallel computers -- Periodicals; 004.35
• DOI: 10.1002/cpe.4918
• Languages: English
• ISSNs: 1532-0626

Abstract

Summary: The algorithm detailed below extends previous work on inversion of block tridiagonal matrices from the Hermitian/symmetric case to the general case and allows for varying sub‐block sizes. The sub‐blocks of the matrix are evenly distributed across p processes. Local sub‐blocks are combined to form a matrix on each process. These matrices are inverted locally and the inverses are combined in a pairwise manner. At each combination step, the updates to the global inverse are represented by updating "matrix maps" on each process. The matrix maps are finally applied to the original local inverse to retrieve the block tridiagonal elements of the global inverse. This algorithm has been implemented in Fortran with MPI. Calculated inverses are compared with inverses obtained using the well known libraries ScaLAPACK and MUMPS. Results are given for matrices arising from Density Functional Theory applications.