Show simple item record

dc.contributor.authorKappel, Nicholas W.en_US
dc.contributor.authorWatson, Layne T.en_US
dc.date.accessioned2013-06-19T14:36:27Z
dc.date.available2013-06-19T14:36:27Z
dc.date.issued1984
dc.identifierhttp://eprints.cs.vt.edu/archive/00000901/en_US
dc.identifier.urihttp://hdl.handle.net/10919/19431
dc.description.abstractDirect complementary pivot algorithms for the linear complementarity problem with P-matrices are known to have exponential computational complexity. The analog of Gauss-Seidel and SOR iteration for linear complementarity problems with P-matrices has not been extensively developed. This paper extends some work of van Bokhoven to a class of nonsymmetric P-matrices, and develops and compares several new iterative algorithms for the linear complementarity problem. Numerical results for several hundred test problems are presented. Such indirect iterative algorithms may prove useful for large sparse complementarity problems.en_US
dc.format.mimetypeapplication/pdfen_US
dc.publisherDepartment of Computer Science, Virginia Polytechnic Institute & State Universityen_US
dc.relation.ispartofHistorical Collection(Till Dec 2001)en_US
dc.titleIterative Algorithms for the Linear Complementarity Problemen_US
dc.typeTechnical reporten_US
dc.identifier.trnumberCS84002-Ren_US
dc.type.dcmitypeTexten_US
dc.identifier.sourceurlhttp://eprints.cs.vt.edu/archive/00000901/01/CS84002-R.pdf


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record