Journal
JOURNAL OF THE FRANKLIN INSTITUTE-ENGINEERING AND APPLIED MATHEMATICS
Volume 359, Issue 18, Pages 10688-10725Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.jfranklin.2022.07.051
Keywords
-
Categories
Funding
- National Natural Science Foundation of China [12001211, 12071159, 12171168]
- Natural Science Foundation of Fujian Province, China [2022J01194]
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available