期刊
JOURNAL OF THE FRANKLIN INSTITUTE-ENGINEERING AND APPLIED MATHEMATICS
卷 355, 期 6, 页码 3168-3195出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.jfranklin.2018.02.014
关键词
-
In this paper, two relaxed gradient-based iterative algorithms for solving a class of generalized coupled Sylvester-conjugate matrix equations are proposed. The proposed algorithm is different from the gradient-based iterative algorithm and the modified gradient-based iterative algorithm that are recently available in the literature. With the real representation of a complex matrix as a tool, the sufficient and necessary condition for the convergence factor is determined to guarantee that the iterative solution given by the proposed algorithms converge to the exact solution for any initial matrices. Moreover, some sufficient convergence conditions for the suggested algorithms are presented. Finally, numerical example is provided to illustrate the effectiveness of the proposed algorithms and testify the conclusions suggested in this paper. (C) 2018 The Franklin Institute. Published by Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据