A New Preconditioned Generalised AOR Method for the Linear Complementarity Problem Based on a Generalised Hadjidimos Preconditioner
From MaRDI portal
Publication:5406913
DOI10.4208/eajam.050911.060412azbMath1287.65046OpenAlexW2963361858MaRDI QIDQ5406913
Publication date: 4 April 2014
Published in: East Asian Journal on Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4208/eajam.050911.060412a
convergencelinear complementarity problem\(M\)-matrixnumerical experimentaccelerated overrelaxation methodgeneralised Hadjidimos preconditioner
Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Preconditioners for iterative methods (65F08)
Related Items
On the preconditioned GAOR method for a linear complementarity problem with an \(M\)-matrix, A general preconditioner for linear complementarity problem with an \(M\)-matrix, A preconditioned multisplitting and Schwarz method for linear complementarity problem
Cites Work
- Unnamed Item
- A new preconditioned AOR iterative method for \(L\)-matrices
- Improving Jacobi and Gauss-Seidel iterations
- \(H\)-splittings and two-stage iterative methods
- Solution of symmetric linear complementarity problems by iterative methods
- More on modifications and improvements of classical iterative schemes for \(M\)-matrices
- A multisplitting method for symmetric linear complementarity problems
- Generalized AOR methods for linear complementarity problem
- Matrix multisplitting relaxation methods for linear complementarity problems
- A Unified Representation and Theory of Algebraic Additive Schwarz and Multisplitting Methods
- On the Convergence of the Multisplitting Methods for the Linear Complementarity Problem
- The AOR iterative method for new preconditioned linear systems