In this paper, two attractive iterative methods – conjugate gradient squared (CGS) and conjugate residual squared (CRS) – are extended to solve the generalized coupled Sylvester tensor equations . The proposed methods use tensor computations with no maricizations involved. Also, some properties of the new methods are presented. Finally, several numerical examples are given to compare the efficiency and performance of the proposed methods with some existing algorithms.
BaiZZGolubGHNGMK (2003) Hermitian and skew-hermitian splitting methods for non-hermitian positive definite linear systems. SIAM Journal on Matrix Analysis and Applications24(3): 603–626.
2.
BeikFPAAhmadi AslA (2015) Residual norm steepest descent based iterative algorithms for Sylvester tensor equations. Journal of Mathematical Modeling2(2): 115–131.
3.
BeikFPASaberi MovahedSAhmadi AslA (2016) On the Krylov subspace methods based on tensor format for positive definite Sylvester tensor equations. Numerical Linear Algebra with Applications23(3): 444–466.
4.
BrazellMLiNNavascaC, et al. (2013) Solving multilinear systems via tensor inversion. SIAM Journal on Matrix Analysis and Applications34(2): 542–570.
5.
ChenDYinFHuangG-X (2012) An iterative algorithm for the generalized reflexive solution of the matrix equations AXB = E, CXD = F. Journal of Applied Mathematics2012(3): 1–20.
6.
ChenZLuLZ (2012) A projection method and Kronecker product preconditioner for solving Sylvester tensor equations. Science China Mathematics55(6): 1281–1292.
7.
DingFChenT (2005a) Gradient based iterative algorithms for solving a class of matrix equations. IEEE Transactions on Automatic Control50(8): 1216–1221.
8.
DingFChenT (2005b) Iterative least squares solutions of coupled Sylvester matrix equations. Systems and Control Letters54(2): 95–107.
9.
GrasedyckL (2004) Existence and computation of low Kronecker-rank approximations for large linear systems of tensor product structure. Computing72(3–4): 247–265.
10.
GolubGHNashSVan LoanC (1978) A Hessenberg-Schur method for the problem AX + XB = C. IEEE Transactions on Automatic Control24(6): 909–913.
11.
KagströmBWestinL (1989) Generalized Schur methods with condition estimators for solving the generalized Sylvester equation. IEEE Transactions on Automatic Control34(7): 745–751.
12.
KarimiSDehghanM (2018) Global least squares method based on tensor form to solve linear systems in Kronecker format. Transactions of the Institute of Measurement and Control40(7): 2378–2386.
13.
KoldaTG (2006) Multilinear operators for higher-order decompositions. Tech. Report SAND2006–2081.
14.
KoldaTGBaderBW (2009) Tensor decompositions and applications. SIAM Review51(3): 455–500.
15.
LiBWSunY-SZhangD-W (2009) Chebyshev collocation spectral methods for coupled radiation and conduction in a concentric spherical participating medium. ASME Journal of Heat Transfer131(6): 062701 (9 pages).
16.
LiBWTianSSunYS, et al. (2010) Schur-decomposition for 3D matrix equations and its application in solving radiative discrete ordinates equations discretized by Chebyshev collocation spectral method. Journal of Computational Physics229(4): 1198–1212.
17.
PaigeCCSaundersMA (1982) LSQR: an algorithm for sparse linear equations and sparse least squares. ACM Transactions on Mathematical Software8(1): 43–71.
18.
SaadY (2003) Iterative Methods for Sparse Linear Systems, 2nd Edn.Philadelphia: SIAM.
19.
ShiXWeiYLingS (2013) Backward error and perturbation bounds for high order Sylvester tensor equation. Linear and Multilinear Algebra61(10): 1436–1446.
20.
SonneveldP (1989) CGS, a fast Lanczos-type solver for nonsymmetric linear systems. SIAM Journal on Scientific and Statistical Computing10(1): 36–52.
21.
SunLZhengBBuCWeiY (2016) Moore penrose inverse of tensors via Einstein product. Linear and Multilinear Algebra64(4): 686–698.
22.
XuXWangaQ-W (2019) Extending Bi-CG and Bi-CR methods to solve the Stein tensor equation. Computers and Mathematics with Applications77(12): 3117–3127.
