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

A block upper triangular splitting method for solving block three-by-three linear systems arising from the large indefinite least squares problem

Author

Listed:
  • Li, Jun
  • Xin, Kailiang
  • Meng, Lingsheng

Abstract

In this research, we mainly utilize the stationary iteration method in conjunction with Krylov subspace techniques, such as GMRES, to tackle the large indefinite least squares problem. To accomplish this, the normal equation of the large indefinite least squares problem is firstly transformed into the sparse block three-by-three linear systems with non-singular diagonal blocks, then a block upper triangular matrix splitting of the coefficient matrix of the block three-by-three linear systems is given, the splitting not only produces the stationary iteration method, but also naturally derives a preconditioner, which can be used within GMRES method to solve the block linear systems. Thereafter, it is proved theoretically that the iteration method has unconditional convergence. Furthermore, the theory also shows that all the eigenvalues of the preconditioned matrix are real number and located in a positive interval. In the end, numerical results reflect that the theoretical results are correct and the studied methods are also effective.

Suggested Citation

  • Li, Jun & Xin, Kailiang & Meng, Lingsheng, 2025. "A block upper triangular splitting method for solving block three-by-three linear systems arising from the large indefinite least squares problem," Applied Mathematics and Computation, Elsevier, vol. 505(C).
    • Handle: RePEc:eee:apmaco:v:505:y:2025:i:c:s0096300325002723
    DOI: 10.1016/j.amc.2025.129546
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300325002723
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2025.129546?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:505:y:2025:i:c:s0096300325002723. 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.