Skip to main content
SpringerLink
Log in

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}\)

  • Original Research
  • Published:
Operations Research Forum Aims and scope Submit manuscript

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}\). 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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

Data Availability

The author confirms that the data supporting the findings of this paper are available within the article [and/or] its supplementary material.

References

  1. Kolda TG, Bader BW (2009) Tensor decompositions and applications. SIAM Rev 51:455–500

    Article  Google Scholar 

  2. Qi L, Luo Z (2017) Tensor Analysis: Spectral Theory and Special Tensors. SIAM Philadelphia

  3. Brazell M, Li N, Navasca C et al (2013) Solving multilinear systems via tensor inversion. SIAM J Matrix Anal Appl 34(2):542–570

    Article  Google Scholar 

  4. Ding W, Wei Y (2016) Solving multi-linear system with -tensors. J Sci Comput 68:689–715

    Article  Google Scholar 

  5. Sun L, Zheng B, Bu C, Wei Y (2016) Moore-Penrose inverse of tensors via Einstein product. Linear Multilinear Algebra 64:686–698

    Article  Google Scholar 

  6. Lai W, Rubin D, Krempl E (2009) Introduction to continuum mechanics. Butterworth-Heinemann, Oxford

    Google Scholar 

  7. Wang QW, Xu X (2019) Iterative algorithms for solving some tensor equations. Linear Multilinear Algebra 67(7):1325–1349

    Article  Google Scholar 

  8. Huang B, Xie Y, Ma C (2019) Krylov subspace methods to solve a class of tensor equations via the Einstein product. Numer Linear Algebra Appl 40(4):e2254

  9. Huang B, Ma C (2020) An iterative algorithm to solve the generalized Sylvester tensor equations. Linear Multilinear Algebra 68(6):1175–1200

    Article  Google Scholar 

  10. Huang B, Ma C (2020) Global least squares methods based on tensor form to solve a class of generalized Sylvester tensor equations. Appl Math Comput 369:124892

  11. Liang L, Zheng B, Zhao RJ (2018) Tensor inversion and its application to the tensor equations with Einstein product. Linear Multilinear Algebra 67:843–870

    Article  Google Scholar 

  12. Ding F, Chen T (2005a) Gradient based iterative algorithms for solving a class of matrix equations. IEEE Trans Autom Control 50:1216–1221

  13. Ding F, Chen T (2005b) Iterative least squares solutions of coupled Sylvester matrix equations. Syst Control Lett 54:95–107 

  14. Golub GH, Van Loan CF (1979) A Hessenberg-Schur method for the problem \(AX + XB = C\). IEEE Trans Auto Control 24:909–913

    Article  Google Scholar 

  15. Grasedyck L (2004) Existence and computation of low Kronecker-rank approximations for large linear systems of tensor product structure. Computing 72:247–265

    Google Scholar 

  16. Xie ZJ, Jin XQ, Sin VK (2020) An optimal preconditioner for tensor equations involving Einstein product. Linear Multilinear Algebra 68(5):886–902

    Article  Google Scholar 

  17. Cui LB, Chen C, Li W, Ng M (2016) An eigenvalue problem for even order tensors with its applications. Linear Multilinear Algebra 64:602–621

    Article  Google Scholar 

  18. Liu X, Wang L, Wang J, Meng H (2012) A three-dimensional point spread function for phase retrieval. Opt Express 20:15392–15405

    Article  Google Scholar 

  19. Khosravi Dehdezi E, Karimi S (2021) Extended conjugate gradient squared and conjugate residual squared methods for solving the generalized coupled Sylvester tensor equations. T I Meas Control 43(3):519–527

    Article  Google Scholar 

  20. Khosravi Dehdezi E, Karimi S (2021) A fast and efficient Newton-Shultz-type iterative method for computing inverse and Moore-Penrose inverse of tensors. J Math Model. https://doi.org/10.22124/jmm.2021.19005.1627

  21. Khosravi Dehdezi E, Karimi S (2021) A gradient based iterative method and associated preconditioning technique for solving the large multilinear systems, Calcolo. https://doi.org/10.1007/s10092-021-00438-1

  22. Khosravi Dehdezi E, Karimi S (2021) A rapid and powerful iterative method for computing inverses of sparse tensors with applications. Appl Math Comput. https://doi.org/10.1016/j.amc.2021.126720

  23. Behera R, Mishra D (2017) Further results on generalized inverses of tensors via the Einstein product. Linear Multilinear Algebra 65:1662–1682

    Article  Google Scholar 

  24. Karimi S, Dehghan M (2018) Global least squares method based on tensor form to solve linear systems in Kronecker format. T I Meas Control 40:2378–2386

    Article  Google Scholar 

  25. Horn RA, Johnson CR (1991) Topics in Matrix Analysis. Cambridge University Press

  26. Golub GH, Van Loan CF (2012) Matrix Computations (4th edn). Johns Hopkins University Press

  27. Bader BW, Kolda TG (2007) Efficient MATLAB computations with sparse and factored tensors. SIAM J Sci Comput 30(1):205–231

    Article  Google Scholar 

  28. Bader BW, Kolda TG (2010) MATLAB tensor toolbox, version 2.6. Available online at https://www.tensortoolbox.org

Download references

Acknowledgements

I would like to thank anonymous referees for their comments and suggestions, which helped me to considerably improve the manuscript.

Funding

The author received no financial support for the research, authorship, and/or publication of this article.

Author information

Authors and Affiliations

  1. Department of Mathematics, Faculty of Intelligent Systems Engineering and Data Science, Persian Gulf University, Bushehr, Iran

    Eisa Khosravi Dehdezi

Authors
  1. Eisa Khosravi Dehdezi
    View author publications

    You can also search for this author in PubMed Google Scholar

Ethics declarations

Conflict of Interest

The author declared no potential conflicts of interest with respect to the research, authorship, and/or publication of this article.

Additional information

Publisher’s Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Dehdezi, E.K. 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}\). Oper. Res. Forum 2, 64 (2021). https://doi.org/10.1007/s43069-021-00107-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s43069-021-00107-7

Keywords

Search

Navigation