摘要
块GMRES算法是求解多右端项线性方程组的经典算法.基于迭代过程中的迭代残量,提出一种基于残量的简化块GMRES算法,有效避免经典算法中块上Hessenberg阵的QR约化过程,比文献(Liu H,Zhong B.Simpler block GMRES for nonsymmetric systems with multiple right-hand sides.Electronic Transactions on Numerical Analysis,2008,30:1-9)提出的简化算法有更好的收敛精度和稳定性.
We investigate the stable version of the simpler block GMRES algo- rithm for solving a class of matrix equations based on the residuals during the iterations. Numerical experiments are conducted to show the better performance of the new block algorithm.
出处
《应用数学与计算数学学报》
2016年第1期51-59,共9页
Communication on Applied Mathematics and Computation
基金
国家自然科学基金资助项目(11001167)
上海市教育委员会科研创新重点资助项目(12ZZ084)
