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. |
Year | DOI | Venue |
---|---|---|
2008 | 10.1016/j.mcm.2007.10.017 | Mathematical and Computer Modelling |
Keywords | Field | DocType |
conjugate gradient method,linear equation,preliminary numerical experiment,linear complementarity problem,finite number,lower-dimensional system,exact solution,s -matrix,computational complexity,method terminates,s matrix,s,linear equations | Conjugate gradient method,Gradient method,Gradient descent,Biconjugate gradient stabilized method,Mathematical analysis,Nonlinear conjugate gradient method,Mathematics,Biconjugate gradient method,Derivation of the conjugate gradient method,Conjugate residual method | Journal |
Volume | Issue | ISSN |
48 | 5-6 | Mathematical and Computer Modelling |
Citations | PageRank | References |
4 | 0.66 | 8 |
Authors | ||
4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Donghui Li | 1 | 380 | 32.40 |
Yi-Yong Nie | 2 | 28 | 4.53 |
Jinping Zeng | 3 | 33 | 9.01 |
Qing-Na Li | 4 | 6 | 2.73 |