Smooth analysis of the condition number and the least singular value

Mathematics of Computation

Volumn 79, Issue 272, 2010, Pages 2333-2352

  Tao, Terence ^a   Vu, Van ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 77956580422     PISSN: 00255718     EISSN: None     Source Type: Journal    
DOI: 10.1090/S0025-5718-2010-02396-8     Document Type: Article

References (32)

1. Z. Bai and J. Silverstein, Spectral analysis of large dimensional random matrices, Second Edition, Springer, New York, 2010.
2. D. Bau and L. N. Trefethen, Numerical linear algebra, SIAM (1997).
3. P. Bürgisser, F. Cucker, M. Lotz, The probability that a slightly perturbed numerical analysis problem is difficult, Math. Comp. 77 (2008), 1559-1583.
4. P. Bürgisser, F. Cucker, M. Lotz, General formulas for the smooth analysis of condition numbers, C. R. Acad. Sci. Paris, 343 (2006), 145-150.
5. P. Bürgisser, F. Cucker, M. Lotz, Smooth analysis of conic condition numbers, J. Math. Pure Appl. 86 (2006), 293-309.
6. A. Edelman, Eigenvalues and condition numbers of random matrices. SIAM J. Matrix Anal. Appl. 9 (1988), no. 4, 543-560.
7. P. Erdös, On a lemma of Littlewood and Offord, Bull. Amer. Math. Soc. 51 (1945), 898-902.
8. J. Demmel, The probability that a numerical analysis problem is difficult, Math. Comp. 50 (1988), 449-480.
9. J. Dunagan, D. A. Spielman and S. H. Teng, Smoothed Analysis of the Renegar's Condition Number for Linear Programming, preprint.
10. G. Golub and C. Van Loan, Matrix computations, Third edition, Johns Hopkins Press, 1996.
11. Z. Füredi and J. Komĺos, The eigenvalues of random symmetric matrices, Combinatorica 1 (1981), no. 3, 233-241.
12. E. Kostlan, Complexity theory of numerical linear algebra, J. Comp. Appl. Math. 22 (1988), no. 2-3, 219-230.
13. J. Komlós, On the determinant of (0, 1) matrices, Studia Sci. Math. Hungar. 2 (1967), 7-22.
14. R. Latala, Some estimates of norms of random matrices, Proc. Amer. Math. Soc. 133 (2005), 1273-1282.
15. 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.
16. M.L. Mehta, Random Matrices and the Statistical Theory of Energy Levels, Academic Press, New York, NY, 1967.
17. L.A. Pastur, The spectrum of random matrices, Teoret. Mat. Fiz. 10 (1973), 102-112.
18. J. Renegar, On the efficiency of Newton's method in approximating all zeros of a system of complex polynomials, Math. Oper. Res. 12 (1987), no. 1, 121-148.
19. M. Rudelson, Invertibility of random matrices: Norm of the inverse. Annals of Mathematics 168 (2008), no. 2, 575-600.
20. M. Rudelson and R. Vershynin, The Littlewood-Offord problem and the condition number of random matrices, Advances in Mathematics 218 (2008), no. 2, 600-633.
21. S. Smale, On the efficiency of algorithms of analysis, Bull. Amer. Math. Soc. 13 (1985), 87-121.
22. Y. Seginer, The expected norm of random matrices, Combin. Probab. Comput. 9 (2000), no. 2, 149-166.
23. 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.
24. 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.
25. A. Sankar, S. H. Teng, and D. A. Spielman, Smoothed Analysis of the Condition Numbers and Growth Factors of Matrices, SIAM J. Matrix Anal. Appl. 28 (2006), no. 2, 446-476.
26. T. Tao and V. Vu, Inverse Littlewood-Offord theorems and the condition number of random discrete matrices, Annals of Mathematics, 169 (2009), no. 2, 595-632.
27. T. Tao and V. Vu, The condition number of a randomly perturbed matrix, STOC'07, ACM, 248-255, 2007.
28. T. Tao and V. Vu, Random matrices: The circular law, Communications in Contemporary Mathematics, 10 (2008), 261-307.
29. T. Tao and V. Vu, Additive Combinatorics, Cambridge Univ. Press, 2006.
30. J. von Neumann and H. Goldstein, Numerical inverting matrices of high order, Bull. Amer. Math. Soc. 53 (1947) 1021-1099.
31. V. Vu, Spectral norm of random matrices, Combinatorica 27 (2007), no. 6, 721-736.
32. P. Wigner, On the distribution of the roots of certain symmetric matrices, Annals of Math. 67 (1958), 325-327.