On the Solution of Large, Structured Linear Complementarity Problems. II.
STANFORD UNIV CALIF OPERATIONS RESEARCH HOUSE
Pagination or Media Count:
In an earlier paper, R. W. Cottle and the author proposed a special principal pivoting algorithm for a class of large, structured linear complementarity problems. The method was applied with encouraging results to data relating to the free boundary problem for infinite journal bearings. The purpose of the present paper is to compare the empirical performance of the principal pivoting method with that of two other pertinent methods. One of the latter employs LU factorizations and is adaptive in the sense that each iteration exploits the factorization associated with its predecessor. The other is a modification of the point successive overrelaxation technique. Recommendations based on the reported computational experience are made. Author
- Operations Research