About This Item

Ask the MINDS@UW Librarian

Partially and Totally Asynchronous Algorithms for Linear Complentarity Problems

Show full item record

File(s):

Author(s)
DeLeone, Renato
Publisher
University of Wisconsin-Madison Department of Computer Sciences
Citation
TR888
Date
1989
Abstract
A 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.
Permanent link
http://digital.library.wisc.edu/1793/59206 
Export
Export to RefWorks 
‚Äč

Part of

Show full item record

Search and browse




About MINDS@UW

Deposit materials

  1. Register to deposit in MINDS@UW
  2. Need deposit privileges? Contact us.
  3. Already registered? Have deposit privileges? Deposit materials.