Parallel chaotic multisplitting iterative methods for the large sparse linear complementarity problem
A linear complementarity problem is considered: Find \(z\in\mathbb{R}^n\) such that \[ Mz+ q\geq 0,\quad z^T(Mz+ q)= 0\quad\text{and }z\geq 0. \] To solve such a problem by means of parallel computing some multisplitting iterative methods are known. In this paper a parallel chaotic multisplitting method for solving large sparse linear complementarity problems is presented. Convergence properties are discussed under certain assumptions. Some applicable relaxed variants of the presented algorithm and their convergence properties are investigated. There are numerical examples, the numerical results show high parallel efficiency.
- A class of parallel nonlinear multisplitting relaxation methods for the large sparse nonlinear complementarity problems
- A CLASS OF MULTI-PARAMETER RELAXED PARALLEL MULTISPLITTING METHODS FOR LARGE SPARSE LINEAR COMPLEMENTARITY PROBLEMS
- Asynchronous parallel nonlinear multisplitting relaxation methods for large sparse nonlinear complementarity problems
- Convergence analysis of the parallel multisplitting chaotic GAOR method for the linear complementarity problem
- scientific article; zbMATH DE number 2051935
- scientific article; zbMATH DE number 98002
- scientific article; zbMATH DE number 554772
- Chaotic iterative methods for the linear complementarity problems
- Résolution de grands systèmes linéaires creux par méthodes itératives parallèles
- Parallel multisplitting two-stage iterative methods for large sparse systems of weakly nonlinear equations
- The convergence of parallel iteration algorithms for linear complementarity problems
- An inexact alternating direction method of multipliers for the solution of linear complementarity problems arising from free boundary problems
- MSSOR-based alternating direction method for symmetric positive-definite linear complementarity problems
- A note on the inner-outer iterative method for solving the linear equation Ax = b
- The refined error bounds for linear complementarity problems of \(H_+\)-matrices
- The PMCGAOR and PMCSSOR methods for solving linear complementarity problems
- Inexact multisplitting methods for linear complementarity problems
- A parallel alternating iterative algorithm for linear complementarity problems
- Convergence improvement of relaxed multisplitting USAOR methods for H-matrices linear systems
- scientific article; zbMATH DE number 4152173 (Why is no real title available?)
- A CLASS OF MULTI-PARAMETER RELAXED PARALLEL MULTISPLITTING METHODS FOR LARGE SPARSE LINEAR COMPLEMENTARITY PROBLEMS
- scientific article; zbMATH DE number 2051935 (Why is no real title available?)
- A parallel iterative algorithm for differential linear complementarity problems
- An accelerated Newton method of high-order convergence for solving a class of weakly nonlinear complementarity problems
- Matrix Multisplitting Methods with Applications to Linear Complementarity Problems∶ Parallel Asynchronous Methods
- Two-stage multi-splitting parallel algorithm for the linear complementarity problems
- Two class of synchronous matrix multisplitting schemes for solving linear complementarity problems
- On convergence of two-stage splitting methods for linear complementarity problems
- A generalized two-step modulus-based matrix splitting iteration method for implicit complementarity problems of H_+-matrices
- Shifted skew-symmetric iteration methods for nonsymmetric linear complementarity problems
- Modulus-based inexact non-alternating preconditioned splitting method for linear complementarity problems
- Acceleration of the modulus-based iteration methods for solving linear complementarity problems by momentum
- Algorithm with order m+1 convergence for weakly nonlinear complementarity problems derived from the discretization of free boundary problems
- A generalized Newton method of high-order convergence for solving the large-scale linear complementarity problem
- Block monotone iterative algorithms for variational inequalities with nonlinear operators
This page was built for publication: Parallel chaotic multisplitting iterative methods for the large sparse linear complementarity problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2732180)
