The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
A Randomized Kaczmarz Algorithm with Exponential Convergence
Open accessAbstract
The Kaczmarz method for solving linear systems of equations is an iterative algorithm that has found many applications ranging from computer tomography to digital signal processing. Despite the popularity of this method, useful theoretical estimates for its rate of convergence are still scarce. We introduce a randomized version of the Kaczmarz method for consistent, overdetermined linear systems and we prove that it converges with expected exponential rate. Furthermore, this is the first solver whose rate does not depend on the number of equations in the system. The solver does not even need to know the whole system but only a small random part of it. It thus outperforms all previously known methods on general extremely overdetermined systems. Even for moderately overdetermined systems, numerical simulations as well as theoretical analysis reveal that our algorithm can converge faster than the celebrated conjugate gradient algorithm. Furthermore, our theory and numerical simulations confirm a prediction of Feichtinger et al. in the context of reconstructing bandlimited functions from nonuniform sampling.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
Faires, J. D. (1978) · Cited by 6,711
Golub, G. H., & Loan, C. F. V. (1996) · Johns Hopkins University Press eBooks · Cited by 6,027
Computerized transverse axial scanning (tomography): Part 1. Description of system
Hounsfield, G. N. (1973) · The British Journal of Radiology · doi:10.1259/0007-1285-46-552-1016 · Cited by 3,924
The Mathematics of Computerized Tomography
Natterer, F., & Wang, G. (2002) · Medical Physics · doi:10.1118/1.1429631 · Cited by 2,524
Image reconstruction from projections : the fundamentals of computerized tomography
Herman, G. T. (1980) · Academic Press eBooks · Cited by 1,993
The Mathematics of Computerized Tomography
Natterer, F. (1986) · Vieweg+Teubner eBooks · doi:10.1007/978-3-663-01409-6 · Cited by 1,768
Eigenvalues and Condition Numbers of Random Matrices
Edelman, A. (1988) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/0609045 · Cited by 1,284
Image Reconstruction from Projections
(2004) · Biomedical Engineering · doi:10.1201/9780203492543.ch9 · Cited by 915
Fast monte-carlo algorithms for finding low-rank approximations
Frieze, A., Kannan, R., & Vempala, S. (2004) · Journal of the ACM · doi:10.1145/1039488.1039494 · Cited by 500
Herman, G. T., & Meyer, L. B. (1993) · IEEE Transactions on Medical Imaging · doi:10.1109/42.241889 · Cited by 486
A Limit Theorem for the Norm of Random Matrices
Geman, S. (1980) · The Annals of Probability · doi:10.1214/aop/1176994775 · Cited by 419
WAVELETS: MATHEMATICS AND APPLICATIONSPreprint
Dremin, I. (2004) · Cited by 401
The rate of convergence of Conjugate Gradients
van der Sluis, A., & van der Vorst, H. A. (1986) · Numerische Mathematik · doi:10.1007/bf01389450 · Cited by 351
The Littlewood–Offord problem and invertibility of random matrices
Rudelson, M., & Vershynin, R. (2008) · Advances in Mathematics · doi:10.1016/j.aim.2008.01.010 · Cited by 322
Self-citationThe Strong Limits of Random Matrix Spectra for Sample Matrices of Independent Elements
Wachter, K. W. (1978) · The Annals of Probability · doi:10.1214/aop/1176995607 · Cited by 288
Theory and practice of irregular sampling
Feichtinger, H. G., & Gröchenig, K. (2021) · Wavelets · doi:10.1201/9781003210450-10 · Cited by 270
Reconstruction algorithms in irregular sampling
Gröchenig, K. (1992) · Mathematics of Computation · doi:10.1090/s0025-5718-1992-1134729-0 · Cited by 261
Efficient numerical methods in non-uniform sampling theory
Feichtinger, H. G., Gr\"ochenig, K., & Strohmer, T. (1995) · Numerische Mathematik · doi:10.1007/s002110050101 · Cited by 260
Self-citationThe probability that a numerical analysis problem is difficult
Demmel, J. W. (1988) · Mathematics of Computation · doi:10.1090/s0025-5718-1988-0929546-7 · Cited by 221
Inverse Littlewood–Offord theorems and the condition number of random discrete matrices
Tao, T., & Vu, V. (2009) · Annals of Mathematics · doi:10.4007/annals.2009.169.595 · Cited by 219
Relaxation methods for image reconstruction
Herman, G. T., Lent, A. H., & Lutz, P. H. (1978) · Communications of the ACM · doi:10.1145/359340.359351 · Cited by 137
Cited by
Federated Optimization in Heterogeneous Networks
Li, T., Sahu, A. K., Zaheer, M., Sanjabi, M., Talwalkar, A., & Smith, V. (2018) · arXiv · doi:10.48550/arxiv.1812.06127 · Cited by 4,023
Halko, N., Martinsson, P. G., & Tropp, J. A. (2011) · SIAM Review · doi:10.1137/090771806 · Cited by 4,002
Wright, S. J. (2015) · Mathematical Programming · doi:10.1007/s10107-015-0892-3 · Cited by 1,438
Minimizing finite sums with the stochastic average gradient
Schmidt, M., Le Roux, N., & Bach, F. (2017) · Mathematical Programming · doi:10.1007/s10107-016-1030-6 · Cited by 922
Richtárik, P., & Takáč, M. (2014) · Mathematical Programming · doi:10.1007/s10107-012-0614-z · Cited by 654
Metadata
- Authors
- Strohmer, T., & Vershynin, R.
- Venue
- Journal of Fourier Analysis and Applications
- Published
- 2008-04-25
- Volume
- 15
- Issue
- 2
- Pages
- 262-278
- ISSN
- 1069-5869 (ISSN-L)
- 1531-5851
- OpenAlex
- W2048305372
- Cited by
- 903
- References
- 22
- FWCI
- 10.85
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.