.png){kind=icon}
Return
A modified CG algorithm for solving generalized coupled Sylvester tensor equations
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2019.124699.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, a modified conjugate gradient (MCG) algorithm is proposed for solving generalized coupled Sylverster tensor equations. If the tensor equations are consistent, we show the solution can be obtained within finite steps in the absence of roundoff errors for any initial value. At last, some numerical examples are provided to illustrate the efficiency and validity of the proposed algorithm. (C) 2019 Elsevier Inc. All rights reserved.
Keywords:
Coupled Sylvester tensor equation
Modified CG method
Kronecker (mode) product
Convergence analysis
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.4
Papers:
2.3W
Citations:
3.3W
Organization
Cited Papers
Matrix iterative methods for solving the Sylvester-transpose and periodic Sylvester matrix equations
PREAI
ShareSaveSonochemical synthesis of reduced graphene oxide uniformly decorated with hierarchical ZnS nanospheres and its enhanced photocatalytic activities.png)
RSC Advances
OAAI
RSC AdvancesIF0
OAAIShareSaveShareSave
ShareSaveShareSave
View more