Asynchronous multisplitting relaxation methods for linear complementarity problems
To solve linear complementarity problems efficiently on high-speed multiprocessor systems the authors set up a class of asynchronous parallel matrix multisplitting accelerated over-relaxation (AOR) methods by technical combination of the matrix multisplitting and the accelerated overrelaxation technique. The convergence theory of this new method is established under the condition that the system matrix of the linear complementarity problem to be an \(H\)-matrix with positive diagonal elements. At last a multi-parameter extension for this new asynchronous multisplitting AOR method is made, and the convergence property of the resulted asynchronous multisplitting unsymmetric AOR method is investigated. Thereby, an extensive sequence of asynchronous parallel relaxed iteration methods in the sense of multisplitting is presented for solving the large scale linear complementarity problem in the asynchronous parallel computing environments.
- A unified framework for the construction of various matrix multisplitting iterative methods for large sparse system of linear equations
- Chaotic relaxation
- Convergence of parallel multisplitting iterative methods for M-matrices
- Convergence of relaxed parallel multisplitting methods
- Matrix multisplitting relaxation methods for linear complementarity problems
- Models of asynchronous parallel matrix multisplitting relaxed iterations
- Models of parallel chaotic iteration methods
- Multi-Splittings of Matrices and Parallel Solution of Linear Systems
- Parallel Numerical Solution of Variational Inequalities
- The convergence of parallel iteration algorithms for linear complementarity problems
- Asynchronous parallel nonlinear multisplitting relaxation methods for large sparse nonlinear 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
- Explicit synchronous partitioned algorithms for interface problems based on Lagrange multipliers
- The refined error bounds for linear complementarity problems of \(H_+\)-matrices
- The PMCGAOR and PMCSSOR methods for solving linear complementarity problems
- Relaxed asynchronous iterations for the linear complementarity problem
- 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?)
- Matrix Multisplitting Methods with Applications to Linear Complementarity Problems∶ Parallel Asynchronous Methods
- scientific article; zbMATH DE number 1874107 (Why is no real title available?)
- scientific article; zbMATH DE number 822132 (Why is no real title available?)
- scientific article; zbMATH DE number 1420728 (Why is no real title available?)
- The relaxation modulus-based matrix splitting iteration method for solving a class of nonlinear complementarity problems
- Multisplitting and Schwarz methods for solving linear complementary 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
- Synchronous and asynchronous multisplitting iteration schemes for solving mixed linear complementarity problems with H-matrices
- Anderson acceleration of the modulus-based iteration methods for solving linear complementarity problems
This page was built for publication: Asynchronous multisplitting relaxation methods for linear complementarity problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4243277)