Skip to main content
Log in

The randomized Kaczmarz method with mismatched adjoint

  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

Abstract

This paper investigates the randomized version of the Kaczmarz method to solve linear systems in the case where the adjoint of the system matrix is not exact—a situation we refer to as “mismatched adjoint”. We show that the method may still converge both in the over- and underdetermined consistent case under appropriate conditions, and we calculate the expected asymptotic rate of linear convergence. Moreover, we analyze the inconsistent case and obtain results for the method with mismatched adjoint as for the standard method. Finally, we derive a method to compute optimized probabilities for the choice of the rows and illustrate our findings with numerical examples.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

Notes

  1. If \(\langle a_{i} \,,\, v_{i}\rangle = 0\), Algorithm 1 is not defined and in the case of \(\langle a_{i} \,,\, v_{i}\rangle <0\), the probabilities \(p_{i}\) below in Remark 2.4 would not be non-negative. However, in the case \(\langle a_{i} \,,\, v_{i}\rangle <0\) we could switch the sign of the \(v_{i}\)s, and the expressions in (2.1) and (2.2) would not change).

  2. The code to produce the figures in this article is available at https://github.com/dirloren/rkma.

  3. We could also add a perturbation to A - the numerical results would be rather similar. Setting entries to zero would be numerically beneficial if A would have many small entries, but this was not be the motivation here.

References

  1. Agaskar, A., Wang, C., Lu, Y.M.: Randomized Kaczmarz algorithms: exact MSE analysis and optimal sampling probabilities. In: 2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP), pp. 389–393. IEEE (2014)

  2. De Man, B., Basu, S.: Distance-driven projection and backprojection in three dimensions. Phys. Med. Biol. 49(11), 2463 (2004)

    Article  Google Scholar 

  3. Golub, G.H., Van Loan, C.F.: Matrix Computations, fourth edn. Johns Hopkins Studies in the Mathematical Sciences. Johns Hopkins University Press, Baltimore (2013)

    Google Scholar 

  4. Gordon, R., Bender, R., Herman, G.T.: Algebraic reconstruction techniques (ART) for three-dimensional electron microscopy and X-ray photography. J. Theor. Biol. 29(3), 471–481 (1970)

    Article  Google Scholar 

  5. Hansen, P.C., Saxild-Hansen, M.: AIR tools—a MATLAB package of algebraic iterative reconstruction methods. J. Comput. Appl. Math. 236(8), 2167–2178 (2012)

    Article  MathSciNet  Google Scholar 

  6. Kak, A.C., Slaney, M., Wang, G.: Principles of computerized tomographic imaging. Med. Phys. 29(1), 107–107 (2002)

    Article  Google Scholar 

  7. Liu, J., Wright, S.J., Sridhar, S.: An Asynchronous Parallel Randomized Kaczmarz Algorithm. arXiv:1401.4780 (2014)

  8. Needell, D.: Randomized Kaczmarz solver for noisy linear systems. BIT Numer. Math. 50(2), 395–403 (2010). https://doi.org/10.1007/s10543-010-0265-5

    Article  MathSciNet  MATH  Google Scholar 

  9. Siddon, R.L.: Fast calculation of the exact radiological path for a three-dimensional CT array. Med. Phys. 12(2), 252–255 (1985)

    Article  Google Scholar 

  10. Strohmer, T., Vershynin, R.: A randomized Kaczmarz algorithm with exponential convergence. J. Fourier Anal. Appl. 15(2), 262–278 (2009)

    Article  MathSciNet  Google Scholar 

  11. Watson, G.A.: Characterization of the subdifferential of some matrix norms. Linear Algebra Its Appl. 170, 33–45 (1992)

    Article  MathSciNet  Google Scholar 

  12. Zeng, G.L., Gullberg, G.T.: Unmatched projector/backprojector pairs in an iterative reconstruction algorithm. IEEE Trans. Med. Imaging 19(5), 548–555 (2000)

    Article  Google Scholar 

  13. Zouzias, A., Freris, N.M.: Randomized extended Kaczmarz for solving least squares. SIAM J. Matrix Anal. Appl. 34(2), 773–793 (2013)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

The authors thank Emil Sidky and Per Christian Hansen for valuable discussions and the reviewers for helpful remarks.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Dirk A. Lorenz.

Additional information

Communicated by Lothar Reichel.

This material was based upon work partially supported by the National Science Foundation under Grant DMS-1127914 to the Statistical and Applied Mathematical Sciences Institute. Any opinions, findings, and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the National Science Foundation.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Lorenz, D.A., Rose, S. & Schöpfer, F. The randomized Kaczmarz method with mismatched adjoint. Bit Numer Math 58, 1079–1098 (2018). https://doi.org/10.1007/s10543-018-0717-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10543-018-0717-x

Keywords

Mathematics Subject Classification

Navigation