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

Regularized randomized iterative algorithms for factorized linear systems

Author

Listed:
  • Du, Kui

Abstract

Randomized iterative algorithms for solving the factorized linear system, ABx=b with A∈Rm×ℓ, B∈Rℓ×n, and b∈Rm, have recently been proposed. They take advantage of the factorized form and avoid forming the matrix C=AB explicitly. However, they can only find the minimum norm (least squares) solution. In contrast, the regularized randomized Kaczmarz (RRK) algorithm can find solutions with certain structures from consistent linear systems. In this work, by combining the randomized Kaczmarz algorithm or the randomized Gauss–Seidel algorithm with the RRK algorithm, we propose two new regularized randomized iterative algorithms to find (least squares) solutions with certain structures of ABx=b. We prove linear convergence of the new algorithms. Computed examples are given to illustrate that the new algorithms can find sparse (least squares) solutions of ABx=b and can be better than the existing randomized iterative algorithms for the corresponding full linear system Cx=b with C=AB.

Suggested Citation

  • Du, Kui, 2024. "Regularized randomized iterative algorithms for factorized linear systems," Applied Mathematics and Computation, Elsevier, vol. 466(C).
    • Handle: RePEc:eee:apmaco:v:466:y:2024:i:c:s0096300323006379
    DOI: 10.1016/j.amc.2023.128468
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300323006379
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2023.128468?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.

    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:466:y:2024:i:c:s0096300323006379. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.