摘要
文献[1]提出了不完全Cholesky分解共轭梯度法(Incomplete Cholesky——Conjugate Gradient method),即ICCG方法.在实际应用中,常常要解复数域中的线性代数方程组.为此本文给出了用ICCG法解复线性方程组的三种迭代格式,并给出一种实际存储方法.计算表明,ICCG法的收敛速度较高斯消去法快,并且存储量可大大减少.对解高阶稀疏的线性方程组,此方法更能体现其优越性.
The reference [1] proposed an Incomplete Cholesky-Conjugate Gradient method referred to as ICCG. Since complex linear systems are often needed to solve in many fields. Three iterative algorithms and a saving method for complex ICCG method are provided in this paper. The ICCG method converges faster than Gaussian elimination and it's storage is much less than Gaussian elimination. The method is better for higher order and sparseness patter systems.
关键词
代数方程
复线性方程
ICCG
算法
incomplete cholesky-conjugate gradient method
the solution of complex linear systems
