A randomized kaczmarz algorithm with exponential convergence

Journal of Fourier Analysis and Applications

Volumn 15, Issue 2, 2009, Pages 262-278

  Strohmer, Thomas ^a   Vershynin, Roman ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Convergence rate; Kaczmarz algorithm; Random matrix; Randomized algorithm

Indexed keywords

EID: 67349206945     PISSN: 10695869     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00041-008-9030-4     Document Type: Article

References (36)

1. R.F. Bass K. Gröchenig 2004 Random sampling of multivariate trigonometric polynomials SIAM J. Math. Anal. 36 3 773 795
2. Benedetto, J.J., Ferreira, P.J.S.G. (eds.): Modern Sampling Theory: Mathematics and Applications. Applied and Numerical Harmonic Analysis. Birkhäuser, Boston (2001)
3. Cenker, C., Feichtinger, H.G., Mayer, M., Steier, H., Strohmer, T.: New variants of the POCS method using affine subspaces of finite codimension, with applications to irregular sampling. In: Proc. SPIE: Visual Communications and Image Processing, pp. 299-310 (1992)
4. Y. Censor P.P.B. Eggermont D. Gordon 1983 Strong underrelaxation in Kaczmarz's method for inconsistent linear systems Numer. Math. 41 83 92
5. J. Demmel 1988 The probability that a numerical analysis problem is difficult Math. Comput. 50 182 449 480
6. Deutsch, F.: Rate of convergence of the method of alternating projections. In: Parametric Optimization and Approximation (Oberwolfach, 1983). Internat. Schriftenreihe Numer. Math., vol. 72, pp. 96-107. Birkhäuser, Basel (1985)
7. F. Deutsch H. Hundal 1997 The rate of convergence for the method of alternating projections. II J. Math. Anal. Appl. 205 2 381 405 (Pubitemid 127170286)
8. A. Edelman 1988 Eigenvalues and condition numbers of random matrices SIAM J. Matrix Anal. Appl. 9 4 543 560
9. A. Edelman 1992 On the distribution of a scaled condition number Math. Comput. 58 197 185 190
10. A. Edelman B.D. Sutton 2005 Tails of condition number distributions SIAM J. Matrix Anal. Appl. 27 2 547 560
11. Feichtinger, H.G., Gröchenig, K.H.: Theory and practice of irregular sampling. In: Benedetto, J., Frazier, M. (eds.) Wavelets: Mathematics and Applications, pp. 305-363. CRC Press, Boca Raton (1994)
12. H.G. Feichtinger K. Gröchenig T. Strohmer 1995 Efficient numerical methods in non-uniform sampling theory Numer. Math. 69 423 440
13. A. Frieze R. Kannan S. Vempala 1998 Fast Monte-Carlo algorithms for finding low-rank approximations Proc. Found. Comput. Sci. 39 378 390 Journal version in J. ACM 51, 1025-1041 (2004)
14. A. Galántai 2005 On the rate of convergence of the alternating projection method in finite dimensional spaces J. Math. Anal. Appl. 310 1 30 44 (Pubitemid 41149445)
15. S. Geman 1980 Limit theorem for the norm of random matrices Ann. Probab. 8 2 252 261
16. Golub, G.H., van Loan, C.F.: Matrix Computations, 3rd edn. Johns Hopkins, Baltimore (1996)
17. K. Gröchenig 1992 Reconstruction algorithms in irregular sampling Math. Comput. 59 181 194
18. K. Gröchenig 1999 Irregular sampling, Toeplitz matrices, and the approximation of entire functions of exponential type Math. Comput. 68 749 765
19. Hanke, M.: Conjugate Gradient Type Methods for Ill-Posed Problems. Longman Scientific & Technical, Harlow (1995)
20. M. Hanke W. Niethammer 1990 On the acceleration of Kaczmarz's method for inconsistent linear systems Linear Algebra Appl. 130 83 98
21. M. Hanke W. Niethammer 1990 On the use of small relaxation parameters in Kaczmarz's method Z. Angew. Math. Mech. 70 6 T575 T576 Bericht über die Wissenschaftliche Jahrestagung der GAMM (Karlsruhe, 1989)
22. Herman, G.T.: Image Reconstruction from Projections. The Fundamentals of Computerized Tomography. Computer Science and Applied Mathematics. Academic Press, New York (1980).
23. G.T. Herman L.B. Meyer 1993 Algebraic reconstruction techniques can be made computationally efficient IEEE Trans. Medical Imaging 12 3 600 609
24. G.T. Herman A. Lent P.H. Lutz 1978 Relaxation methods for image reconstruction Commun. Assoc. Comput. Mach. 21 152 158
25. G.N. Hounsfield 1973 Computerized transverse axial scanning (tomography): Part I. Description of the system Br. J. Radiol. 46 1016 1022
26. Kaczmarz, S.: Angenäherte Auflösung von Systemen linearer Gleichungen. Bull. Int. Acad. Polon. Sci. Lett. A 335-357 (1937)
27. Natterer, F.: The Mathematics of Computerized Tomography. Wiley, New York (1986)
28. M. Rudelson R. Vershynin 2006 Sampling from large matrices: an approach through geometric functional analysis J. ACM 54 4 21
29. -1/2. Preprint
30. Rudelson, M., Vershynin, R.: Invertibility of random matrices. II. The Littlewood-Offord theory. Preprint
31. Sezan, K.M., Stark, H.: Applications of convex projection theory to image recovery in tomography and related areas. In: Stark, H. (ed.) Image Recovery: Theory and Application, pp. 415-462. Acad. Press, San Diego (1987)
32. J.W. Silverstein 1985 The smallest eigenvalue of a large-dimensional Wishart matrix Ann. Probab. 13 4 1364 1368
33. Spielman, D.A., Teng, S.-H.: Smoothed analysis of algorithms. In: Proceedings of the International Congress of Mathematicians, vol. I, pp. 597-606. Higher Ed. Press, Beijing (2002).
34. Tao, T., Vu, V.: Inverse Littlewood-Offord theorems and the condition number of random discrete matrices. Ann. Math. (2008, to appear)
35. A. van der Sluis H.A. van der Vorst 1986 The rate of convergence of conjugate gradients Numer. Math. 48 543 560
36. S. Yeh H. Stark 1990 Iterative and one-step reconstruction from nonuniform samples by convex projections J. Opt. Soc. Am. A 7 3 491 499