陈学松(教授)

硕士生导师

所在单位:数学与统计学院

性别:男

在职信息:在职

学科:计算数学
运筹学与控制论
应用数学

当前位置: 中文主页 >> 科学研究 >> 论文列表

Modification on the convergence results of the Sylvester matrix equation AX+XB=C

点击次数:

DOI码:10.1016/j.jfranklin.2022.02.021

发表刊物:Journal of the Franklin Institute

关键字:Gradient iterative, Sylvester matrix equation, iterative factor, relaxed gradient iterative, modified gradient iterative

摘要:In this paper, we investigate some convergence results of the gradient based iterative algorithm for solving the Sylvester matrix equation $AX+XB=C$. We first review  the development of the gradient based iterative algorithm and correct mistakes of some convergence results. Then, the idea of "two iterative factors" is applied to propose some new relaxed gradient iterative algorithms to improve the convergence performance of their previous algorithms. Finally, some numerical examples are taken to illustrate the correctness of the concluded results.

第一作者:Zebin Chen

论文类型:期刊论文

通讯作者:Xuesong Chen

卷号:359

期号:7

页面范围:3126-3147

是否译文:

发表时间:2022-05-01

收录刊物:SCI

发布期刊链接:https://doi.org/10.1016/j.jfranklin.2022.02.021

附件:

  • FI-2022-published.pdf

  • 上一条: A global convergent semi-smooth Newton method for semi-linear elliptic optimal control problem 下一条: A note on "Solving the general Sylvester discrete-time periodic matrix equations via the gradient based iterative method"