Families of algorithms related to the inversion of a Symmetric Positive Definite matrix

Publisher Website
Google Scholar
Abstract
We study the high-performance implementation of the inversion of a Symmetric Positive Definite (SPD) matrix on architectures ranging from sequential processors to Symmetric MultiProcessors to distributed memory parallel computers. This inversion is traditionally accomplished in three “sweeps”: a Cholesky factorization of the SPD matrix, the inversion of the resulting triangular matrix, and finally the multiplication of the inverted triangular matrix by its own transpose. We state different algorithms for each of these sweeps as well as algorithms that compute the result in a single sweep. One algorithm outperforms the current ScaLAPACK implementation by 20-30 percent due to improved load-balance on a distributed memory architecture.
Funding Information
  • Division of Computing and Communication Foundations (CCF-0342369ACI-0305163)
  • Advanced Cyberinfrastructure (CCF-0342369ACI-0305163)

This publication has 18 references indexed in Scilit: