On near and the nearest correlation matrix
From MaRDI portal
Publication:5230903
Eigenvalues, singular values, and eigenvectors (15A18) Canonical forms, reductions, classification (15A21) Positive matrices and their generalizations; cones of matrices (15B48) Measures of association (correlation, canonical correlation, etc.) (62H20) Applications of statistics to actuarial sciences and financial mathematics (62P05) Applications of statistics to physics (62P35) Numerical computation of matrix norms, conditioning, scaling (65F35)
Abstract: We present an elementary heuristic reasoning based on Arnold's theory of versal deformations in support of a straightforward algorithm for finding a correlation matrix near a given symmetric one.
Cites work
- A preconditioned Newton algorithm for the nearest correlation matrix
- An application of the nearest correlation matrix on web document classification
- scientific article; zbMATH DE number 47926 (Why is no real title available?)
- scientific article; zbMATH DE number 3349081 (Why is no real title available?)
- scientific article; zbMATH DE number 3409532 (Why is no real title available?)
- scientific article; zbMATH DE number 4185861 (Why is no real title available?)
- Matrix Algebra
- New Methods for Handling Singular Sample Covariance Matrices
- ON MATRICES DEPENDING ON PARAMETERS
- Transformation of non positive semidefinite correlation matrices
- Transformation to versal deformations of matrices
- Versal deformations of elements of classical Jordan algebras
Cited in
(4)
This page was built for publication: On near and the nearest correlation matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5230903)