IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v408y2021ics0096300321004628.html
   My bibliography  Save this article

A doubly stochastic block Gauss–Seidel algorithm for solving linear equations

Author

Listed:
  • Du, Kui
  • Sun, Xiao-Hui

Abstract

We propose a doubly stochastic block Gauss–Seidel algorithm for solving linear systems of equations. By varying the row partition parameter and the column partition parameter for the coefficient matrix, we recover the Landweber algorithm, the randomized Kaczmarz algorithm, the randomized coordinate descent algorithm, and the doubly stochastic Gauss–Seidel algorithm. For arbitrary (consistent or inconsistent, full column rank or rank-deficient) linear systems, we prove the exponential convergence of the norm of the expected error via exact formulas. We also prove the exponential convergence of the expected norm of the error for consistent linear systems, and the exponential convergence of the expected norm of the residual for arbitrary linear systems. Numerical experiments for linear systems with synthetic and real-world coefficient matrices are given to demonstrate the efficiency of our algorithm.

Suggested Citation

  • Du, Kui & Sun, Xiao-Hui, 2021. "A doubly stochastic block Gauss–Seidel algorithm for solving linear equations," Applied Mathematics and Computation, Elsevier, vol. 408(C).
    • Handle: RePEc:eee:apmaco:v:408:y:2021:i:c:s0096300321004628
    DOI: 10.1016/j.amc.2021.126373
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300321004628
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2021.126373?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. D. Leventhal & A. S. Lewis, 2010. "Randomized Methods for Linear Constraints: Convergence Rates and Conditioning," Mathematics of Operations Research, INFORMS, vol. 35(3), pages 641-654, August.
    2. Chen, Jia-Qi & Huang, Zheng-Da, 2020. "On the error estimate of the randomized double block Kaczmarz method," Applied Mathematics and Computation, Elsevier, vol. 370(C).
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Zhang, Yanjun & Li, Hanyu, 2021. "A count sketch maximal weighted residual Kaczmarz method for solving highly overdetermined linear systems," Applied Mathematics and Computation, Elsevier, vol. 410(C).
    2. Du, Kui, 2024. "Regularized randomized iterative algorithms for factorized linear systems," Applied Mathematics and Computation, Elsevier, vol. 466(C).
    3. Chen, Jia-Qi & Huang, Zheng-Da, 2020. "On the error estimate of the randomized double block Kaczmarz method," Applied Mathematics and Computation, Elsevier, vol. 370(C).
    4. Qin Wang & Weiguo Li & Wendi Bao & Feiyu Zhang, 2022. "Accelerated Randomized Coordinate Descent for Solving Linear Systems," Mathematics, MDPI, vol. 10(22), pages 1-20, November.
    5. Mengdi Wang & Dimitri P. Bertsekas, 2014. "Stabilization of Stochastic Iterative Methods for Singular and Nearly Singular Linear Systems," Mathematics of Operations Research, INFORMS, vol. 39(1), pages 1-30, February.
    6. Ruoyu Sun & Zhi-Quan Luo & Yinyu Ye, 2020. "On the Efficiency of Random Permutation for ADMM and Coordinate Descent," Mathematics of Operations Research, INFORMS, vol. 45(1), pages 233-271, February.
    7. Nicolas Loizou & Peter Richtárik, 2020. "Momentum and stochastic momentum for stochastic gradient, Newton, proximal point and subspace descent methods," Computational Optimization and Applications, Springer, vol. 77(3), pages 653-710, December.
    8. Wu, Nian-Ci & Cui, Ling-Xia & Zuo, Qian, 2022. "On the relaxed greedy deterministic row and column iterative methods," Applied Mathematics and Computation, Elsevier, vol. 432(C).
    9. Zhang, Yanjun & Li, Hanyu, 2023. "Splitting-based randomized iterative methods for solving indefinite least squares problem," Applied Mathematics and Computation, Elsevier, vol. 446(C).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:408:y:2021:i:c:s0096300321004628. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.