.png){kind=icon}
返回
A modified gradient based algorithm for solving Sylvester equations
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2011.11.055.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper a modified gradient based algorithm for solving Sylvester equations is presented. Different from the gradient based method introduced by Ding and Chen [7] and the relaxed gradient based algorithm proposed by Niu et al. [18], the information generated in the first half-iterative step is fully exploited and used to construct the approximate solution. Theoretical analysis shows that the new method converges under certain assumptions. Numerical results are given to verify the efficiency of the new method. (C) 2011 Elsevier Inc. All rights reserved.
Keyword:
Sylvester equations
Gradient based algorithm
Modified gradient based algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.4
论文数:
2.3W
被引数:
3.3W
机构
引用论文
Implicitly restarted global FOM and GMRES for nonsymmetric matrix equations and Sylvester equations非对称矩阵方程和Sylvester方程的隐式重启全局FOM和GMRES
PREAI
分享收藏分享收藏Sonochemical synthesis of reduced graphene oxide uniformly decorated with hierarchical ZnS nanospheres and its enhanced photocatalytic activities超声化学合成均匀装饰有分级ZnS纳米球的还原氧化石墨烯及其增强的光催化活性.png)
RSC Advances
OAAI
RSC AdvancesIF0
OAAI分享收藏An implicit preconditioning strategy for large-scale generalized Sylvester equations大规模广义Sylvester方程的隐式预处理策略
PREAI
分享收藏
查看更多内容