投影AOR迭代求解双边障碍问题  

Projected AOR Iterative Solution for Two-sided Obstacle Problems

作　　者：李向阳[1] 郭丽娜[1] 曾垂坤[1] 

机构地区：[1]洛阳师范学院数学科学学院,河南洛阳471022

出　　处：《佳木斯大学学报（自然科学版）》2007年第1期117-119,共3页Journal of Jiamusi University：Natural Science Edition

摘　　要：研究了求解双边障碍问题的AOR迭代算法.证明由此算法产生的迭代序列至少存在一个聚点,该聚点是双边障碍问题的解,并且当矩阵为非退化对称矩阵时,该序列收敛到双边障碍问题的解.In this paper, AOR algorithm for solving two - sided obstacle problems is considered. It is shown that the sequence generated by the AOR algorithm has an accumulation point which solves the two - sided obstacle problem. Moreover, when the matrix M involved in the two- sided obstacle problem is symmetric and non - degenerate, the sequence converges to a solution of the problem.

关 键 词：投影AOR迭代 对称矩阵 双边障碍问题 

分 类 号：O242.26[理学—计算数学]