On near and the nearest correlation matrix
classification
📊 stat.AP
math.RA
keywords
correlationmatrixnearalgorithmarnolddeformationselementaryfinding
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.