You are here: MIMS > EPrints
MIMS EPrints

## 2015.112: Bounds for the Distance to the Nearest Correlation Matrix

2015.112: Nicholas J. Higham and Nataša Strabić (2016) Bounds for the Distance to the Nearest Correlation Matrix. SIAM Journal on Matrix Analysis and Applications, 37 (3). pp. 1088-1102. ISSN 1095-7162

Full text available as:

 PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader214 Kb

## Abstract

In a wide range of practical problems correlation matrices are formed in such a way that, while symmetry and a unit diagonal are assured, they may lack semidefiniteness. We derive a variety of new upper bounds for the distance from an arbitrary symmetric matrix to the nearest correlation matrix. The bounds are of two main classes: those based on the eigensystem and those based on a modified Cholesky factorization. Bounds from both classes have a computational cost of $O(n^3)$ flops for a matrix of order $n$ but are much less expensive to evaluate than the nearest correlation matrix itself. For unit diagonal $A$ with $|a_{ij}|\le 1$ for all $i\ne j$ the eigensystem bounds are shown to overestimate the distance by a factor at most $1+n\sqrt{n}$. We show that for a collection of matrices from the literature and from practical applications the eigensystem-based bounds are often good order of magnitude estimates of the actual distance; indeed the best upper bound is never more than a factor $5$ larger than a related lower bound. The modified Cholesky bounds are less sharp but also less expensive, and they provide an efficient way to test for definiteness of the putative correlation matrix. Both classes of bounds enable a user to identify an invalid correlation matrix relatively cheaply and to decide whether to revisit its construction or to compute a replacement, such as the nearest correlation matrix.

Item Type: Article correlation matrix, distance to the nearest correlation matrix, indefinite matrix, positive semidefinite matrix, shrinking, modified Cholesky factorization MSC 2000 > 15 Linear and multilinear algebra; matrix theoryMSC 2000 > 65 Numerical analysis 2015.112 Nick Higham 22 August 2016

### Available Versions of this Item

• Bounds for the Distance to the Nearest Correlation Matrix (deposited 22 August 2016) [Currently Displayed]