| 求解线性互补问题的USAOR迭代法简 |
| |
| 引用本文： | 祝凤清.求解线性互补问题的USAOR迭代法简[J].内江师范学院学报,2014(2):11-13. |
| |
| 作者姓名： | 祝凤清 |
| |
| 作者单位： | 西南石油大学理学院,四川成都610500 |
| |
| 基金项目： | 国家自然科学基金资助项目（61202045） |
| |
| 摘 要： | 针对线性互补问题的求解问题提出了一个快速有效的算法——非对称加速超松弛迭代法.分析了该迭代算法良好的收敛性.给出数值算例.通过与其他算法的比较说明了非对称加速超松弛迭代法的可行性和高效性.
|
| 关 键 词： | 线性互补问题 松弛迭代法 H-矩阵 收敛性 |
USAOR Method for Solving Linear Complementary Problems |
| |
| ZHU Feng-qing.USAOR Method for Solving Linear Complementary Problems[J].Journal of Neijiang Teachers College,2014(2):11-13. |
| |
| Authors: | ZHU Feng-qing |
| |
| Institution: | ZHU Feng-qing (School of Sciences,Southwest Petroleum University,Chengdu 610500, China) |
| |
| Abstract: | For solving the linear complementary problem, a fast and effective algorithm of non- symmetric accelerated Over-relaxation iteration is proposed. Then, a detailed analysis of the convergence of the iterative algorithm is done. Finally, a numerical example is given, and through comparison with other algorithms, it finds that the non-symmetric accelerated Over-relaxation iterative method is highly feasible and efficient. |
| |
| Keywords: | linear complementary problem relaxation algorithm H-Matrix convergence |
| 本文献已被 CNKI 维普 等数据库收录！ |
|
