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

Projected SOR Iterative Solution for Two-sided Obstacle Problems

作　　者：张许峰[1] 李向阳[1] 

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

出　　处：《湖南文理学院学报（自然科学版）》2007年第2期16-17,共2页Journal of Hunan University of Arts and Science(Science and Technology)

摘　　要：为了求解双边障碍问题,将SOR迭代进行投影建立投影SOR迭代算法.由此算法产生的迭代序列至少存在一个聚点,该聚点是双边障碍问题的解.并且,当矩阵为非退化对称矩阵时,该序列收敛到双边障碍问题的解.投影迭代对于双边障碍问题的理论研究和应用具有重要意义.To solve the two-sided obstacle problem, SOR algorithm is projected to be established projective SOR algorithm. It is shown that the sequence generated by the projective SOR algorithm has an accumulation point which solves the two-sided obstacle problem. Moreover, when the matrix involved in the two-sided obstacle problem is a symmetric and nondegenerate matrix, the sequence converges to a solution of the problem. Projective iterations play a leading role in the studies of the two-sided obstacle problem and its application.

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

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