Fetching the paper…
Reading the bibliography…
The block Kaczmarz method is an iterative scheme for solving overdetermined least-squares problems.
Angenäherte auflösung von systemen linearer gleichungen
S. Kaczmarz · 1937
Earlier work this paper cites.
Extensions of pure states
R. V. Kadison and I. M. Singer · 1959
Earlier work this paper cites.
Algebraic reconstruction techniques (ART) for three-dimensional electron microscopy and X-ray photography
R. Gordon, R. Bender, and G. T. Herman · 1970
Earlier work this paper cites.
A bound on tail probabilities for quadratic forms in independent random variables
D. L. Hanson and F. T. Wright · 1971
Earlier work this paper cites.
The angles between the null spaces of X-rays
C. Hamaker and D. C. Solmon · 1978
Earlier work this paper cites.
Extensions, restrictions, and representations of states on C ∗ C^{\ast} -algebras
J. Anderson · 1979
Earlier work this paper cites.
Block-iterative methods for consistent and inconsistent linear equations
T. Elfving · 1980
Earlier work this paper cites.
Iterative algorithms for large partitioned linear systems, with applications to image reconstruction
P. P. B. Eggermont, G. T. Herman, and A. Lent · 1981
Earlier work this paper cites.
The mathematics of computerized tomography
F. Natterer · 1986
Earlier work this paper cites.
Invertibility of “large” submatrices with applications to the geometry of Banach spaces and harmonic analysis
J. Bourgain and L. Tzafriri · 1987
Earlier work this paper cites.
Incorporation of a priori moment information into signal recovery and synthesis problems
M. I. Sezan and H. Stark · 1987
Earlier work this paper cites.
Matrix norm inequalities and the relative Dixmier property
K. Berman, H. Halpern, V. Kaftal, and G. Weiss · 1988
Earlier work this paper cites.
Block-iterative projection methods for parallel computation of solutions to convex feasibility problems
R. Aharoni and Y. Censor · 1989
Earlier work this paper cites.
On a problem of Kadison and Singer
J. Bourgain and L. Tzafriri · 1991
Earlier work this paper cites.
New variants of the POCS method using affine subspaces of finite codimension, with applications to irregular sampling
C. Cenker, H. G. Feichtinger, M. Mayer, H. Steier, and T. Strohmer · 1992
Earlier work this paper cites.
Limit of the smallest eigenvalue of a large-dimensional sample covariance matrix
Z. D. Bai and Y. Q. Yin · 1993
Earlier work this paper cites.
Algebraic reconstruction techniques can be made computationally efficient
G. Herman and L. Meyer · 1993
Earlier work this paper cites.
Dual coordinate ascent methods for non-strictly convex minimization
P. Tseng · 1993
Earlier work this paper cites.
Some remarks on coordinate restriction of operators to coordinate subspaces
B. Kashin and L. Tzafriri · 1994
Earlier work this paper cites.
A Kaczmarz-based approach to nonperiodic sampling on unions of rectangular lattices
H. G. Feichtinger and T. Strohmer · 1995
Earlier work this paper cites.
Theoria Combinationis Observationum Erroribus Minimis Obnoxiae, Supplementum
C. F. Gauss · 1995
Earlier work this paper cites.
Numerical methods for least squares problems
Å. Björck · 1996
Cited alongside, same era.
Matrix computations
G. H. Golub and C. F. Van Loan · 1996
Cited alongside, same era.
Extensions of block-projections methods with relaxation parameters to inconsistent and rank-deficient least-squares problems
C. Popa · 1998
Cited alongside, same era.
Block-projections algorithms with blocks containing mutually orthogonal rows and columns
C. Popa · 1999
Cited alongside, same era.
Uncertainty principles and ideal atomic decomposition
D. L. Donoho and X. Huo · 2001
Cited alongside, same era.
A fast Kaczmarz-Kovarik algorithm for consistent least-squares problems
C. Popa · 2001
Cited alongside, same era.
Column subset selection, matrix factorization, and eigenvalue optimization
J. A. Tropp · 2009
Later among the works it cites.
Blendenpik: supercharging Lapack’s least-squares solver
H. Avron, P. Maymounkov, and S. Toledo · 2010
Later among the works it cites.
Randomized methods for linear constraints: convergence rates and conditioning
D. Leventhal and A. S. Lewis · 2010
Later among the works it cites.
Randomized Kaczmarz solver for noisy linear systems
D. Needell · 2010
Later among the works it cites.
Spectral sparsification and restricted invertibility
N. Srivastava · 2010
Later among the works it cites.
Acceleration of randomized Kaczmarz method via the Johnson-Lindenstrauss lemma
Y. C. Eldar and D. Needell · 2011
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
John’s decompositions: selecting a large part
R. Vershynin · 2001
Cited alongside, same era.
The method of alternating projections and the method of subspace corrections in Hilbert space
J. Xu and L. Zikatanov · 2002
Cited alongside, same era.
A Kaczmarz-Kovarik algorithm for symmetric ill-conditioned matrices
C. Popa · 2004
Cited alongside, same era.
The Kadison-Singer problem in mathematics and engineering
P. G. Casazza and J. C. Tremain · 2006
Cited alongside, same era.
Random sets of isomorphism of linear operators on Hilbert space
R. Vershynin · 2006
Cited alongside, same era.
Applied iterative methods
C. L. Byrne · 2008
Cited alongside, same era.
Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
N. Halko, P. G. Martinsson, and J. A. Tropp · 2011
Later among the works it cites.
Sparse quadratic forms and their geometric applications
A. Naor · 2011
Later among the works it cites.
P. Richtárik and M. Takáč · 2011
Later among the works it cites.
Improved analysis of the subsampled randomized Hadamard transform
J. A. Tropp · 2011
Later among the works it cites.
Improved matrix algorithms via the Subsampled Randomized Hadamard Transform
C. Boutsidis and A. Gittens · 2012
Closest in time.
Invertibility of random submatrices via tail decoupling and a matrix Chernoff inequality
S. Chrétien and S. Darses · 2012
Closest in time.
Almost sure convergence of the Kaczmarz algorithm with random measurements
X. Chen and A. Powell · 2012
Closest in time.
A mathematical introduction to compressive sensing
S. Foucart and H. Rauhut · 2012
Closest in time.
Two-subspace projection method for coherent overdetermined linear systems
D. Needell and R. Ward · 2012
Closest in time.
Beneath the valley of the noncommutative arithmetic–geometric mean inequality: Conjectures, case studies, and consequences
B. Recht and C. Ré · 2012
Closest in time.
An elementary proof of the restricted invertibility theorem
D. A. Spielman and N. Srivastava · 2012
Closest in time.
User-Friendly Tail Bounds for Sums of Random Matrices
J. A. Tropp · 2012
Closest in time.
A note on column subset selection
P. Youssef · 2012
Closest in time.
Restricted invertibility and the Banach–Mazur distance to the cube
P. Youssef · 2012
Closest in time.
Randomized extended Kaczmarz for solving least-squares
A. Zouzias and N. M. Freris · 2012
Closest in time.