Abstract
For solving the large-scale linear least-squares problem, we propose a block version of the randomized extended Kaczmarz method, called the two-subspace randomized extended Kaczmarz method, which does not require any row or column paving. Theoretical analysis and numerical results show that the two-subspace randomized extended Kaczmarz method is much more efficient than the randomized extended Kaczmarz method. When the coefficient matrix is of full column rank, the two-subspace randomized extended Kaczmarz method can also outperform the randomized coordinate descent method. If the linear system is consistent, we remove one of the iteration sequences in the two-subspace randomized extended Kaczmarz method, which approximates the projection of the right-hand side vector onto the orthogonal complement space of the range space of the coefficient matrix, and obtain the generalized two-subspace randomized Kaczmarz method, which is actually a generalization of the two-subspace randomized Kaczmarz method without the assumptions of unit row norms and full column rank on the coefficient matrix. We give the upper bound for the convergence rate of the generalized two-subspace randomized Kaczmarz method which also leads to a better upper bound for the convergence rate of the two-subspace randomized Kaczmarz method.
Similar content being viewed by others
References
Bai, Z.-Z., Liu, X.-G.: On the Meany inequality with applications to convergence analysis of several row-action iteration methods. Numer. Math. 124, 215–236 (2013)
Bai, Z.-Z., Wang, L., Wu, W.-T.: On convergence rate of the randomized Gauss-Seidel method. Linear Algebra Appl. 611, 237–252 (2021)
Bai, Z.-Z., Wu, W.-T.: On greedy randomized Kaczmarz method for solving large sparse linear systems. SIAM J. Sci. Comput. 40, A592–A606 (2018)
Bai, Z. -Z., Wu, W. -T.: On relaxed greedy randomized Kaczmarz methods for solving large sparse linear systems. Appl. Math. Lett. 83, 21–26 (2018)
Bai, Z.-Z., Wu, W.-T.: On convergence rate of the randomized Kaczmarz method. Linear Algebra Appl. 553, 252–269 (2018)
Bai, Z.-Z., Wu, W.-T.: On greedy randomized coordinate descent methods for solving large linear least-squares problems. Numer. Linear Algebra Appl. 26, e2237, 1–15 (2019)
Bai, Z.-Z., Wu, W.-T.: On partially randomized extended Kaczmarz method for solving large sparse overdetermined inconsistent linear systems. Linear Algebra Appl. 578, 225–250 (2019)
Byrne, C.: A unified treatment of some iterative algorithms in signal processing and image reconstruction. Inverse Problems 20, 103–120 (2004)
Censor, Y.: Row-action methods for huge and sparse systems and their applications. SIAM Rev. 23, 444–466 (1981)
Chen, J.-Q., Huang, Z.-D.: On the error estimate of the randomized double block Kaczmarz method. Appl. Math. Comput. 370, 124907, 1–11 (2020)
Davis, T.A., Hu, Y.: The University of Florida sparse matrix collection. ACM Trans. Math. Software 38, Art. 1, 1–25 (2011)
Du, K.: Tight upper bounds for the convergence of the randomized extended Kaczmarz and Gauss-Seidel algorithms. Numer. Linear Algebra Appl. 26, e2233, 1–14 (2019)
Galántai, A.: Projectors and Projection Methods. Kluwer Academic Publishers, Norwell (2004)
Gower, R.M., Richtárik, P.: Stochastic dual ascent for solving linear systems, arXiv:1512.06890, 1–28 (2015)
Hansen, P.C., Jørgensen, J.S.: AIR Tools II: Algebraic iterative reconstruction methods, improved implementation. Numer. Algorithms 79, 107–137 (2018)
Herman, G. T.: Fundamentals of Computerized Tomography: Image Reconstruction from Projections, 2nd edn. Springer, Dordrecht (2009)
Kaczmarz, S.: Angenäherte Auflösung von Systemen linearer Gleichungen. Bull. Int. Acad. Polon. Sci. Lett. A 35, 355–357 (1937)
Leventhal, D., Lewis, A.S.: Randomized methods for linear constraints: Convergence rates and conditioning. Math. Oper. Res. 35, 641–654 (2010)
Ma, A., Needell, D., Ramdas, A.: Convergence properties of the randomized extended Gauss-Seidel and Kaczmarz methods. SIAM J. Matrix Anal. Appl. 36, 1590–1604 (2015)
Natterer, F.: The Mathematics of Computerized Tomography. SIAM, Philadelphia (2001)
Needell, D.: Randomized Kaczmarz solver for noisy linear systems. BIT 50, 395–403 (2010)
Needell, D., Tropp, J.A.: Paved with good intentions: Analysis of a randomized block Kaczmarz method. Linear Algebra Appl. 441, 199–221 (2014)
Needell, D., Ward, R.: Two-subspace projection method for coherent overdetermined systems. J. Fourier Anal. Appl. 19, 256–269 (2013)
Needell, D., Zhao, R., Zouzias, A.: Randomized block Kaczmarz method with projection for solving least squares. Linear Algebra Appl. 484, 322–343 (2015)
Strohmer, T., Vershynin, R.: A randomized Kaczmarz algorithm with exponential convergence. J. Fourier Anal. Appl. 15, 262–278 (2009)
Zhang, J.-J.: A new greedy Kaczmarz algorithm for the solution of very large linear systems. Appl. Math. Lett. 91, 207–212 (2019)
Zouzias, A., Freris, N.M.: Randomized extended Kaczmarz for solving least squares. SIAM J. Matrix Anal. Appl. 34, 773–793 (2013)
Acknowledgements
The author is thankful to the referees for their constructive comments and valuable suggestions, which greatly improved the original manuscript of this paper.
Funding
This work is supported by The National Natural Science Foundation (No. 12001043 and No. 12071472), P.R. China; in part by Beijing Institute of Technology Research Fund Program for Young Scholars; and in part by Science and Technology Commission of Shanghai Municipality (No. 18dz2271000).
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher’s note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Appendix
Appendix
Proof of Lemma 4.1
From the definition of the GTRK method we can obtain
where uk is defined as in (3.3) with \(\|u_{k}\|_{2}^{2}=1-|\mu _{k}|^{2}\). Since the linear system Ax = b is assumed to be consistent, it holds that b = Ax⋆, then we have
and
Therefore, it holds that
We denote \(\check {y}_{k}\) and \(\check {x}_{k+1}\) as the vectors obtained by utilizing one RK iteration on xk and \(\check {y}_{k}\) with the working rows \(A^{(i_{k_1})}\) and \(A^{(i_{k_2})}\) for the consistent linear system Ax = b, respectively. That is,
and
Then, it follows from b = Ax⋆ that
From the definition of uk we have
From the orthogonality of the vectors \(A^{(i_{k_2})}\) and uk that
we have
Then, it follows from (A.1) that
By taking the conditional expectation on both sides of this equality, we can obtain
Next, we give the estimates for the first and second parts of the right-hand side of the equality (A.3) respectively. Denote the two orthogonal projection matrices as
then from equality (A.2) we have
Since \(x_{k}-x_{\star }\in {\mathcal R}(A^{*})\) and \(Q_{i_{k_{1}}}(x_{k}-x_{\star })\in {\mathcal R}(A^{*})\), it holds that
From the definition of uk and \(\|u_{k}\|_{2}^{2}=1-|\mu _{k}|^{2}\), we have
Then, with the notations
for p, q ∈{1, 2,…, m} and p≠q, we can obtain
Since for any \(\theta , \eta , \phi , \psi \in {\mathbb {C}}\), it holds that
we have
Then from
we know that
It follows from \(x_{k}-x_{\star }\in {\mathcal R}(A^{*})\) that
Substituting (A.4) and (A.5) into (A.3), we have
Finally, taking full expectation on both sides of this inequality, we will obtain the result in Lemma 4.1 by induction on the iteration index k. □
Rights and permissions
About this article
Cite this article
Wu, WT. On two-subspace randomized extended Kaczmarz method for solving large linear least-squares problems. Numer Algor 89, 1–31 (2022). https://doi.org/10.1007/s11075-021-01104-x
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11075-021-01104-x