A general preconditioner for linear complementarity problem with an M-matrix
From MaRDI portal
Publication:507968
DOI10.1016/J.CAM.2016.11.034zbMATH Open1357.65074OpenAlexW2559483474MaRDI QIDQ507968FDOQ507968
Authors: Ping-Fan Dai, Jicheng Li, Jianchao Bai, Yaotang Li 
Publication date: 9 February 2017
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2016.11.034
Recommendations
- Preconditioned SSOR methods for the linear complementarity problem with \(M\)-matrix
- On the preconditioned GAOR method for a linear complementarity problem with an \(M\)-matrix
- A preconditioned multisplitting and Schwarz method for linear complementarity problem
- A new preconditioned generalised AOR method for the linear complementarity problem based on a generalised hadjidimos preconditioner.
- On the preconditioned projective iterative methods for the linear complementarity problems
convergencecomparison theoremlinear complementarity problemsnumerical examplepreconditionerSSOR methodsymmetric successive overrelaxation methods
Numerical mathematical programming methods (65K05) Preconditioners for iterative methods (65F08) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cites Work
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Matrix multisplitting relaxation methods for linear complementarity problems
- On the Convergence of the Multisplitting Methods for the Linear Complementarity Problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Solution of nonsymmetric, linear complementarity problems by iterative methods
- Solution of symmetric linear complementarity problems by iterative methods
- BiCGstab(\(l\)) for linear equations involving unsymmetric matrices with complex spectrum
- Necessary and sufficient conditions for the convergence of iterative methods for the linear complementarity problem
- Iterative Solution Methods
- Algebraic Soft-Decision Decoding of Hermitian Codes
- Title not available (Why is that?)
- Approximate controllability of the \(n\)-th order infinite dimensional systems with controls delayed by the control devices
- Convergence of parallel multisplitting iterative methods for M-matrices
- On the confluent Vandermonde matrix calculation algorithm
- Numerical recipes for the high efficient inverse of the confluent Vandermonde matrices
- The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation
- Preconditioned AOR iterative methods for \(M\)-matrices
- Some mathematical results in the pricing of American options
- Title not available (Why is that?)
- A note on the preconditioned Gauss--Seidel (GS) method for linear systems
- Modified Gauss-Seidel type methods and Jacobi type methods for Z-matrices
- The convergence of the modified Gauss--Seidel methods for consistent linear systems
- More on modifications and improvements of classical iterative schemes for \(M\)-matrices
- Title not available (Why is that?)
- Preconditioning techniques for nonsymmetric and indefinite linear systems
- Tools for computational finance
- Gaussian pivoting method for solving linear complementarity problem
- Preconditioned techniques for solving large sparse linear systems arising from the discretization of the elliptic partial differential equations
- Improving preconditioned SOR-type iterative methods for L-matrices
- A new preconditioned generalised AOR method for the linear complementarity problem based on a generalised hadjidimos preconditioner.
- Convergence of SSOR methods for linear complementarity problems
Cited In (12)
- On the preconditioned GAOR method for a linear complementarity problem with an \(M\)-matrix
- Preconditioned SSOR methods for the linear complementarity problem with \(M\)-matrix
- A new preconditioned generalised AOR method for the linear complementarity problem based on a generalised hadjidimos preconditioner.
- New preconditioners applied to linear programming and the compressive sensing problems
- Error bounds for linear complementarity problems of \(S\)-Nekrasov matrices and \(B\)-\(S\)-Nekrasov matrices
- A preconditioned two-step modulus-based matrix splitting iteration method for linear complementarity problem
- New error bounds for linear complementarity problems of \(S\)-Nekrasov matrices and \(B-S\)-Nekrasov matrices
- A general preconditioner for tensor complementarity problems
- Infimum of error bounds for linear complementarity problems of \(\Sigma\)-\textit{SDD} and \(\Sigma_1\)-\textit{SSD} matrices
- On Cvetković-Kostić-Varga type matrices
- A preconditioned AOR iterative scheme for systems of linear equations with \(L\)-matrics
- Linearized methods for tensor complementarity problems
This page was built for publication: A general preconditioner for linear complementarity problem with an \(M\)-matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q507968)
