A class of generalized multisplitting relaxation methods for linear complementarity problems

DOI10.1007/s11766-998-0040-4zbMath0910.65049OpenAlexW2313847590MaRDI QIDQ1129813

Zhong Zhi Bai

Publication date: 9 April 1999

Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11766-998-0040-4

zbMATH Keywords

convergencelinear complementarity problemparallel computationrelaxation methodmultisplitting

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Parallel numerical computation (65Y05)

Related Items

Matrix Multisplitting Methods with Applications to Linear Complementarity Problems∶ Parallel Asynchronous Methods, Two class of synchronous matrix multisplitting schemes for solving linear complementarity problems, Synchronous and asynchronous multisplitting iteration schemes for solving mixed linear complementarity problems with \(H\)-matrices, The PMCGAOR and PMCSSOR methods for solving linear complementarity problems

Cites Work

• Solution of nonsymmetric, linear complementarity problems by iterative methods
• Multi-Splittings of Matrices and Parallel Solution of Linear Systems
• Matrix multi-splitting multi-parameter relaxation methods
• Matrix multisplitting relaxation methods for linear complementarity problems
• A CLASS OF MULTI-PARAMETER RELAXED PARALLEL MULTISPLITTING METHODS FOR LARGE SPARSE LINEAR COMPLEMENTARITY PROBLEMS
• Unnamed Item
• Unnamed Item