检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:李旭 李明翔 Li Xu;Li Mingxiang(Department of Applied Mathematics,Lanzhou University of Technology,Lanzhou 730050,China)
出 处:《计算数学》2021年第3期354-366,共13页Mathematica Numerica Sinica
基 金:国家自然科学基金(11501272)资助.
摘 要:对于求解大型稀疏连续Sylvester方程,Bai提出了非常有效的Hermitian和反Hermitian分裂(HSS)迭代法.为了进一步提高求解这类方程的效率,本文建立一种广义正定和反Hermitian分裂(GPSS)迭代法,并且提出不精确GPSS(IGPSS)迭代法从而可以降低计算成本.对GPSS迭代法及其不精确变体的收敛性作了详细分析.另外,建立一种超松弛加速GPSS(AGPSS)方法并且讨论了收敛性.数值结果表明了方法的高效性和鲁棒性.Bai proposed an efficient Hermitian and skew-Hermitian splitting(HSS)iteration method for solving a broad class of large sparse continuous Sylvester equations.To further improve the efficiency,in this paper we present a generalized positive-definite and skew-Hermitian splitting(GPSS)iteration method for this matrix equation.Then we establish the inexact variant of the GPSS(IGPSS)it eration method which can reduce the computational cost.Convergence properties of the GPSS iteration met hod and its inexac t variant are analyzed in detail.Moreover,an SOR accelerated GPSS(AGPSS)method is established and its convergence behavior is discussed.Numerical results illustrate the efficiency and robustness of our methods.
关 键 词:连续Sylvester方程 GPSS迭代 不精确迭代 SOR加速 收敛性分析
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.145.85.3