Parallel Chaotic Multisplitting Iterative Methods for the Large Sparse Linear Complementarity Problem
Year: 2001
Author: Zhong-Zhi Bai
Journal of Computational Mathematics, Vol. 19 (2001), Iss. 3 : pp. 281–292
Abstract
A parallel chaotic multisplitting method for solving the large sparse linear complementarity problem is presented, and its convergence properties are discussed in detail when the system matrix is either symmetric or nonsymmetric. Moreover, some applicable relaxed variants of this parallel chaotic multisplitting method together with their convergence properties are investigated. Numerical results show that high parallel efficiency can be achieved by these new parallel chaotic multisplitting methods.
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/2001-JCM-8980
Journal of Computational Mathematics, Vol. 19 (2001), Iss. 3 : pp. 281–292
Published online: 2001-01
AMS Subject Headings:
Copyright: COPYRIGHT: © Global Science Press
Pages: 12
Keywords: Linear complementarity problem Matrix multisplitting Chaotic iteration Relaxed method Convergence property.