首页 | 本学科首页   官方微博 | 高级检索  
     检索      

投影AOR迭代求解双边障碍问题
引用本文:李向阳,郭丽娜,曾垂坤.投影AOR迭代求解双边障碍问题[J].佳木斯大学学报,2007,25(1):117-119.
作者姓名:李向阳  郭丽娜  曾垂坤
作者单位:洛阳师范学院数学科学学院 河南洛阳471022
摘    要:研究了求解双边障碍问题的AOR迭代算法.证明由此算法产生的迭代序列至少存在一个聚点,该聚点是双边障碍问题的解,并且当矩阵为非退化对称矩阵时,该序列收敛到双边障碍问题的解.

关 键 词:投影AOR迭代  对称矩阵  双边障碍问题  投影  迭代求解  双边障碍问题  Problems  Obstacle  序列收敛  对称矩阵  非退化  聚点  存在  迭代序列  迭代算法  研究
文章编号:1008-1402(2007)01-0107-03
收稿时间:2006-10-19
修稿时间:2006年10月19

Projected AOR Iterative Solution for Two-sided Obstacle Problems
LI Xiang-yang,GUO Li-na,ZENG Chui-kun.Projected AOR Iterative Solution for Two-sided Obstacle Problems[J].Journal of Jiamusi University(Natural Science Edition),2007,25(1):117-119.
Authors:LI Xiang-yang  GUO Li-na  ZENG Chui-kun
Institution:College of Mathematics Science ,Luoyang Normal University,Lnoyang 471022, China
Abstract: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.
Keywords:projection of the AOR iterate  symmetric matrix  two-sided obstacle prob-lem
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号