Abstract
In this paper, we present a conjugate gradient method for solving the linear complementarity problem that involves an S-matrix. At each step, we solve a lower-dimensional system of linear equations by conjugate gradient method. The method terminates at the exact solution of the problem after a finite number of iterations. Moreover, the computational complexity of the proposed method is no more than the computational complexity of a conjugate gradient method for solving a system of linear equations. Preliminary numerical experiments show that the method is efficient.
Original language | English |
---|---|
Pages (from-to) | 918-928 |
Number of pages | 11 |
Journal | Mathematical and Computer Modelling |
Volume | 48 |
Issue number | 5-6 |
DOIs | |
Publication status | Published - Sept 2008 |
Externally published | Yes |
Keywords
- Conjugate gradient method
- Linear complementarity problem
- S-matrix