A New Parametrization of Correlation Matrices
提出一种新的相关矩阵参数化方法，将相关矩阵表示为无约束向量，正定性自动满足，可视为Fisher Z变换的高维推广，并给出重构算法及其复杂度。
We introduce a novel parametrization of the correlation matrix. The reparametrization facilitates modeling of correlation and covariance matrices by an unrestricted vector, where positive definiteness is an innate property. This parametrization can be viewed as a generalization of Fisher's Z ‐transformation to higher dimensions and has a wide range of potential applications. An algorithm for reconstructing the unique n × n correlation matrix from any vector in <a:math xmlns:a="http://www.w3.org/1998/Math/MathML" display="inline"> <a:msup> <a:mrow> <a:mi mathvariant="double-struck">R</a:mi> </a:mrow> <a:mrow> <a:mi>n</a:mi> <a:mo stretchy="false">(</a:mo> <a:mi>n</a:mi> <a:mo>−</a:mo> <a:mn>1</a:mn> <a:mo stretchy="false">)</a:mo> <a:mo stretchy="false">/</a:mo> <a:mn>2</a:mn> </a:mrow> </a:msup> </a:math> is provided, and we derive its numerical complexity.