Smoothed analysis of moore-penrose inversion

SIAM Journal on Matrix Analysis and Applications

Volumn 31, Issue 5, 2010, Pages 2769-2783

  Bürgisser, Peter ^a   Cucker, Felipe ^b  

^a UNIVERSITY OF PADERBORN   (Germany)

^b CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Least squares; Moore Penrose inversion; Smoothed analysis

Indexed keywords

CONDITION NUMBERS; EXPECTED VALUES; LEAST SQUARE; MATRIX; MOORE-PENROSE INVERSION; RECTANGULAR MATRIX; SMOOTHED ANALYSIS;

NUMBER THEORY;

PROBABILITY DISTRIBUTIONS;

EID: 79251471099     PISSN: 08954798     EISSN: 10957162     Source Type: Journal    
DOI: 10.1137/100782954     Document Type: Article

References (28)

1. D. Arthur and S. Vassilvitskii, Worst-case and smoothed analysis of the ICP algorithm, with an application to the k-means method, SIAM J. Comput., 39 (2009), pp. 766-782.
2. P. Bürgisser, F. Cucker, and M. Lotz, Smoothed analysis of complex conic condition numbers, J. Math. Pures Appl. (9), 86 (2006), pp. 293-309. (Pubitemid 44391050)
3. P. Bürgisser, F. Cucker, and M. Lotz, The probability that a small perturbation of a numerical analysis problem is difficult, Math. Comp., 77 (2008), pp. 1559-1583.
4. Z.-Z. Cheng and J.J. Dongarra, Condition numbers of Gaussian random matrices, SIAM J. Matrix Anal. Appl., 27 (2005), pp. 603-620.
5. F. Cucker, H. Diao, and Y. Wei, Smoothed analysis of some condition numbers, Numer. Linear Algebra Appl., 13 (2005), pp. 71-84.
6. J. Demmel, The probability that a numerical analysis problem is difficult, Math. Comp., 50 (1988), pp. 449-480.
7. J. Dunagan, D.A. Spielman, and S.-H. Teng, Smoothed analysis of condition numbers and complexity implications for linear programming, Math. Program., to appear; preprint available at http://arxiv.org/abs/cs/0302011v2.
8. A. Edelman, Eigenvalues and condition numbers of random matrices, SIAM J. Matrix Anal. Appl., 9 (1988), pp. 543-560.
9. A. Edelman, On the distribution of a scaled condition number, Math. Comp., 58 (1992), pp. 185-190.
10. S. Geman, A limit theorem for the norm of random matrices, Ann. Probab., 8 (1980), pp. 252-261.
11. G.H. Golub and C.F. Van Loan, Matrix Computations, Johns Hopkins Ser. Math. Sci. 3, Johns Hopkins University Press, Baltimore, MD, 1983.
12. J. Harris, Algebraic Geometry, Grad. Texts in Math. 133, Springer-Verlag, New York, 1995.
13. M.-R. Hestenes and E. Stiefel, Methods of conjugate gradients for solving linear systems, J. Res. Natl. Bur. Stand., 49 (1952), pp. 409-436.
14. N.J. Higham, Accuracy and Stability of Numerical Algorithms, SIAM, Philadelphia, 1996.
15. M. Ledoux, The Concentration of Measure Phenomenon, Math. Surveys Monogr. 89, American Mathematical Society, Providence, RI, 2001.
16. M. Ledoux and M. Talagrand, Probability in Banach Spaces, Ergeb. Math. Grenzgeb. (3) 23, Springer-Verlag, Berlin, 1991.
17. J. von Neumann and H.H. Goldstine, Numerical inverting matrices of high order, II, Proc. Amer. Math. Soc., 2 (1951), pp. 188-202.
18. A. Sankar, D.A. Spielman, and S.H. Teng, Smoothed analysis of the condition numbers and growth factors of matrices, SIAM J. Matrix Anal. Appl., 28 (2006), pp. 446-476.
19. J.W. Silverstein, The smallest eigenvalue of a large-dimensional Wishart matrix, Ann. Probab., 13 (1985), pp. 1364-1368.
20. S. Smale, Complexity theory and numerical analysis, Acta Numer., 6 (1997), pp. 523-551.
21. D.A. Spielman and S.-H. Teng, Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time, J. ACM, 51 (2004), pp. 385-463.
22. D.A. Spielman and S.-H. Teng, Smoothed analysis of algorithms and heuristics, in Foundations of Computational Mathematics, 2005, Lect. Notes London Math. Soc., 331 (2006), pp. 274-342.
23. D.A. Spielman and S.-H. Teng, Smoothed analysis: An attempt to explain the behavior of algorithms in practice, Commun. ACM, 52 (2009), pp. 77-84.
24. T. Tao and V. Vu, The condition number of a randomly perturbed matrix, in STOC'07- Proceedings of the 39th Annual ACM Symposium on Theory of Computing, ACM, New York, 2007, pp. 248-255.
25. T. Tao and V. Vu, Smooth analysis of the condition number and the least singular value, Math. Comput., 79 (2010), pp. 2333-2352.
26. L.N. Trefethen and D. Bau, III, Numerical Linear Algebra, SIAM, Philadelphia, 1997.
27. P.-A. Wedin, Perturbation theory for pseudo-inverses, BIT, 13 (1973), pp. 217-232.
28. M. Wschebor, Smoothed analysis of κ(A), J. Complexity, 20 (2004), pp. 97-107.