On the convergence of two-step modulus-based matrix splitting iteration method
Authors:
Open Access
- 1 January 2021
- journal article
- research article
- Published by Walter de Gruyter GmbH in Open Mathematics
- Vol. 19 (1) , 1461-1475
Abstract
In this paper, based on the relationship between the linear complementarity problem and its reformulated fixed-point equation, we discuss the conditions of the modulus-based type iteration methods. Moreover, we present some convergence results on the two-step modulus-based matrix splitting iteration method with an -matrix. Finally, we give the numerical experiments.
Keywords
This publication has 34 references indexed in Scilit:
- A general modulus-based matrix splitting method for linear complementarity problems of-matricesApplied Mathematics Letters, 2013
- Accelerated modulus-based matrix splitting iteration methods for linear complementarity problemNumerical Algorithms, 2012
- Modulus-based matrix splitting iteration methods for linear complementarity problemsNumerical Linear Algebra with Applications, 2010
- Nonstationary Extrapolated Modulus Algorithms for the solution of the Linear Complementarity ProblemLinear Algebra and its Applications, 2009
- A modified modulus method for symmetric positive‐definite linear complementarity problemsNumerical Linear Algebra with Applications, 2008
- Matrix multisplitting relaxation methods for linear complementarity problemsInternational Journal of Computer Mathematics, 1997
- The convergence of parallel iteration algorithms for linear complementarity problemsComputers & Mathematics with Applications, 1996
- On the number of solutions to the complementarity problem and spanning properties of complementary conesLinear Algebra and its Applications, 1972
- The Solution of a Quadratic Programming Problem Using Systematic OverrelaxationSIAM Journal on Control, 1971
- Complementary pivot theory of mathematical programmingLinear Algebra and its Applications, 1968