A general preconditioner for linear complementarity problem with an M-matrix
From MaRDI portal
(Redirected from Publication:507968)
A general preconditioner for linear complementarity problem with an \(M\)-matrix
A general preconditioner for linear complementarity problem with an \(M\)-matrix
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
Cites work
- scientific article; zbMATH DE number 5345413 (Why is no real title available?)
- scientific article; zbMATH DE number 3760340 (Why is no real title available?)
- scientific article; zbMATH DE number 53115 (Why is no real title available?)
- scientific article; zbMATH DE number 192986 (Why is no real title available?)
- scientific article; zbMATH DE number 194971 (Why is no real title available?)
- scientific article; zbMATH DE number 783533 (Why is no real title available?)
- scientific article; zbMATH DE number 3215568 (Why is no real title available?)
- scientific article; zbMATH DE number 3342967 (Why is no real title available?)
- A new preconditioned generalised AOR method for the linear complementarity problem based on a generalised hadjidimos preconditioner.
- A note on the preconditioned Gauss--Seidel (GS) method for linear systems
- Algebraic Soft-Decision Decoding of Hermitian Codes
- Approximate controllability of the \(n\)-th order infinite dimensional systems with controls delayed by the control devices
- BiCGstab(\(l\)) for linear equations involving unsymmetric matrices with complex spectrum
- Convergence of SSOR methods for linear complementarity problems
- Convergence of parallel multisplitting iterative methods for M-matrices
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Gaussian pivoting method for solving linear complementarity problem
- Improving preconditioned SOR-type iterative methods for L-matrices
- Iterative Solution Methods
- Matrix multisplitting relaxation methods for linear complementarity problems
- Modified Gauss-Seidel type methods and Jacobi type methods for Z-matrices
- More on modifications and improvements of classical iterative schemes for \(M\)-matrices
- Necessary and sufficient conditions for the convergence of iterative methods for the linear complementarity problem
- Numerical recipes for the high efficient inverse of the confluent Vandermonde matrices
- On the Convergence of the Multisplitting Methods for the Linear Complementarity Problem
- On the confluent Vandermonde matrix calculation algorithm
- Preconditioned AOR iterative methods for \(M\)-matrices
- Preconditioned techniques for solving large sparse linear systems arising from the discretization of the elliptic partial differential equations
- Preconditioning techniques for nonsymmetric and indefinite linear systems
- Solution of nonsymmetric, linear complementarity problems by iterative methods
- Solution of symmetric linear complementarity problems by iterative methods
- Some mathematical results in the pricing of American options
- The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation
- The convergence of the modified Gauss--Seidel methods for consistent linear systems
- Tools for computational finance
Cited in
(12)- A general preconditioner for tensor complementarity problems
- On the preconditioned GAOR method for a linear complementarity problem with an \(M\)-matrix
- New preconditioners applied to linear programming and the compressive sensing problems
- On Cvetković-Kostić-Varga type matrices
- A new preconditioned generalised AOR method for the linear complementarity problem based on a generalised hadjidimos preconditioner.
- A preconditioned AOR iterative scheme for systems of linear equations with \(L\)-matrics
- Linearized methods for tensor complementarity problems
- Preconditioned SSOR methods for the linear complementarity problem with \(M\)-matrix
- 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
- Infimum of error bounds for linear complementarity problems of \(\Sigma\)-\textit{SDD} and \(\Sigma_1\)-\textit{SSD} matrices
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)
