IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v531y2026ics009630032600278x.html

Gradient adaptive parameter method for coupled matrix equations with applications in transient heat conduction problem and image steganography

Author

Listed:
  • Shirilord, Akbar
  • Dehghan, Mehdi

Abstract

In the realm of engineering, one frequently encounters coupled linear matrix equations. In this work, based on the study in [1] a new gradient-based parameter free iterative scheme is presented to find solutions for a coupled matrix equations. The proposed iterative method has been proven to attain solutions for the general coupled matrix equations, regardless of the initial matrices. In the following some applications for generalized Sylvester matrix equation such as solving transient heat conduction problem by moving least squares (MLS) scheme as trial approximation in time and space and a new novel transform domain steganography technique-hiding an image message in a high order vector are studied. Lastly, computational experiments are presented to illustrate that the introduced iterative algorithm with optimal parameter selection outperforms the gradient-based iterative scheme in terms of speed, number of iterates, and elapsed times.

Suggested Citation

  • Shirilord, Akbar & Dehghan, Mehdi, 2026. "Gradient adaptive parameter method for coupled matrix equations with applications in transient heat conduction problem and image steganography," Applied Mathematics and Computation, Elsevier, vol. 531(C).
    • Handle: RePEc:eee:apmaco:v:531:y:2026:i:c:s009630032600278x
    DOI: 10.1016/j.amc.2026.130226
    as

    Download full text from publisher

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

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:531:y:2026:i:c:s009630032600278x. 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.