一类关于IDP-SOR方法的鞍点问题(英文)  

A Class of IDP-SOR Method of Saddle Point Problem

作　　者：程军[1] 张应奎[1] 张莉君[2] 

机构地区：[1]曲靖师范学院教师教育学院,云南曲靖655011 [2]云南大学数学与统计学院,云南昆明650091

出　　处：《怀化学院学报》2010年第11期29-31,共3页Journal of Huaihua University

摘　　要：针对大型稀疏鞍点问题给出了一种新的迭代解法,该方法的构成是基于对系数矩阵进行的一种分裂,A∈Rn×n是对称正定矩阵.利用不完全分解法分解A为LLT+R,通过适当选取预处理矩阵和待定系数,证明该迭代法是收敛的,并且以定理的形式给出了新迭代法收敛的充分必要条件.A new iterative solution is proposed to solve the problem of large-scale saddle point problem.Based on a splitting for the matrix of coefficients which A∈Rn×n is symmetric positive definite in coefficient matrix,using the incomplete decomposition method which split A to LLT＋R,after choosing a pretreated matrix and undermined parameters,the converence of the iteration is proved and sufficient and necessary conditions of the new iteration method proposed becomes convergent in form of theorem.

关 键 词：鞍点 对称正定矩阵 矩阵分裂 收敛性 

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