摘要
目的研究鞍点问题的迭代方法SOR-LIKE算法的收敛性。方法用矩阵分裂理论,在求解中通过改变矩阵分裂构造出系数矩阵的一般化分裂算法,运用矩阵理论分析该算法的收敛性。结果与结论找到一般分裂算法下的收敛条件,并通过数值实验来检验迭代法的收敛性。
Objective—To solve the saddle point problems of matrix splitting with the SOR-LIKE iterative algorithm.Methods—Herein is constructed a generalized splitting algorithm of the coefficient matrix by changing the matrix splitting in the matrix splitting theory.Results and Conclusion—The convergence conditions of this algorithm is discussed and found.Furthermore,the convergence of iterative methods is tested and verified by numerical experiments.
出处
《宝鸡文理学院学报（自然科学版）》
CAS
2015年第1期1-4,共4页
Journal of Baoji University of Arts and Sciences(Natural Science Edition)
基金
陕西省教育厅科学研究计划项目(No.14JK1052)
陕西省科学研究计划项目(No.2013JM1001)
