An iterative block matrix inversion (IBMI) algorithm for symmetric positive definite matrices with applications to covariance matrices

Tools

Paterson, Ann and Pestana, Jennifer and Maini, Victorita Dolean (2025) An iterative block matrix inversion (IBMI) algorithm for symmetric positive definite matrices with applications to covariance matrices. Other. arXiv, Ithaca, NY. (https://doi.org/10.48550/arXiv.2502.06377)

[thumbnail of Paterson-etal-arXiv-2025-An-iterative-block-matrix-inversion-algorithm-for-symmetric-positive-definite-matrices]
Preview
 Text. Filename: Paterson-etal-arXiv-2025-An-iterative-block-matrix-inversion-algorithm-for-symmetric-positive-definite-matrices.pdf
Final Published Version
License: Creative Commons Attribution 4.0 logo
Download (776kB)| Preview

Abstract

Obtaining the inverse of a large symmetric positive definite matrix ∈ ℝp×p is a continual challenge across many mathematical disciplines. The computational complexity associated with direct methods can be prohibitively expensive, making it infeasible to compute the inverse. In this paper, we present a novel iterative algorithm (IBMI), which is designed to approximate the inverse of a large, dense, symmetric positive definite matrix. The matrix is first partitioned into blocks, and an iterative process using block matrix inversion is repeated until the matrix approximation reaches a satisfactory level of accuracy. We demonstrate that the two-block, non-overlapping approach converges for any positive definite matrix, while numerical results provide strong evidence that the multi-block, overlapping approach also converges for such matrices.

ORCID iDs

Paterson, Ann ORCID logoORCID: https://orcid.org/0009-0004-9144-3997, Pestana, Jennifer ORCID logoORCID: https://orcid.org/0000-0003-1527-3178 and Maini, Victorita Dolean ORCID logoORCID: https://orcid.org/0000-0002-5885-1903;
CORE (COnnecting REpositories)