求解大型稀疏线性方程组的改进IOM算法  

Improved IOM Algorithm for Solving Large Sparse Linear Equations

作　　者：陈晓花 CHEN Xiao-hua(Department of Mathematics,Lanzhou Technology and Business College,Lanzhou 730101,China)

机构地区：[1]兰州工商学院数学部,甘肃兰州730101

出　　处：《辽宁工业大学学报(自然科学版)》2025年第1期67-70,共4页Journal of Liaoning University of Technology(Natural Science Edition)

摘　　要：IOM算法即不完全正交化方法是基于Lanczos双正交过程的求解大型稀疏线性方程组的一种Krylov子空间方法,为克服该方法在计算过程中出现的不规则振荡,提出了改进的IOM算法—WIOM算法,数值算例验证表明改进后的算法具有收敛速度快的优点。IOM algorithm,also known as Incomplete Orthogonalization Method,is a Krylov subspace approach for solving large sparse linear systems of equations based on the Lanczos biorthogonal process.To address the irregular oscillation occurring in computation of this method,an improved IOM algorithm—WIOM algorithm is proposed.Numerical examples demonstrate that the improved algorithm boasts the advantage of rapid convergence.

关 键 词：Lanczos双正交 IOM算法 WIOM算法 

分 类 号：O24[理学—计算数学]