首页> 外文期刊>Computers & mathematics with applications >The modulus-based matrix double splitting iteration method for linear complementarity problems
【24h】

The modulus-based matrix double splitting iteration method for linear complementarity problems

机译:基于模量的矩阵双分割迭代方法,用于线性互补问题

获取原文
获取原文并翻译 | 示例

摘要

For large sparse linear complementarity problems, through reformulating them as implicit fixed-point equations, we propose a modulus-based matrix double splitting (MB-DS) iteration method by splitting the system matrices twice. Besides, the convergence of this method is proved when the system matrix is a P-matrix and an H+-matrix. In some special cases, we present the convergence regions and the optimal values for the parameter omega. In order to show the efficiency of the MB-DS iteration method and the effectiveness of the optimal parameter, some corresponding numerical experiments are performed. (C) 2019 Elsevier Ltd. All rights reserved.
机译:对于大的稀疏线性互补问题,通过将它们重新绘制为隐含的定点方程,我们通过将系统矩阵分离两次,提出基于模数基矩阵双分离(MB-DS)迭代方法。此外,当系统矩阵是P矩阵和H + -Matrix时,证明了该方法的收敛。在一些特殊情况下,我们介绍了参数ωa的收敛区和最佳值。为了显示MB-DS迭代方法的效率和最佳参数的有效性,执行一些相应的数值实验。 (c)2019 Elsevier Ltd.保留所有权利。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号