Communications of the
Korean Mathematical Society
CKMS
Article
ALL ARTICLES
View
Commun. Korean Math. Soc. 2019; 34(2): 657-670
Online first article April 9, 2019 Printed April 30, 2019
https://doi.org/10.4134/CKMS.c170423
Copyright © The Korean Mathematical Society.
Preconditioned SSOR methods for the linear complementarity problem with $M$-matrix
Dan Zhang
Northwest Normal University
In this paper, we consider the preconditioned iterative methods for solving linear complementarity problem associated with an $M$-matrix. Based on the generalized Gunawardena's preconditioner, two preconditioned SSOR methods for solving the linear complementarity problem are proposed. The convergence of the proposed methods are analyzed, and the comparison results are derived. The comparison results showed that preconditioned SSOR methods accelerate the convergent rate of the original SSOR method. Numerical examples are used to illustrate the theoretical results.
Keywords: linear complementarity problems, $M$-matrix, SSOR method, preconditioner, comparison theorem
MSC numbers: 65F10, 65F20
Fulltext
Stats or Metrics
Share this article on :
Related articles in CKMS
-
$L^p$ solutions for general time interval multidimensional BSDEs with weak monotonicity and general growth generators
2018; 33(3): 985-999
-
A weighted-path following interior-point algorithm for Cartesian $P_*(\kappa)$-LCP over symmetric cones
2017; 32(3): 765-778
-
On convergence of the modified Gauss-Seidel iterative method for $H$-matrix linear system
2013; 28(3): 603-613
-
Convergence and breakdown study of krylov methods for nonsymmetric linear systems
1995; 10(4): 981-995
© 2022. The Korean Mathematical Society. Powered by INFOrang Co., Ltd