.png){kind=icon}
返回
The Monomial Preconditioned SSOR Method for Linear Complementarity problem
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2019.2920485.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper aims to show that the existing preconditioned symmetric successive over-relaxation (SSOR) approach to solving the linear complementarity problem (LCP) is not valid. To overcome the flaws, we propose an efficient preconditioner called the monomial preconditioner. The convergence behavior of the proposed model is also established. Meanwhile, the efficiency of the new method is verified by numerical experiments.
Keyword:
Linear complementarity problem
M-matrix
preconditioning
projected model
SSOR method
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
Evaluation of shedding, tissue burdens, and humoral immune response in goats after experimental challenge with the virulent Brucella melitensis strain 16M and the reduced virulence vaccine strain Rev. 1.png)
PLOS ONE
OAAI
PLOS ONEIF0
OAAI分享收藏The relaxation modulus-based matrix splitting iteration method for solving linear complementarity problems of positive definite matrices求解正定矩阵线性互补问题的松弛模矩阵分裂迭代法
PREAI
分享收藏m-BIRCH: an online clustering approach for computer vision applicationsm-BIRCH：一种用于计算机视觉应用的在线聚类方法
PREAI
分享收藏Improved convergence theorems of multisplitting methods for the linear complementarity problem线性互补问题多重分裂方法的改进收敛定理
PREAI
分享收藏
查看更多内容