Smooth analysis of the condition number and the least singular value
From MaRDI portal
Publication:3160742
DOI10.1090/S0025-5718-2010-02396-8zbMath1253.65067OpenAlexW2571352639MaRDI 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
Random matrices (probabilistic aspects) (60B20) Numerical computation of matrix norms, conditioning, scaling (65F35) Conditioning of matrices (15A12)
Related Items
Fluctuations in the spectrum of non-Hermitian i.i.d. matrices, Coverings of random ellipsoids, and invertibility of matrices with i.i.d. heavy-tailed entries, A Deterministic Kaczmarz Algorithm for Solving Linear Systems, Lower bounds for the smallest singular value of structured random matrices, Smoothed Analysis of Local Search Algorithms, The smallest singular value of random rectangular matrices with no moment assumptions on entries, The method of perpendiculars of finding estimates from below for minimal singular eigenvalues of random matrices, Universality of the least singular value for sparse random matrices, Provably Weak Instances of Ring-LWE, Random matrices: overcrowding estimates for the spectrum, On sparse random combinatorial matrices, Edge universality for non-Hermitian random matrices, Erratum to: Outliers in the spectrum of iid matrices with bounded rank perturbations, Optimal lower bound on the least singular value of the shifted Ginibre ensemble, A note on the universality of ESDs of inhomogeneous random matrices, Quantitative invertibility of random matrices: a combinatorial perspective, The smallest singular value of a shifted random matrix, Central Limit Theorem for Linear Eigenvalue Statistics of <scp>Non‐Hermitian</scp> Random Matrices, Conditioning of linear systems arising from penalty methods, Almost sure Weyl law for quantized tori, Universality: random matrices, random geometry and SPDEs. Abstracts from the workshop held May 29 -- June 4, 2022, Quantitative invertibility of non-Hermitian random matrices, Universality of the minimum modulus for random trigonometric polynomials, On the smoothed analysis of the smallest singular value with discrete noise, Mesoscopic central limit theorem for non-Hermitian random matrices, Complex random matrices have no real eigenvalues, Optimal inverse Littlewood-Offord theorems, Random matrices: law of the determinant, Spectrum of non-Hermitian heavy tailed random matrices, Random doubly stochastic matrices: the circular law, The smallest singular value of a shifted $d$-regular random square matrix, On the singularity of adjacency matrices for random regular digraphs, Random matrices: tail bounds for gaps between eigenvalues, An upper bound on the smallest singular value of a square random matrix, Smoothed analysis of symmetric random matrices with continuous distributions, On a condition number of general random polynomial systems, Intrinsic volumes of symmetric cones and applications in convex programming, Eigenvectors and controllability of non-Hermitian random matrices and directed graphs, Fluctuation around the circular law for random matrices with real entries, Mixed and componentwise condition numbers for matrix decompositions, The least singular value of the general deformed Ginibre ensemble, Random matrix products: universality and least singular values, The probabilistic estimates on the largest and smallest $q$-singular values of random matrices, High dimensional normality of noisy eigenvectors, 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, The strong circular law: A combinatorial view, On the concentration of random multilinear forms and the universality of random block matrices
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Smoothed analysis of condition numbers and complexity implications for linear programming
- On the distribution of the roots of certain symmetric matrices
- Smoothed analysis of complex conic condition numbers
- Spectral analysis of large dimensional random matrices
- Complexity theory of numerical linear algebra
- The eigenvalues of random symmetric matrices
- Invertibility of random matrices: norm of the inverse
- Inverse Littlewood-Offord theorems and the condition number of random discrete matrices
- The Littlewood-Offord problem and invertibility of random matrices
- Smallest singular value of random matrices and geometry of random polytopes
- General formulas for the smoothed analysis of condition numbers
- Smoothed Analysis of the Condition Numbers and Growth Factors of Matrices
- RANDOM MATRICES: THE CIRCULAR LAW
- The probability that a slightly perturbed numerical analysis problem is difficult
- Smoothed analysis of algorithms
- On the efficiency of algorithms of analysis
- The Probability That a Numerical Analysis Problem is Difficult
- Eigenvalues and Condition Numbers of Random Matrices
- The Expected Norm of Random Matrices
- Some estimates of norms of random matrices
- On the Efficiency of Newton's Method in Approximating All Zeros of a System of Complex Polynomials
- Numerical inverting of matrices of high order
- On a lemma of Littlewood and Offord
- Spectral norm of random matrices