arXiv Analytics

Sign in

arXiv:0805.3167 [math.PR]AbstractReferencesReviewsResources

Smooth analysis of the condition number and the least singular value

Terence Tao, Van Vu

Published 2008-05-20, updated 2009-08-10Version 2

Let $\a$ be a complex random variable with mean zero and bounded variance. Let $N_{n}$ be the random matrix of size $n$ whose entries are iid copies of $\a$ and $M$ be a fixed matrix of the same size. The goal of this paper is to give a general estimate for the condition number and least singular value of the matrix $M + N_{n}$, generalizing an earlier result of Spielman and Teng for the case when $\a$ is gaussian. Our investigation reveals an interesting fact that the ``core'' matrix $M$ does play a role on tail bounds for the least singular value of $M+N_{n} $. This does not occur in Spielman-Teng studies when $\a$ is gaussian. Consequently, our general estimate involves the norm $\|M\|$. In the special case when $\|M\|$ is relatively small, this estimate is nearly optimal and extends or refines existing results.

Comments: 20 pages, no figures, to appear, Mathematics of Computation
Categories: math.PR
Subjects: 11B25
Related articles: Most relevant | Search more
arXiv:2501.15765 [math.PR] (Published 2025-01-27)
Hard edge asymptotics of correlation functions between singular values and eigenvalues
arXiv:1901.08655 [math.PR] (Published 2019-01-24)
Small ball probability for the condition number of random matrices
arXiv:2005.09775 [math.PR] (Published 2020-05-19)
Random Toeplitz Matrices: The Condition Number under High Stochastic Dependence