Gaussian pivoting method for solving linear complementarity problem

DOI10.1007/s11766-997-0044-5zbMath0890.65066OpenAlexW74815821MaRDI QIDQ1377180

Zhong-Zhi Zhang, Jin-ping Zeng, Dong-hui Li

Publication date: 6 July 1998

Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11766-997-0044-5

zbMATH Keywords

computational complexity\(M\)-matrixlinear complementarity problemsdirect methods\(Z\)-matrixGaussian pivoting method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Complexity and performance of numerical algorithms (65Y20) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (6)

On the preconditioned GAOR method for a linear complementarity problem with an \(M\)-matrix ⋮ Direct algorithm for the solution of two-sided obstacle problems with M -matrix ⋮ PRECONDITIONED SSOR METHODS FOR THE LINEAR COMPLEMENTARITY PROBLEM WITH M-MATRIX ⋮ A general preconditioner for linear complementarity problem with an \(M\)-matrix ⋮ Conjugate gradient method for the linear complementarity problem withs-matrix ⋮ A preconditioned multisplitting and Schwarz method for linear complementarity problem

Cites Work

• Two-side obstacle problem and its equivalent linear complementarity problem
• Minkowski matrices.
• Unnamed Item
• Unnamed Item

This page was built for publication: Gaussian pivoting method for solving linear complementarity problem