The Block Principal Pivoting Algorithm for the Linear Complementarity Problem with an M‐Matrix

Xi-Ming Fang, Zhi-Jun Qiao and Heng-Jun Zhao

Advances in Mathematical Physics, 2019, vol. 2019, issue 1

Abstract: 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 proposed for solving the linear complementarity problem with an M‐matrix. By this algorithm, the linear complementarity problem can be solved in some block principal pivotal transformations. Besides, both the lower‐order and the higher‐order experiments are presented to show the effectiveness of this algorithm.

Date: 2019
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1155/2019/2976768

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:jnlamp:v:2019:y:2019:i:1:n:2976768

Access Statistics for this article

More articles in Advances in Mathematical Physics from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().