The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Eigenvalues and Condition Numbers of Random Matrices
Open accessAbstract
Given a random matrix, what condition number should be expected? This paper presents a proof that for real or complex $n \times n$ matrices with elements from a standard normal distribution, the expected value of the log of the 2-norm condition number is asymptotic to $\log n$ as $n \to \infty$. In fact, it is roughly $\log n + 1.537$ for real matrices and $\log n + 0.982$ for complex matrices as $n \to \infty$. The paper discusses how the distributions of the condition numbers behave for large n for real or complex and square or rectangular matrices. The exact distributions of the condition numbers of $2 \times n$ matrices are also given. Intimately related to this problem is the distribution of the eigenvalues of Wishart matrices. This paper studies in depth the largest and smallest eigenvalues, giving exact distributions in some cases. It also describes the behavior of all the eigenvalues, giving an exact formula for the expected characteristic polynomial.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Handbook of Mathematical Functions
(2018) · A Century of Excellence in MEASUREMENTS, STANDARDS, and TECHNOLOGY · doi:10.1201/9781351069397-39 · Cited by 9,062
Table of Integrals, Series, and Products
S., D., Gradshteyn, I. S., & Ryzhik, I. M. (1966) · Mathematics of Computation · doi:10.2307/2003554 · Cited by 8,092
PE, & Billingsley, P. (1996) · Journal of the American Statistical Association · doi:10.2307/2291440 · Cited by 6,481
Advanced Mathematical Methods for Scientists and Engineers I
Bender, C. M., & Orszag, S. A. (1999) · doi:10.1007/978-1-4757-3069-2 · Cited by 4,906
Szegő, G. (1939) · Colloquium Publications · doi:10.1090/coll/023 · Cited by 2,110
DISTRIBUTION OF EIGENVALUES FOR SOME SETS OF RANDOM MATRICES
Marčenko, V. A., & Pastur, L. A. (1967) · Mathematics of the USSR-Sbornik · doi:10.1070/sm1967v001n04abeh001994 · Cited by 1,713
Distributions of Matrix Variates and Latent Roots Derived from Normal Samples
James, A. T. (1964) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177703550 · Cited by 1,374
Bingham, N. H., & Billingsley, P. (1980) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2982142 · Cited by 455
Whittle, P., & Wilks, S. S. (1963) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2982451 · Cited by 444
A Limit Theorem for the Norm of Random Matrices
Geman, S. (1980) · The Annals of Probability · doi:10.1214/aop/1176994775 · Cited by 419
Cited by
On Limits of Wireless Communications in a Fading Environment when Using Multiple Antennas
Foschini, G. J., & Gans, M. J. (1998) · Wireless Personal Communications · doi:10.1023/a:1008889222784 · Cited by 10,091
Halko, N., Martinsson, P. G., & Tropp, J. A. (2011) · SIAM Review · doi:10.1137/090771806 · Cited by 4,002
Analysis of Discrete Ill-Posed Problems by Means of the L-Curve
Hansen, P. C. (1992) · SIAM Review · doi:10.1137/1034115 · Cited by 3,903
The university of Florida sparse matrix collection
Davis, T. A., & Hu, Y. (2011) · ACM Transactions on Mathematical Software · doi:10.1145/2049662.2049663 · Cited by 3,630
On the achievable throughput of a multiantenna Gaussian broadcast channel
Caire, G., & Shamai, S. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2003.813523 · Cited by 2,527
Donoho, D. L. (2006) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.20132 · Cited by 2,490
From theory to practice: an overview of MIMO space-time coded wireless systems
Gesbert, D., Shafi, M., Shiu, D.-S., Smith, P. J., & Naguib, A. (2003) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2003.809458 · Cited by 2,295
Random Matrix Theory and Wireless Communications
Tulino, A. M., & Verdú, S. (2004) · Foundations and Trends™ in Communications and Information Theory · doi:10.1561/0100000001 · Cited by 2,034
On the distribution of the largest eigenvalue in principal components analysis
Johnstone, I. M. (2001) · The Annals of Statistics · doi:10.1214/aos/1009210544 · Cited by 1,949
Fading channels: information-theoretic and communications aspects
Biglieri, E., Proakis, J., & Shamai, S. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.720551 · Cited by 1,931
Delage, E., & Ye, Y. (2010) · Operations Research · doi:10.1287/opre.1090.0741 · Cited by 1,893
Peel, C. B., Hochwald, B. M., & Swindlehurst, A. L. (2005) · IEEE Transactions on Communications · doi:10.1109/tcomm.2004.840638 · Cited by 1,721
Grassmannian beamforming for multiple-input multiple-output wireless systems
Love, D. J., Heath, R. W., & Strohmer, T. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2003.817466 · Cited by 1,505
Capacity of a mobile multiple-antenna communication link in Rayleigh flat fading
Marzetta, T. L., & Hochwald, B. M. (1999) · IEEE Transactions on Information Theory · doi:10.1109/18.746779 · Cited by 1,348
Kernel Regression for Image Processing and Reconstruction
Takeda, H., Farsiu, S., & Milanfar, P. (2007) · IEEE Transactions on Image Processing · doi:10.1109/tip.2006.888330 · Cited by 1,340
Noise Dressing of Financial Correlation Matrices
Laloux, L., Cizeau, P., Bouchaud, J.-P., & Potters, M. (1999) · Physical Review Letters · doi:10.1103/physrevlett.83.1467 · Cited by 1,241
Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
Hale, E. T., Yin, W., & Zhang, Y. (2008) · SIAM Journal on Optimization · doi:10.1137/070698920 · Cited by 909
A Randomized Kaczmarz Algorithm with Exponential Convergence
Strohmer, T., & Vershynin, R. (2009) · Journal of Fourier Analysis and Applications · doi:10.1007/s00041-008-9030-4 · Cited by 903
Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time
Spielman, D. A., & Teng, S.-H. (2004) · Journal of the ACM · doi:10.1145/990308.990310 · Cited by 825
Capacity and power allocation for fading MIMO channels with channel estimation error
Yoo, T., & Goldsmith, A. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.872984 · Cited by 796
Donoho, D. L. (2006) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.20131 · Cited by 634
Quasi-Static Multiple-Antenna Fading Channels at Finite Blocklength
Yang, W., Durisi, G., Koch, T., & Polyanskiy, Y. (2014) · IEEE Transactions on Information Theory · doi:10.1109/tit.2014.2318726 · Cited by 609
Edelman, A., & Rao, N. R. (2005) · Acta Numerica · doi:10.1017/s0962492904000236 · Cited by 526
Self-citationThe spectrum edge of random matrix ensembles
Forrester, P. J. (1993) · Nuclear Physics B · doi:10.1016/0550-3213(93)90126-a · Cited by 517
Random matrices: Universality of ESDs and the circular law
Tao, T., Vu, V., & Krishnapur, M. (2010) · The Annals of Probability · doi:10.1214/10-aop534 · Cited by 415
Ultrafast consensus in small-world networks
Olfati-Saber, R. (2005) · Proceedings of the 2005, American Control Conference, 2005. · doi:10.1109/acc.2005.1470321 · Cited by 384
Automatic Parameter Selection for Denoising Algorithms Using a No-Reference Measure of Image Content
Zhu, X., & Milanfar, P. (2010) · IEEE Transactions on Image Processing · doi:10.1109/tip.2010.2052820 · Cited by 383
How many zeros of a random polynomial are real?
Edelman, A., & Kostlan, E. (1995) · Bulletin of the American Mathematical Society · doi:10.1090/s0273-0979-1995-00571-9 · Cited by 381
Self-citationFredholm determinants, differential equations and matrix models
Tracy, C. A., & Widom, H. (1994) · Communications in Mathematical Physics · doi:10.1007/bf02101734 · Cited by 354
The Littlewood–Offord problem and invertibility of random matrices
Rudelson, M., & Vershynin, R. (2008) · Advances in Mathematics · doi:10.1016/j.aim.2008.01.010 · Cited by 322
Compressed-Sensing MRI With Random Encoding
Haldar, J. P., Hernando, D., & Liang, Z.-P. (2011) · IEEE Transactions on Medical Imaging · doi:10.1109/tmi.2010.2085084 · Cited by 308
Randomized numerical linear algebra: Foundations and algorithms
Martinsson, P.-G., & Tropp, J. A. (2020) · Acta Numerica · doi:10.1017/s0962492920000021 · Cited by 300
Non-asymptotic Theory of Random Matrices: Extreme Singular Values
Rudelson, M., & Vershynin, R. (2011) · Proceedings of the International Congress of Mathematicians 2010 (ICM 2010) · doi:10.1142/9789814324359_0111 · Cited by 296
Harmless interpolation of noisy data in regression
Muthukumar, V., Vodrahalli, K., & Sahai, A. (2019) · 2019 IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2019.8849614 · Cited by 162
Totally Destructive Many-Particle Interference
Dittel, C., Dufour, G., Walschaers, M., Weihs, G., Buchleitner, A., & Keil, R. (2018) · Physical Review Letters · doi:10.1103/physrevlett.120.240404 · Cited by 46
Metadata
- Authors
- Edelman, A.
- Venue
- SIAM Journal on Matrix Analysis and Applications
- Published
- 1988-10
- Volume
- 9
- Issue
- 4
- Pages
- 543-560
- ISSN
- 0895-4798 (ISSN-L)
- 1095-7162
- OpenAlex
- W1974755392
- Cited by
- 1,284
- References
- 14
- FWCI
- 3.95
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.