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

GAOR方法解线性互补问题的两种算法
引用本文:韩先丽,袁东锦,张士洋.GAOR方法解线性互补问题的两种算法[J].扬州大学学报(自然科学版),2011(3).
作者姓名:韩先丽  袁东锦  张士洋
作者单位:扬州大学数学科学学院;
基金项目:国家自然科学基金资助项目(60774073)
摘    要:提出GAOR(generalized accelerated over relaxation)方法解线性互补问题的两种算法,并证明这两种算法的收敛性定理,最后通过数值算例验证了定理内容的正确性.

关 键 词:GAOR方法  线性互补问题  收敛性  M-矩阵  H-矩阵  

Two GAOR algorithms for solving linear complementarity problems
HAN Xian-li,YUAN Dong-jin,ZHANG Shi-yang.Two GAOR algorithms for solving linear complementarity problems[J].Journal of Yangzhou University(Natural Science Edition),2011(3).
Authors:HAN Xian-li  YUAN Dong-jin  ZHANG Shi-yang
Institution:HAN Xian-li,YUAN Dong-jin,ZHANG Shi-yang (Sch of Math Sci,Yangzhou Univ,Yangzhou 225002,China)
Abstract:The author proposes two GAOR(generalized accelerated over relaxation) algorithms to solve the linear complementarity problem and proves the theorems for the convergence of two algorithms.Finally,it verifies the accuracy of the theorems by numerical experiment.
Keywords:generalized accelerated over relaxation method  linear complementarity problem  convergence  M-matrix  H-matrix  
本文献已被 CNKI 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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