广义鞍点问题的改进的类SOR算法  

AN IMPROVED SOR-TYPE ALGORITHM FOR SLOVING GENERALIZED SADDLE-POINT PROBLEMS

作　　者：张纯[1,2] 贾泽慧 蔡邢菊 韩德仁[4] Zhang Chun;Jia Zehui;Cai Xingju;Han Deren(School of Mathematical Sciences,Nanjing Normal University,Nanjing 210023,China;Department of Basic Courses,The PL A Army Engineering University,Nanjing 211101,China;School of Mathematics and Statistics,Nanjing University of Information Science&Technology,Nanjing 210044,China;School of Mathematical Sciences,Beihang University,Beijing 100191,China)

机构地区：[1]南京师范大学数学科学学院,南京210023 [2]中国人民解放军陆军工程大学基础部,南京211101 [3]南京信息工程大学数学与统计学院,南京210044 [4]北京航空航天大学数学科学学院,北京100191

出　　处：《计算数学》2020年第1期39-50,共12页Mathematica Numerica Sinica

基　　金：国家自然科学基金(11625105,11926358,11871279,11571178,11801279);江苏省自然科学基金(BK2018078);南京信息工程大学科研启动基金(2017r059)。

摘　　要：针对广义鞍点问题,本文提出了一个改进的类逐次超松弛迭代算法,在较弱的条件下,分析了算法的收敛性及线性收敛率.新算法的每步计算量与已有的算法类似,都是需要(近似)求解线性方程组,但新算法有更好的灵活度通过合适地选取参数矩阵,每一步子问题可以容易地求解,甚至可以有闭式解(closed-form solution).数值实验结果显示了新算法的有效性.For the generalized saddle point problem,we develop an improved class of successive over relaxation algorithms.Under mild conditions,we prove its convergence and establish its linear rate of convergence.While,as the classical methods,it needs to solve some linear system of equations approximately to get the next iterate,the flexibility in choosing the involved matrices makes the subproblems easy or even to have closed form solutions,which leads the algorithm to be an efficient one.Preliminary numerical results show the effectiveness of the new method.

关 键 词：鞍点问题 类SOR算法 全局收敛性 收敛率 

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