A class of generalized multisplitting relaxation methods for linear complementarity problems
type: Item
instance of: scholarly article
title: A class of generalized multisplitting relaxation methods for linear complementarity problems
zbMATH Open document ID: 0910.65049
published in: Applied Mathematics. Series B (English Edition)
publication date: 1999-04-09T00:00:00Z
review text: Two generalized parallel multisplitting relaxation methods for solving a linear complementarity problem (LCP) \(x^+=Mx^-+q\) are described. The sequences generated by the methods are proved to converge to the unique solution of the LCP provided \(M\) is a \(H\)-matrix with positive diagonal elements.
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C33
Mathematics Subject Classification ID: 65Y05
zbMATH DE Number: 1193546
zbMATH Keywords: linear complementarity problem
zbMATH Keywords: multisplitting
zbMATH Keywords: relaxation method
zbMATH Keywords: parallel computation
zbMATH Keywords: convergence
author: Zhong-Zhi Bai
reviewed by: Jiří Rohn
MaRDI profile type: Publication
full work available at URL: s11766-998-0040-4
OpenAlex ID: W2313847590
cites work: Solution of nonsymmetric, linear complementarity problems by iterative methods
cites work: Matrix multisplitting relaxation methods for linear complementarity problems
cites work: A CLASS OF MULTI-PARAMETER RELAXED PARALLEL MULTISPLITTING METHODS FOR LARGE SPARSE LINEAR COMPLEMENTARITY PROBLEMS
cites work: Q4874936
cites work: Matrix multi-splitting multi-parameter relaxation methods
cites work: Multi-Splittings of Matrices and Parallel Solution of Linear Systems
cites work: Q5342712
DOI: 10.1007/S11766-998-0040-4
Recommended article: Matrix multisplitting relaxation methods for linear complementarity problems
Recommended article: A multiplicative multisplitting method for solving the linear complementarity problem
Recommended article: A multisplitting method for symmetric linear complementarity problems
Recommended article: A class of parallel nonlinear multisplitting relaxation methods for the large sparse nonlinear complementarity problems
Recommended article: A CLASS OF MULTI-PARAMETER RELAXED PARALLEL MULTISPLITTING METHODS FOR LARGE SPARSE LINEAR COMPLEMENTARITY PROBLEMS
Recommended article: On the Convergence of the Multisplitting Methods for the Linear Complementarity Problem
Recommended article: A relaxation modulus-based matrix splitting iteration method for solving linear complementarity problems
Recommended article: Inexact multisplitting methods for linear complementarity problems
Recommended article: Multisplitting iteration schemes for solving a class of nonlinear complementarity problems
Recommended article: On the monotone convergence of matrix multisplitting relaxation methods for the linear complementarity problem
description: scientific article; zbMATH DE number 1193546