Smoothed analysis of complex conic condition numbers

Journal des Mathematiques Pures et Appliquees

Volumn 86, Issue 4, 2006, Pages 293-309

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

^a UNIVERSITY OF PADERBORN   (Germany)

^b CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Condition numbers; Integral geometry; Smoothed analysis; Volume of tubes

Indexed keywords

EID: 33748681698     PISSN: 00217824     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.matpur.2006.06.001     Document Type: Article

References (42)

1. C. Beltrán, L.M. Pardo, Upper bounds on the distribution of the condition number of singular matrices, Found. Comput. Math., in press
2. Ben-Israel A., and Greville T.N.E. Generalized Inverses: Theory and Applications. second ed. (2003), Springer-Verlag
3. Blum L. Lectures on a theory of computation and complexity over the reals (or an arbitrary ring). In: Jen E. (Ed). Lectures in the Sciences of Complexity vol. II (1990), Addison-Wesley 1-47
4. Blum L., Cucker F., Shub M., and Smale S. Complexity and Real Computation (1998), Springer-Verlag
5. Campbell S.L., and Meyer C.D. Generalized Inverse of Linear Transformations (1979), Pitman
6. Cheung D., and Cucker F. Probabilistic analysis of condition numbers for linear programming. J. Optim. Theory Appl. 114 (2002) 55-67
7. Cheung D., and Cucker F. A note on level-2 condition numbers. J. Complexity 21 (2005) 314-319
8. Cucker F., Diao H., and Wei Y. Smoothed analysis of some condition numbers. Numer. Linear Algebra Appl. 13 (2005) 71-84
9. Cucker F., and Wschebor M. On the expected condition number of linear programming problems. Numer. Math. 94 (2002) 419-478
10. Demmel J. On condition numbers and the distance to the nearest ill-posed problem. Numer. Math. 51 (1987) 251-289
11. Demmel J. The probability that a numerical analysis problem is difficult. Math. Comp. 50 (1988) 449-480
12. Dunagan J., Spielman D.A., and Teng S.-H. Smoothed analysis of Renegar's condition number for linear programming. Preprint available at (2003). http://theory.lcs.mit.edu/~spielman
13. Eckart C., and Young G. The approximation of one matrix by another of lower rank. Psychometrika 1 (1936) 211-218
14. Edelman A. Eigenvalues and condition numbers of random matrices. SIAM J. Matrix Anal. Appl. 9 (1988) 543-556
15. Golub G., and Van Loan C. Matrix Computations (1989), John Hopkins Univ. Press
16. Griffiths P., and Harris J. Principles of Algebraic Geometry (1978), Wiley-Interscience (John Wiley & Sons), New York
17. Harris J. Algebraic Geometry. A First Course (1992), Springer-Verlag
18. Kato T. Perturbation Theory for Linear Operators (1966), Springer-Verlag
19. Kostlan E. On the distribution of the roots of random polynomials. In: Hirsch M., Marsden J.E., and Shub M. (Eds). From Topology to Computation: Proceedings of the Smalefest (1993), Springer-Verlag 419-431
20. Renegar J. On the efficiency of Newton's method in approximating all zeros of systems of complex polynomials. Math. Oper. Res. 12 (1987) 121-148
21. Renegar J. Is it possible to know a problem instance is ill-posed?. J. Complexity 10 (1994) 1-56
22. Santaló L.A. Integral Geometry and Geometric Probability (1976), Addison-Wesley Publishing Co., Reading, MA-London-Amsterdam
23. Shafarevich I.R. Basic Algebraic Geometry (1974), Springer-Verlag, New York. Translated from the Russian by K.A. Hirsch, Die Grundlehren der mathematischen Wissenschaften, Band 213.
24. Shub M., and Smale S. Complexity of Bézout's theorem I: geometric aspects. J. Amer. Math. Soc. 6 (1993) 459-501
25. Shub M., and Smale S. Complexity of Bézout's theorem II: volumes and probabilities. In: Eyssette F., and Galligo A. (Eds). Computational Algebraic Geometry. Progress in Mathematics (1993), Birkhäuser 267-285
26. Shub M., and Smale S. Complexity of Bézout's theorem III: condition number and packing. J. Complexity 9 (1993) 4-14
27. Shub M., and Smale S. Complexity of Bézout's theorem V: polynomial time. Theor. Comp. Sci. 133 (1994) 141-164
28. Shub M., and Smale S. Complexity of Bézout's theorem IV: probability of success extensions. SIAM J. Numer. Anal. 33 (1996) 128-148
29. Smale S. The fundamental theorem of algebra and complexity theory. Bull. Amer. Math. Soc. 4 (1981) 1-36
30. Smale S. Complexity theory and numerical analysis. In: Iserles A. (Ed). Acta Numerica (1997), Cambridge Univ. Press
31. D.A. Spielman, S.-H. Teng, Smoothed analysis of algorithms, in: Proceedings of the International Congress of Mathematicians, vol. I, 2002, pp. 597-606
32. Spielman D.A., and Teng S.-H. Smoothed analysis of termination of linear programming algorithms. Math. Program. Series B 97 (2003) 375-404
33. Spielman D.A., and Teng S.-H. Smoothed analysis: Why the simplex algorithm usually takes polynomial time. J. ACM 51 3 (2004) 385-463
34. Stewart G.W., and Sun J. Matrix Perturbation Theory (1990), Academic Press
35. B. Sturmfels, Solving systems of polynomial equations, in: CBMS Regional Conference Series in Mathematics, vol. 97. Published for the Conference Board of the Mathematical Sciences, Washington, DC, 2002
36. Todd M.J., Tunçel L., and Ye Y. Characterizations, bounds and probabilistic analysis of two complexity measures for linear programming problems. Math. Program. 90 (2001) 59-69
37. Turing A.M. Rounding-off errors in matrix processes. Quart. J. Mech. Appl. Math. 1 (1948) 287-308
38. van Lint J.H. Introduction to Coding Theory (1999), Springer-Verlag
39. von Neumann J., and Goldstine H.H. Numerical inverting matrices of high order. Bull. Amer. Math. Soc. 53 (1947) 1021-1099
40. Weyl H. The Theory of Groups and Quantum Mechanics (1950), Dover, New York
41. Wilkinson J. Note on matrices with a very ill-conditioned eigenproblem. Numer. Math. 19 (1972) 176-178
42. Wschebor M. Smoothed analysis of κ (a). J. Complexity 20 (2004) 97-107