|
Abstract
|
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
Pn
j=1 Xj 31Aij1 32Aij2:::3dAijd =Ci, i=1, 2, :::, n. The proposed methods use tensor computations
with no matricizations 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.
|