一种求解非对称线性方程组的JBICR算法  

A JBICR Method for Solving Nonsymmetric Linear Systems

作　　者：刘广西 张衡 

机构地区：[1]福建师范大学数学与信息学院,福建福州350117 [2]福建师范大学福清分校电子与信息工程学院,福建福清350300

出　　处：《福建师范大学学报（自然科学版）》2018年第2期12-15,共4页Journal of Fujian Normal University：Natural Science Edition

基　　金：福建省自然科学基金资助项目(2014J01006)

摘　　要：针对求解大型稀疏非对称线性方程组,研究了大规模稀疏线性方程组的预条件迭代求解算法.结合Krylov子空间方法和Jacobi迭代,给出了一个新的求解算法,即预处理雅可比-双共轭残量法(简称JBICR),同时给出了算法的收敛性分析.数值实验显示了算法的快速收敛性.In this paper, the preconditioning iterative method of large sparse linear systems has been considered for large spare linear systems with unsymmetrical coefficient matrices. Combining Krylov subspace methods with Jacobi iteration, a new algorithm of the preconditioning Jaeobi- biconjngate residual algorithm （ JBICR , in brief） has been proposed. Meanwhile, the convergence analysis has been presented. The numerical experiments showed that the new algorithm exhibited fast convergence performance.

关 键 词：大型稀疏线性方程组 JACOBI迭代 Krylov子空间法 BiCR算法 

分 类 号：O241.6[理学—计算数学]