Tight Convergence Bounds for the Classical Kaczmarz Method (Q7360698)

We provide tight convergence bounds for the classical Kaczmarz method using a fixed matrix that depends only on A and express these as relaxed bounds interpretable in terms of row norms, correlations, rank, and extremal singular values; we also explain why the cycle update converges faster than random updates when rows are weakly correlated.