Keywords and phrases: hierarchical identification principal, gradient based iterative method, generalized coupled Sylvester tensor equations, modified gradient based iterative method.
Received: October 29, 2021; Accepted: November 29, 2021; Published: December 8, 2021
How to cite this article: Xing-Jian Ren and Tao Li, Finding iterative algorithms for solving generalized coupled Sylvester tensor equations, JP Journal of Algebra, Number Theory and Applications 53(1) (2022), 45-68. DOI: 10.17654/0972555522003
This Open Access Article is Licensed under Creative Commons Attribution 4.0 International License
References:
[1] J. R. Weaver, Centrosymmetric (cross-symmetric) matrices, their basic properties, eigenvalues, and eigenvectors, Amer. Math. Monthly 92 (1985), 711-717. [2] L. Datta and S. Morgera, Some results on matrix symmetries and a pattern recognition application, IEEE Trans. Signal Process. 34 (1986), 992-994. [3] L. Datta and S. Morgera, On the reducibility of centrosymmetric matrices-applications in engineering problems, Circ. Syst. Signal Process. 8 (1989), 71-96. [4] B. N. Datta, W. Lin and J. N. Wang, Robust partial pole assignment for vibrating systems with aerodynamic effects, IEEE Trans. Automat. Contr. 51(21) (2006), 1979-984. [5] L. Grasedyck, Existence and computation of low Kronecker-rank approximations for large linear systems of tensor product structure, Computing 72(3-4) (2004), 247-265. [6] A. Malek and S. H. Momeni-Masuleh, A mixed collocation-finite difference method for 3D microscopic heat transport problem, J. Comput. Appl. Math. 217(1) (2008), 137-147. [7] Z. Z. Bai, G. H. Golub and M. K. Ng, Hermitian and skew-Hermitian splitting methods for non-Hermitian positive definite linear systems, SIAM J. Matrix Anal. Appl. 24(3) (2003), 603-626. [8] X. T. Li and M. K. Ng, Solving sparse non-negative tensor equations: algorithms and applications, Front. Math. China 10(3) (2015), 649-680. [9] B. W. Li, S. Tian and Y. S. Sun, Schur-decomposition for 3D matrix equations and its application in solving radiative discrete ordinates equations discretized by Chebyshev collocation spectral method, J. Comput. Phys. 229(4) (2010), 1198-1212. [10] F. Ding and T. Chen, Gradient based iterative algorithms for solving a class of matrix equations, IEEE Trans. Automat. Control 50(8) (2005a), 1216-1221. [11] F. Ding and T. Chen, Iterative least squares solutions of coupled Sylvester matrix equations, Syst. Control Lett. 54(2) (2005b), 95-107. [12] F. Ding and T. Chen, Hierarchical least squares identification methods for multivariable systems, IEEE Trans. Auto. Control 50(3) (2005), 397-402. [13] F. Ding and T. Chen, On iterative solutions of general coupled matrix equations, SIAM J. Control Optim. 44(6) (2006), 2269-2284. [14] F. Ding, P. X. Liu and J. Ding, Iterative solutions of the generalized Sylvester matrix equations by using the hierarchical identification principle, Appl. Math. Comput. 197(1) (2008), 41-50. [15] Z. Chen and L. Z. Lu, A gradient based iterative solutions for Sylvester tensor equations, Math. Probl. Eng. 2013 (2013), 1-8. [16] F. P. Ali Beik and S. Ahmadi Asl, Residual norm steepest descent based iterative algorithms for Sylvester tensor equations, J. Math. Model. 2(2) (2015), 115-131. [17] Z. Chen and L. Z. Lu, A projection method and Kronecker product preconditioner for solving Sylvester tensor equations, Sci. China Math. 55(6) (2012), 1281-1292. [18] F. P. Ali Beik, F. S. Movahed and S. Ahmadi-Asl, On the Krylov subspace methods based on tensor format for positive definite Sylvester tensor equations, Linear Algebra Appl. 23(3) (2016), 444-466. [19] M. Najafi-Kalyani, F. P. Ali Beik and K. Jbilou, On global iterative schemes based on Hessenberg process for (ill-posed) Sylvester tensor equations, J. Comput. Appl. Math. 373 (2020), 112216. [20] S. Karimi and M. Dehghan, Global least squares method based on tensor form to solve linear systems in Kronecker format, Trans. Inst. Measure. Control 40(7) (2018), 2378-2386. [21] F. Toutounian and S. Karimi, Global least squares method (GlLSQR) for solving general linear systems with several right-hand sides, Appl. Math. Comput. 178 (2) (2006), 452-460. [22] X. J. Xu and Q. W. Wang, Extending BiCG and BiCR methods to solve the Stein tensor equation, Comput. Math. Appl. 77(12) (2019), 3117-3127. [23] T. Li, Q. W. Wang and X. F. Duan, Numerical algorithms for solving discrete Lyapunov tensor equation, J. Comput. Appl. Math. 370 (2020), 112676, 11 pp. [24] L. Q. Qi and Z. Y. Luo, Tensor Analysis: Spectral Theory and Special Tensors, SIAM, Philadelphia, 2017. [25] L. Q. Qi, Eigenvalues of a real supersymmetric tensor, J. Symbol. Comput. 40(6) (2005), 1302-1324. [26] L. Q. Qi, H. Chen and Y. Chen, Tensor Eigenvalues and their Applications, Springer, 2018. [27] Y. Guan, M. T. Chu and D. L. Chu, SVD-based algorithms for the best rank-1 approximation of a symmetric tensor, SIAM J. Matrix Anal. Appl. 39(3) (2018), 1095-1115. [28] Y. Guan, M. T. Chu and D. L. Chu, Convergence analysis of an SVD-based algorithm for the best rank-1 tensor approximation, Linear Algebra Appl. 555 (2018), 53-69. [29] Y. Guan and D. L. Chu, Numerical computation for orthogonal low-rank approximation of tensors, SIAM J. Matrix Anal. Appl. 40(3) (2019), 1047-1065. [30] T. Kolda and B. Bader, The TOPHITS model for higher-order web link analysis, Workshop on Link Analysis, Counterterrorism Security, Minnesota, 2006, pp. 26-29. [31] T. Kolda and B. Bader, Tensor decompositions and applications, SIAM Rev. 51(3) (2009), 455-500. [32] Z. Z. Bai, G. H. Golub and J. Y. Pan, Preconditioned Hermitian and skew-Hermitian splitting methods for non-Hermitian positive semidefinite linear systems, Numer. Math. 98(1) (2004), 1-32. [33] Z. Z. Bai, G. H. Golub and M. K. Ng, On inexact Hermitian and skew-Hermitian splitting methods for non-Hermitian positive definite linear systems, Linear Algebra Appl. 428(2-3) (2008), 413-440. [34] Y. Saad, Iterative Methods for Sparse Linear Systems, second ed., SIAM, Philadelphia, 2003.
|