期刊文献+

一类复对称线性方程组的单步HSS迭代法 被引量:2

Single-step HSS methods for a class of complex symmetric linear systems
在线阅读 下载PDF
导出
摘要 基于修正的埃尔米特和反埃尔米特分裂(MHSS)及预处理的MHSS(PMHSS)迭代法,提出了关于一类复对称线性方程组的单步MHSS(SMHSS)和单步PMHSS(SPMHSS)迭代法,进一步利用优化技巧给出了位移参数的动态选择格式,得出相应的带有灵活位移的SMHSS方法及SPMHSS迭代法.理论分析表明,迭代参数α在较弱的约束条件下,SMHSS迭代法收敛于复对称线性方程组的唯一解.同时,得到了SMHSS迭代矩阵的谱半径的上界,并且求得使上述上界最小的最优参数α~*.进一步给出了SPMHSS方法的收敛性分析.MHSS法和SMHSS迭代法之间的数值比较表明,在某些情况下,SMHSS迭代法比MHSS迭代法更优. Based on the modified Hermitian and skew-Hermitian splitting (MHSS) and preconditioned MHSS (PMHSS) iteration methods, we present a single-step MHSS (SMHSS) and a single-step PMHSS (SPMHSS) iteration methods for a class of complex symmetric linear systems. The format of choosing a flexible shift- parameter is given by utilizing the optimization technique, and then we obtain the corresponding SMHSS and SPMHSS iteration methods with a flexible shift- parameter. Theoretical analysis shows that, under a weaker constraint condition on the iteration parameter , the SMHSS iteraton method is convergent to the unique solution of complex symmetric linear systems. Meanwhile, we derive an up- per bound for spectral radius of the SMHSS iteration matrix, and the quasi-optimal parameter is obtained by minimizing the above upper bound. Furthermore, theconvergence analysis of the SPMHSS iteration methods is given. Numerical ex- periments are reported to verify the efficiencies of several methods. Consequent comparisons show that the proposed SMHSS method is superior to the MHSS method under certain conditions.
出处 《应用数学与计算数学学报》 2017年第2期200-212,共13页 Communication on Applied Mathematics and Computation
基金 国家自然科学基金资助项目(11371275) 山西省自然科学基金资助项目(201601D011004)
关键词 复对称线性方程组 MHSS迭代法 收敛性 最优化 complex symmetric linear systems modified Hermitian and skew-Hermitian splitting (MHSS) iteration method convergence optimization
  • 相关文献

参考文献1

二级参考文献19

  • 1Benzi M, Golub G H, Liesen J. Numerical solution of saddle point problems[J]. Acta Nu- merica, 2005, 14: 1-137.
  • 2Li Changjun, Li Baojia, Evans D J. A generalized successive overrelaxation method for least sauares problems[J1. BIT. 1998. 38. 347-356.
  • 3Bramble J H, Pasciak J E, Vassilev A T. Analysis of the inexact Uzawa algorithm for saddle point problem[J]. SIAM J Numer Anal, 1997, 34(3): 1072-1092.
  • 4Bai Zhongzhi, Wang Zengqi. On parameterized inexact Uzawa methods for generalized saddle point problems[J]. Linear Algebra Appl, 2008, 428: 2900-2932.
  • 5Golub G H, Wu X, Yuan J Y. SOR-like methods for augmented systems[J]. BIT, 2001, 41: 71-85.
  • 6Bai Zhongzhi, Parlett B N, Wang Zengqi. On generalized successive overrelaxation methods for augmented linear systems[J]. Numer Math, 2005, 102: 1-38.
  • 7Li Jicheng, Xu Kong. Optimum parameters of GSOR-like methods for the augmented sys- tems[J]. Appl Math Comput, 2008, 204(1): 150-161.
  • 8Bai Zhongzhi, Golub G H, Ng M K. Hermitian and skew-Hermitian splitting methods for non-Hermitian positive definite linear systems. SIAM J Matrix Anal Appl, 2003, 24: 603-626.
  • 9Bai Zhongzhi, Golub G H, Pan Jianyu. Preconditioned Hermitian and skew-Hermitian splitting methods for non-Hermitian positive definite linear systems[J]. Numer Math, 2004, 98:1-32.
  • 10Bai Zhongzhi, Golub G H. Accelerated Hermitian and skew-Hermitian splitting methods for saddle point problems[J]. IMA J Numer Anal 2007, 27:1-23.

共引文献8

同被引文献8

引证文献2

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部