Tails of Condition Number Distributions
From MaRDI portal
Publication:5470477
DOI10.1137/040614256zbMath1093.15010OpenAlexW2091849156MaRDI QIDQ5470477
Publication date: 31 May 2006
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/040614256
asymptoticscondition numberrandom matrixsingular valuesextreme eigenvaluesWishart matrixTracy-Widom largest value distribution
Related Items
Numerically safe Gaussian elimination with no pivoting, Weighted Condition Number Distributions Emanating from Complex Noncentral Wishart Type Matrices, New studies of randomized augmentation and additive preprocessing, On the Condition Number of the Shifted Real Ginibre Ensemble, Fast linear homotopy to find approximate zeros of polynomial systems, Computational complexity of kernel-based density-ratio estimation: a condition number analysis, The average condition number of most tensor rank decomposition problems is infinite, Solving linear systems of equations with randomization, augmentation and aggregation, Model Reduction for Transport-Dominated Problems via Online Adaptive Bases and Adaptive Sampling, The conjugate gradient algorithm on well-conditioned Wishart matrices is almost deterministic, Low-Rank Approximation of a Matrix: Novel Insights, New Progress, and Extensions, The efficient evaluation of the hypergeometric function of a matrix argument, Distribution of the largest eigenvalue for real Wishart and Gaussian random matrices and a simple approximation for the Tracy-Widom distribution, Estimating the norms of random circulant and Toeplitz matrices and their inverses, A randomized Kaczmarz algorithm with exponential convergence, Smallest singular value of a random rectangular matrix, Accurate and efficient evaluation of Schur and Jack functions, The asymptotic distribution of the condition number for random circulant matrices, Large-deviation asymptotics of condition numbers of random matrices, Sublinear Cost Low Rank Approximation via Subspace Sampling, Random multipliers numerically stabilize Gaussian and block Gaussian elimination: proofs and an extension to low-rank approximation
