The condition number of a randomly perturbed matrix

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2007, Pages 248-255

  Vu, Van H ^b   Tao, Terence ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

Singular values

Indexed keywords

NUMBER THEORY; PERTURBATION TECHNIQUES; POLYNOMIALS; PROBABILITY;

ARANDOM MATRIX; CONDITION NUMBER; RANDOMLY PERTURBED MATRIX;

MATRIX ALGEBRA;

EID: 35448941880     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1250790.1250828     Document Type: Conference Paper

References (12)

1. D. Bau and L. Trefethen, Numerical linear algebra. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, 1997.
2. B. Bollobás, Random graphs. Second edition, Cambridge Studies in Advanced Mathematics, 73. Cambridge University Press, Cambridge, 2001.
3. A. Edelman, Eigenvalues and condition numbers of random matrices. SIAM J. Matrix Anal. Appl. 9 (1988), no. 4, 543-560.
4. A. Edelman and B. Sutton, Tails of condition number distributions, SIAM J. Matrix Anal. Appl. 27 (2005), no. 2, 547-560.
5. J. Kahn, J. Komlós, E. Szemerédi, On the probability that a random ±1 matrix is singular, J. Amer. Math. Soc. 8 (1995), 223-240.
6. A. Litvak, A. Pajor, M. Rudelson and N. Tomczak-Jaegermann, Smallest singular value of random matrices and geometry of random polytopes, Adv. Math. 195 (2005), no. 2, 491-523.
7. M. Rudelson, Invertibility of random matrices: Norm of the inverse, submitted.
8. A. Sankar, S. H. Teng, and D. A. Spielman, Smoothed Analysis of the Condition Numbers and Growth Factors of Matrices, preprint.
9. D. A. Spielman and S. H. Teng, Smoothed analysis of algorithms, Proceedings of the International Congress of Mathematicians, Vol. I (Beijing, 2002), 597-606, Higher Ed. Press, Beijing, 2002.
10. D. A. Spielman and S. H. Teng, Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time, J. ACM 51 (2004), no. 3, 385-463.
11. T. Tao and V. Vu, On random ±1 matrices: Singularity and Determinant, Random Structures Algorithms 28 (2006), no. 1, 1-23.
12. T. Tao and V. Vu, Inverse Littlewood-Offord theorems and the condition number of random discrete matrices, Annals of Mathematics, to appear.