The Block Principal Pivoting Algorithm for the Linear Complementarity Problem with an M-Matrix
The principal pivoting algorithm is a popular direct algorithm in solving the linear complementarity problem, and its block forms had also been studied by many authors. In this paper, relying on the characteristic of block principal pivotal transformations, a block principal pivoting algorithm is pr...
Saved in:
Main Authors: | Xi-Ming Fang, Zhi-Jun Qiao, Heng-Jun Zhao |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2019-01-01
|
Series: | Advances in Mathematical Physics |
Online Access: | http://dx.doi.org/10.1155/2019/2976768 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
A Fast Algorithm for Solving a Class of the Linear Complementarity Problem in a Finite Number of Steps
by: Yamna Achik, et al.
Published: (2020-01-01) -
The Solution Set Characterization and Error Bound for the Extended Mixed Linear Complementarity Problem
by: Hongchun Sun, et al.
Published: (2012-01-01) -
A Penalized-Equation-Based Generalized Newton Method for Solving Absolute-Value Linear Complementarity Problems
by: Yuan Li, et al.
Published: (2014-01-01) -
Inversion Free Algorithms for Computing the Principal Square Root of a Matrix
by: Nicholas Assimakis, et al.
Published: (2014-01-01) -
Convergence analysis of the iterative methods for quasi complementarity problems
by: Muhammad Aslam Noor
Published: (1988-01-01)