Back to search

University of Strathclyde

Iterative methods for symmetric positive definite matrices with applications to covariance matrices

Abstract

dc:description.abstract

Obtaining the inverse of, and solving linear systems involving, a large symmetric positive definite matrix A ? R p×p is a continual challenge across many mathematical disciplines. Direct methods of obtaining the inverse of a symmetric positive definite matrix can be computationally expensive, making it infeasible to calculate the entire inverse for large matrices. In this thesis we present a novel iterative block matrix inversion (IBMI) algorithm, which is designed to approximate the inverse of a large, dense, symmetric positive definite matrix. We partition the matrix A into blocks and use an iterative process involving block matrix inversion to update our approximation until it reaches a satisfactory level of accuracy. Forthe two-block non-overlapping approach, we show that the IBMI algorithm will always converge given any symmetric positive definite matrix. Additionally, in this thesis, we present two novel preconditioners which can be used with the preconditioned conjugate gradient (PCG) method to solve large positive definite linear systems. Both preconditioners are described in detail, beginning with the block diagonal IBMI preconditioner. After preliminary numerical experiments, we then introduce the IBMI hierarchically off-diagonal low rank (HODLR) preconditioner. We show that the IBMI HODLR preconditioner can perform better than state-of-the-art preconditioners, such as Block Jacobi and incomplete Cholesky, for various problems. Finally, we describe how both the IBMI algorithm, and the preconditioners derived from it, can be applied to any large symmetric positive definite matrix.

Degree

thesis:*
Name dc:type.qualificationname
phd
Level dc:type.qualificationlevel
doctoral-pg
Grantor dc:publisher.institution
University of Strathclyde
Year dc:date.issued
2026

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Paterson, Ann
Advisors dc:contributor.advisor
  • Pestana, Jennifer
  • Dolean, Victorita
Author Identifier dc:creator.authoridentifier
  • 202287929

Rights

Identifiers

dc:identifier.*
Identifier
T18033

Chain of custody

source
Harvested from
University of Strathclyde
Base URL
stax.strath.ac.uk/catalog/oai
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
related terms
citation

Paterson, Ann. Iterative methods for symmetric positive definite matrices with applications to covariance matrices. doctoral-pg thesis, University of Strathclyde, 2026. https://stax.strath.ac.uk/concern/theses/2b88qc72t