A CLASS OF MULTI-PARAMETER RELAXED PARALLEL MULTISPLITTING METHODS FOR LARGE SPARSE LINEAR COMPLEMENTARITY PROBLEMS

DOI10.1080/10637199708915590MaRDI QIDQ4347261zbMATH OpenOpenAlexFDO

Authors Deren Wang, Zhong-Zhi Bai, D. J. Evans

Publication date 22 January 1998

Published in Parallel Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/10637199708915590

zbMATH Keywords

linear complementarity problemmultisplitting methodoverrelaxationparallel computation

Mathematics Subject Classification ID

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

Review text

Proposition and theory of a very general multisplitting method that includes several families of special type for the solution of the linear complementarity problem (LCP) that can be reformulated as a fixed point problem. Parallelization on an SIMD computer is over the splittings. The methods are of overrelaxation type. No numerical example is presented. The efficiency will surely depend on the choice of the many parameters of the method.

Recommendations

• A class of parallel nonlinear multisplitting relaxation methods for the large sparse nonlinear complementarity problems
• scientific article; zbMATH DE number 2051935
• Asynchronous parallel nonlinear multisplitting relaxation methods for large sparse nonlinear complementarity problems
• scientific article; zbMATH DE number 238288
• A class of parallel decomposition-type relaxation methods for large sparse systems of linear equations
• A class of generalized multisplitting relaxation methods for linear complementarity problems
• Matrix multisplitting relaxation methods for linear complementarity problems
• Asynchronous multisplitting relaxation methods for linear complementarity problems
• Parallel chaotic multisplitting iterative methods for the large sparse linear complementarity problem
• Matrix Multisplitting Methods with Applications to Linear Complementarity Problems∶ Parallel Asynchronous Methods

Cites work

• Asynchronous parallel successive overrelaxation for the symmetric linear complementarity problem
• scientific article; zbMATH DE number 3215568 (Why is no real title available?)
• Matrix multi-splitting multi-parameter relaxation methods
• Multi-Splittings of Matrices and Parallel Solution of Linear Systems
• Parallel successive overrelaxation methods for symmetric linear complementarity problems and linear programs
• Solution of nonsymmetric, linear complementarity problems by iterative methods
• Solution of symmetric linear complementarity problems by iterative methods

Cited in

(8)

• A class of generalized multisplitting relaxation methods for linear complementarity problems
• Asynchronous parallel nonlinear multisplitting relaxation methods for large sparse nonlinear complementarity problems
• A two-step parallel iteration method for large sparse horizontal linear complementarity problems
• The PMCGAOR and PMCSSOR methods for solving linear complementarity problems
• Parallel chaotic multisplitting iterative methods for the large sparse linear complementarity problem
• scientific article; zbMATH DE number 1308978 (Why is no real title available?)
• Matrix Multisplitting Methods with Applications to Linear Complementarity Problems∶ Parallel Asynchronous Methods
• Two class of synchronous matrix multisplitting schemes for solving linear complementarity problems

This page was built for publication: A CLASS OF MULTI-PARAMETER RELAXED PARALLEL MULTISPLITTING METHODS FOR LARGE SPARSE LINEAR COMPLEMENTARITY PROBLEMS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4347261)