An iterative two-step algorithm for linear complementarityproblems |
| |
Authors: | M. Kov cvara Jochem Zowe |
| |
Affiliation: | (1) Mathematisches Institut, Universit"at Jena, Germany , DE |
| |
Abstract: | Summary. We propose an algorithm for the numerical solution of large-scale symmetric positive-definite linear complementarity problems. Each step of the algorithm combines an application of the successive overrelaxation method with projection (to determine an approximation of the optimal active set) with the preconditioned conjugate gradient method (to solve the reduced residual systems of linear equations). Convergence of the iterates to the solution is proved. In the experimental part we compare the efficiency of the algorithm with several other methods. As test example we consider the obstacle problem with different obstacles. For problems of dimension up to 24,000 variables, the algorithm finds the solution in less then 7 iterations, where each iteration requires about 10 matrix-vector multiplications. Received July 14, 1993 / Revised version received February 1994 |
| |
Keywords: | Mathematics Subject Classification (1991): 65K10 |
本文献已被 SpringerLink 等数据库收录! |
|