Answers are grounded in this paper and cite their sources.
The distributions of the smallest and largest eigenvalues for the matrix product Z^ Z, where Z is an n × m complex Gaussian matrix with correlations both along rows and down columns, are expressed as m × m determinants. In the case of correlation along rows, these expressions are computationally more efficient than those involving sums over partitions and Schur polynomials reported recently for the same distributions.
No takes yet. Share an insight, caveat, or question.
Peter J. Forrester (2007) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: