In linear algebra and statistics, the pseudo-determinant[1] is the product of all non-zero eigenvalues of a square matrix.
It coincides with the regular determinant when the matrix is non-singular.
The pseudo-determinant of a square n-by-n matrix A may be defined as: where |A| denotes the usual determinant, I denotes the identity matrix and rank(A) denotes the matrix rank of A.
[2] The Vahlen matrix of a conformal transformation, the Möbius transformation (i.e.
By the pseudo-determinant of the Vahlen matrix for the conformal transformation, we mean If
, the transformation is sense-preserving (rotation) whereas if the
, the transformation is sense-preserving (reflection).
is positive semi-definite, then the singular values and eigenvalues of
In this case, if the singular value decomposition (SVD) is available, then
may be computed as the product of the non-zero singular values.
If all singular values are zero, then the pseudo-determinant is 1.
rank (
, so that k is the number of non-zero singular values, we may write
is some n-by-k matrix and the dagger is the conjugate transpose.
The singular values of
are the squares of the singular values of
is the usual determinant in k dimensions.
is written as the block column
, then it holds, for any heights of the blocks
If a statistical procedure ordinarily compares distributions in terms of the determinants of variance-covariance matrices then, in the case of singular matrices, this comparison can be undertaken by using a combination of the ranks of the matrices and their pseudo-determinants, with the matrix of higher rank being counted as "largest" and the pseudo-determinants only being used if the ranks are equal.
[3] Thus pseudo-determinants are sometime presented in the outputs of statistical programs in cases where covariance matrices are singular.
[4] In particular, the normalization for a multivariate normal distribution with a covariance matrix Σ that is not necessarily nonsingular can be written as