| 两步模系矩阵分裂算法求解弱非线性互补问题 |
| |
| 引用本文： | 李蕊,殷俊锋.两步模系矩阵分裂算法求解弱非线性互补问题[J].同济大学学报(自然科学版),2017,45(2):0296-0301. |
| |
| 作者姓名： | 李蕊 殷俊锋 |
| |
| 作者单位： | 同济大学数学系,同济大学数学系 |
| |
| 基金项目： | 国家自然科学基金项目（11271289） |
| |
| 摘 要： | 考虑两步模系矩阵分裂算法求解弱非线性互补问题,理论分析给出了当系数矩阵为正定矩阵或H+-矩阵时迭代法的收敛性质和两步模系超松弛迭代法的参数选取范围.数值实验表明,两步模系矩阵分裂算法是行之有效的,并在迭代步数和迭代时间上均优于模系矩阵分裂算法.
|
| 关 键 词： | 矩阵分裂 两步模系算法 弱非线性互补问题 |
| 收稿时间： | 2016/6/14 0:00:00 |
| 修稿时间： | 2016/11/23 0:00:00 |
Two step Modulus based Matrix Splitting Algorithms for Weakly Nonlinear Complementarity Problems |
| |
| LI Rui and YIN Junfeng.Two step Modulus based Matrix Splitting Algorithms for Weakly Nonlinear Complementarity Problems[J].Journal of Tongji University(Natural Science),2017,45(2):0296-0301. |
| |
| Authors: | LI Rui and YIN Junfeng |
| |
| Institution: | School of Mathematical Sciences, Tongji University, Shanghai 200092, China; College of Mathematics Physics and Information Engineering, Jiaxing University, Jiaxing 314001, China and School of Mathematical Sciences, Tongji University, Shanghai 200092, China |
| |
| Abstract: | Two-step modulus-based matrix splitting algorithms are proposed to solve weakly nonlinear complementarity problems. Convergence theory is established when the system matrix is either positive definite or an -matrix. Moreover, the choice of the parameters for two-step modulus-based successive overrelaxation methods is also discussed. Numerical experiments show that the proposed methods are efficient and better than the modulus-based matrix splitting methods in aspects of iteration steps and CPU time. |
| |
| Keywords: | matrix splitting two-step modulus-based iteration methods weakly nonlinear complementarity problems |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《同济大学学报(自然科学版)》浏览原始摘要信息 |
| 点击此处可从《同济大学学报(自然科学版)》下载免费的PDF全文 |
|
