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...

Full description

Saved in:
Bibliographic Details
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