Partially and Totally Asynchronous Algorithms for Linear Complentarity Problems

Simple item page
dc.contributor.authorDeLeone, Renatoen_US
dc.date.accessioned2012-03-15T16:52:10Z
dc.date.available2012-03-15T16:52:10Z
dc.date.created1989en_US
dc.date.issued1989
dc.description.abstractA unified treatment is given for partially and totally asynchronous parallel successive over-relaxation (SOR) algorithms for the linear complementarity problem. Convergence conditions are established and compared to previous results. Convergence of the partially asynchronous method for the symmetric linear complementarity problem can be guaranteed if the relaxation factor is sufficiently small. Unlike previous results this relaxation factor interval does not depend explicitly on problem size.en_US
dc.format.mimetypeapplication/pdfen_US
dc.identifier.citationTR888
dc.identifier.urihttp://digital.library.wisc.edu/1793/59206
dc.publisherUniversity of Wisconsin-Madison Department of Computer Sciencesen_US
dc.titlePartially and Totally Asynchronous Algorithms for Linear Complentarity Problemsen_US
dc.typeTechnical Reporten_US

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR888.pdf
Size:
1.2 MB
Format:
Adobe Portable Document Format
Download

Collections

CS Technical Reports