Smooth analysis of the condition number and the least singular value

DOI10.1090/S0025-5718-2010-02396-8zbMath1253.65067MaRDI QIDQ3160742

Publication date: 8 October 2010

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0025-5718-2010-02396-8

Mathematics Subject Classification ID

60B20: Random matrices (probabilistic aspects)

65F35: Numerical computation of matrix norms, conditioning, scaling

15A12: Conditioning of matrices

Related Items

Complex random matrices have no real eigenvalues, The strong circular law: A combinatorial view, A note on the universality of ESDs of inhomogeneous random matrices, Universality of the minimum modulus for random trigonometric polynomials, The probabilistic estimates on the largest and smallest $q$-singular values of random matrices, Mixed and componentwise condition numbers for matrix decompositions, Fluctuations in the spectrum of non-Hermitian i.i.d. matrices, A Deterministic Kaczmarz Algorithm for Solving Linear Systems, Central Limit Theorem for Linear Eigenvalue Statistics of <scp>Non‐Hermitian</scp> Random Matrices, Conditioning of linear systems arising from penalty methods, Universality: random matrices, random geometry and SPDEs. Abstracts from the workshop held May 29 -- June 4, 2022, On the smoothed analysis of the smallest singular value with discrete noise, Erratum to: Outliers in the spectrum of iid matrices with bounded rank perturbations, On the singularity of adjacency matrices for random regular digraphs, Random matrices: tail bounds for gaps between eigenvalues, Optimal inverse Littlewood-Offord theorems, Spectrum of non-Hermitian heavy tailed random matrices, An upper bound on the smallest singular value of a square random matrix, Random matrix products: universality and least singular values, Coverings of random ellipsoids, and invertibility of matrices with i.i.d. heavy-tailed entries, Lower bounds for the smallest singular value of structured random matrices, The method of perpendiculars of finding estimates from below for minimal singular eigenvalues of random matrices, Random matrices: overcrowding estimates for the spectrum, The smallest singular value of a shifted $d$-regular random square matrix, Eigenvectors and controllability of non-Hermitian random matrices and directed graphs, Fluctuation around the circular law for random matrices with real entries, The least singular value of the general deformed Ginibre ensemble, High dimensional normality of noisy eigenvectors, On sparse random combinatorial matrices, Almost sure Weyl law for quantized tori, The respect method. Simple proof of finding estimates from below for minimal singular eigenvalues of random matrices whose entries have zero means and bounded variances, Random matrices: universality of local spectral statistics of non-Hermitian matrices, On the concentration of random multilinear forms and the universality of random block matrices, Random matrices: law of the determinant, Random doubly stochastic matrices: the circular law, Intrinsic volumes of symmetric cones and applications in convex programming, The smallest singular value of random rectangular matrices with no moment assumptions on entries, Universality of the least singular value for sparse random matrices, Edge universality for non-Hermitian random matrices, Optimal lower bound on the least singular value of the shifted Ginibre ensemble, Smoothed analysis of symmetric random matrices with continuous distributions, On a condition number of general random polynomial systems, Smoothed Analysis of Local Search Algorithms, Provably Weak Instances of Ring-LWE, Quantitative invertibility of random matrices: a combinatorial perspective

Cites Work