Higham, Nicholas J. and Strabić, Nataša (2015) Bounds for the Distance to the Nearest Correlation Matrix. [MIMS Preprint]
PDF
paper.pdf Download (357kB) 
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 eigensystembased 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:  MIMS Preprint 

Additional Information:  To appear in SIAM Journal on Matrix Analysis and Applications 
Uncontrolled Keywords:  correlation matrix, distance to the nearest correlation matrix, indefinite matrix, positive semidefinite matrix, shrinking, modified Cholesky factorization 
Subjects:  MSC 2010, the AMS's Mathematics Subject Classification > 15 Linear and multilinear algebra; matrix theory MSC 2010, the AMS's Mathematics Subject Classification > 65 Numerical analysis 
Depositing User:  Nick Higham 
Date Deposited:  11 Jun 2016 
Last Modified:  08 Nov 2017 18:18 
URI:  https://eprints.maths.manchester.ac.uk/id/eprint/2485 
Available Versions of this Item

Bounds for the Distance to the Nearest Correlation Matrix. (deposited 09 Dec 2015)

Bounds for the Distance to the Nearest Correlation Matrix. (deposited 16 Mar 2016)
 Bounds for the Distance to the Nearest Correlation Matrix. (deposited 11 Jun 2016) [Currently Displayed]

Bounds for the Distance to the Nearest Correlation Matrix. (deposited 16 Mar 2016)
Actions (login required)
View Item 