Relaxed Asynchronous Iterations for the Linear Complementarity Problem

Authors

  • Zhong-Zhi Bai
  • Yu-Guang Huang

Keywords:

Linear complementarity problem, Matrix multisplitting, Relaxation method, Asynchronous iteration, Convergence theory.

Abstract

We present a class of relaxed asynchronous parallel multisplitting iterative methods for solving the linear complementarity problem on multiprocessor systems, and set up their convergence theories when the system matrix of the linear complementarity problem is an H-matrix with positive diagonal elements.

Downloads

Published

2002-02-02

Abstract View

  • 32956

Pdf View

  • 4403

Issue

Vol. 20 No. 1 (2002)

Section

Articles

How to Cite

Relaxed Asynchronous Iterations for the Linear Complementarity Problem. (2002). Journal of Computational Mathematics, 20(1), 97-112. https://www.global-sci.com/index.php/JCM/article/view/11476