期刊
JOURNAL OF THE FRANKLIN INSTITUTE-ENGINEERING AND APPLIED MATHEMATICS
卷 359, 期 18, 页码 10688-10725出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.jfranklin.2022.07.051
关键词
-
类别
资金
- National Natural Science Foundation of China [12001211, 12071159, 12171168]
- Natural Science Foundation of Fujian Province, China [2022J01194]
This paper proposes full-rank and reduced-rank relaxed gradient-based iterative algorithms for solving the generalized coupled Sylvester-transpose matrix equations. The necessary and sufficient condition for the convergence of the proposed iterative algorithm is analytically provided, and the optimal step size is explicitly given to maximize the convergence rate of the algorithm. Numerical examples are examined to confirm the feasibility and efficiency of the proposed algorithms.
In this paper, we propose the full-rank and reduced-rank relaxed gradient-based iterative algorithms for solving the generalized coupled Sylvester-transpose matrix equations. We provide analytically the necessary and sufficient condition for the convergence of the proposed iterative algorithm and give explicitly the optimal step size such that the convergence rate of the algorithm is maximized. Some numerical examples are examined to confirm the feasibility and efficiency of the proposed algorithms. (c) 2022 The Franklin Institute. Published by Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据