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

A numerical method on the mixed solution of matrix equation ∑i=1tAiXiBi=E with sub-matrix constraints and its application

Author

Listed:
  • Qu, Hongli
  • Xie, Dongxiu
  • Xu, Jie

Abstract

We put forward and analyze in details an iterative method to find the mixed solutions of a matrix equation with sub-matrix constraints. The convergence of the approximated solution sequence generated by the iterative method is investigated, showing that if the constrained matrix equation is consistent, the mixed solution group can be obtained after a finite number of iterations. Moreover, for a given matrix, its best approximation is obtained, which is the mixed solution of the matrix equation with sub-matrix constraints. Finally, a large number of numerical experiments are carried out, and results show that the algorithm is effective not only in image restoration, but also in the general case for both small-scale and large-scale matrices.

Suggested Citation

  • Qu, Hongli & Xie, Dongxiu & Xu, Jie, 2021. "A numerical method on the mixed solution of matrix equation ∑i=1tAiXiBi=E with sub-matrix constraints and its application," Applied Mathematics and Computation, Elsevier, vol. 411(C).
  • Handle: RePEc:eee:apmaco:v:411:y:2021:i:c:s009630032100549x
    DOI: 10.1016/j.amc.2021.126460
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S009630032100549X
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.amc.2021.126460?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. Masoud Hajarian, 2016. "Least Squares Solution of the Linear Operator Equation," Journal of Optimization Theory and Applications, Springer, vol. 170(1), pages 205-219, July.
    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. Hu, Jingjing & Ma, Changfeng, 2018. "Conjugate gradient least squares algorithm for solving the generalized coupled Sylvester-conjugate matrix equations," Applied Mathematics and Computation, Elsevier, vol. 334(C), pages 174-191.
    2. Huang, Baohua & Ma, Changfeng, 2018. "An iterative algorithm for the least Frobenius norm least squares solution of a class of generalized coupled Sylvester-transpose linear matrix equations," Applied Mathematics and Computation, Elsevier, vol. 328(C), pages 58-74.
    3. Baohua Huang & Changfeng Ma, 2019. "The least squares solution of a class of generalized Sylvester-transpose matrix equations with the norm inequality constraint," Journal of Global Optimization, Springer, vol. 73(1), pages 193-221, January.

    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:411:y:2021:i:c:s009630032100549x. 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.