IDEAS home Printed from https://ideas.repec.org/a/spr/snopef/v2y2021i4d10.1007_s43069-021-00107-7.html
   My bibliography  Save this article

Iterative Methods for Solving Sylvester Transpose Tensor Equation $$~\mathcal A\star _N\mathcal X\star _M\mathcal {B}+\mathcal {C}\star _M\mathcal X^T\star _N\mathcal {D}=\mathcal {E}$$ A ⋆ N X ⋆ M B + C ⋆ M X T ⋆ N D = E

Author

Listed:
  • Eisa Khosravi Dehdezi

    (Persian Gulf University)

Abstract

In recent years, solving tensor equations has attracted the attention of mathematicians in applied mathematics. This paper investigated the gradient-based and gradient-based least-squares iterative algorithms to solve the Sylvester transpose tensor equation $$\mathcal A\star _N\mathcal X\star _M\mathcal {B}+\mathcal {C}\star _M\mathcal X^T\star _N\mathcal {D}=\mathcal {E}$$ A ⋆ N X ⋆ M B + C ⋆ M X T ⋆ N D = E . These algorithms use tensor computations with no matricizations involved which includes the Sylvester transpose matrix equation as special case. The first algorithm is applied when the tensor equation is consistent. Error convergence analysis of the proposed methods has been discussed. For inconsistent Sylvester transpose tensor equation, the gradient-based least-squares iterative method is presented. Modified versions of these algorithms are obtained by little changes. Also, it is showed that for any initial tensor, a solution of related problems can be obtained within finite iteration steps in the absence of round-off errors. In addition, the computational cost of the methods is obtained. The effectiveness of these procedures are illustrated by several numerical examples. Finally, some concluding remarks are given.

Suggested Citation

  • Eisa Khosravi Dehdezi, 2021. "Iterative Methods for Solving Sylvester Transpose Tensor Equation $$~\mathcal A\star _N\mathcal X\star _M\mathcal {B}+\mathcal {C}\star _M\mathcal X^T\star _N\mathcal {D}=\mathcal {E}$$ A ⋆ N X ⋆ M B ," SN Operations Research Forum, Springer, vol. 2(4), pages 1-21, December.
  • Handle: RePEc:spr:snopef:v:2:y:2021:i:4:d:10.1007_s43069-021-00107-7
    DOI: 10.1007/s43069-021-00107-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s43069-021-00107-7
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s43069-021-00107-7?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. Huang, Baohua & Ma, Changfeng, 2020. "Global least squares methods based on tensor form to solve a class of generalized Sylvester tensor equations," Applied Mathematics and Computation, Elsevier, vol. 369(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. Qi, Zhaohui & Ning, Yingqiang & Xiao, Lin & Luo, Jiajie & Li, Xiaopeng, 2023. "Finite-time zeroing neural networks with novel activation function and variable parameter for solving time-varying Lyapunov tensor equation," Applied Mathematics and Computation, Elsevier, vol. 452(C).
    2. Xiao, Lin & Li, Xiaopeng & Jia, Lei & Liu, Sai, 2022. "Improved finite-time solutions to time-varying Sylvester tensor equation via zeroing neural networks," Applied Mathematics and Computation, Elsevier, vol. 416(C).
    3. Zhang, Xin-Fang & Wang, Qing-Wen, 2021. "Developing iterative algorithms to solve Sylvester tensor equations," Applied Mathematics and Computation, Elsevier, vol. 409(C).
    4. Khosravi Dehdezi, Eisa & Karimi, Saeed, 2022. "A rapid and powerful iterative method for computing inverses of sparse tensors with applications," Applied Mathematics and Computation, Elsevier, vol. 415(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:spr:snopef:v:2:y:2021:i:4:d:10.1007_s43069-021-00107-7. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.