Year: 2002
Author: Zhong-Zhi Bai, Yu-Guang Huang
Journal of Computational Mathematics, Vol. 20 (2002), Iss. 1 : pp. 97–112
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.
You do not have full access to this article.
Already a Subscriber? Sign in as an individual or via your institution
Journal Article Details
Publisher Name: Global Science Press
Language: English
DOI: https://doi.org/2002-JCM-8902
Journal of Computational Mathematics, Vol. 20 (2002), Iss. 1 : pp. 97–112
Published online: 2002-01
AMS Subject Headings:
Copyright: COPYRIGHT: © Global Science Press
Pages: 16
Keywords: Linear complementarity problem Matrix multisplitting Relaxation method Asynchronous iteration Convergence theory.