A preconditioned multisplitting and Schwarz method for linear complementarity problem
From MaRDI portal
Publication:2336502
DOI10.1155/2014/519017zbMath1442.65103OpenAlexW2042271947WikidataQ59051863 ScholiaQ59051863MaRDI QIDQ2336502
Publication date: 19 November 2019
Published in: Journal of Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2014/519017
Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cites Work
- Unnamed Item
- Unnamed Item
- Accelerated modulus-based matrix splitting iteration methods for linear complementarity problem
- Multisplitting iteration schemes for solving a class of nonlinear complementarity problems
- Improving Jacobi and Gauss-Seidel iterations
- Solution of symmetric linear complementarity problems by iterative methods
- The convergence of parallel iteration algorithms for linear complementarity problems
- Gaussian pivoting method for solving linear complementarity problem
- More on modifications and improvements of classical iterative schemes for \(M\)-matrices
- A necessary and sufficient condition for \(M\)-matrices and its relation to block \(LU\) factorization
- A multisplitting method for symmetric linear complementarity problems
- Modulus-based synchronous two-stage multisplitting iteration methods for linear complementarity problems
- On the Convergence of a Matrix Splitting Algorithm for the Symmetric Monotone Linear Complementarity Problem
- Matrix multisplitting relaxation methods for linear complementarity problems
- Matrix Multisplitting Methods with Applications to Linear Complementarity Problems∶ Parallel Asynchronous Methods
- A New Preconditioned Generalised AOR Method for the Linear Complementarity Problem Based on a Generalised Hadjidimos Preconditioner
This page was built for publication: A preconditioned multisplitting and Schwarz method for linear complementarity problem
