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

The general two-sweep modulus-based matrix splitting iteration method for solving linear complementarity problems

机译:求解线性互补问题的基于二扫模的通用矩阵分裂迭代方法

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

摘要

In this paper, we present a general two-sweep modulus-based iteration method to solve a class of linear complementarity problems. Convergence analysis shows that the general two-sweep modulus-based matrix splitting iteration method will converge to the exact solution of linear complementarity problem under appropriate conditions. Numerical experiments further show that the proposed methods are superior to the existing methods in actual implementation. (C) 2018 Elsevier Ltd. All rights reserved.
机译:在本文中,我们提出了一种基于二扫描模量的通用迭代方法来解决一类线性互补问题。收敛性分析表明,一般的基于二扫频模的矩阵分裂迭代方法将在适当的条件下收敛到线性互补问题的精确解。数值实验进一步表明,该方法在实际实现中优于现有方法。 (C)2018 Elsevier Ltd.保留所有权利。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号