漆志鹏, 江慎铭. Krylov子空间算法研究[J]. 南昌航空大学学报(自然科学版), 2006, 20(2): 1-4.
引用本文: 漆志鹏, 江慎铭. Krylov子空间算法研究[J]. 南昌航空大学学报(自然科学版), 2006, 20(2): 1-4.
QI Zhi-peng, JIANG Shen-ming. Study of Krylov subspace algorithm[J]. Journal of nanchang hangkong university(Natural science edition), 2006, 20(2): 1-4.
Citation: QI Zhi-peng, JIANG Shen-ming. Study of Krylov subspace algorithm[J]. Journal of nanchang hangkong university(Natural science edition), 2006, 20(2): 1-4.

Krylov子空间算法研究

Study of Krylov subspace algorithm

  • 摘要: Krylov子空间技术是基于投影方法的规划算法,如今已成为一类求解大规模线性问题的优秀算法,该算法采用正投影或斜投影在子空间产生迭代向量进行计算.同时,正确有效的预处理方法能加快迭代收敛.本文介绍了如何利用基于LU分解的GMRES(Generalized Minimum Residual)方法来求解大规模线性优化问题.

     

    Abstract: Krylov subspace methods are considered currently to be among the most important iterative techniques available for solving large-scale linear systems.These techniques are based on projection process,both orthogonal and oblique,onto Krylov subspaces.The efficient preconditioned methods will accelerate the convergence of the algorithm.This paper introduces how to solve large scale linear problems by GMRES based on LU factorizatinos.

     

/

返回文章
返回