The Block Principal Pivoting Algorithm for the Linear Complementarity Problem with an M-Matrix-Reference-Cited by-同舟云学术

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

Published:2019-07-30 Issue: Volume:2019 Page:1-7
ISSN:1687-9120
Container-title:Advances in Mathematical Physics
language:en
Short-container-title:Advances in Mathematical Physics

Author:

Fang Xi-Ming¹,Qiao Zhi-Jun²^ORCID,Zhao Heng-Jun³

Affiliation:

1. School of Mathematics and Statistics, Zhaoqing University, Zhaoqing 526000, China

2. School of Mathematical and Statistical Sciences, The University of Texas Rio Grande Valley, Edinburg, TX 78539, USA

3. Department of Mathematics and Finance, Key Laboratory of Graph Theories and Applications, Chongqing University of Arts and Sciences, Chongqing 400000, China

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.

Funder

starting funds of research program

Publisher

Hindawi Limited

Subject

Applied Mathematics,General Physics and Astronomy

Link

http://downloads.hindawi.com/journals/amp/2019/2976768.pdf

Reference41 articles.

1. Modulus-based matrix splitting iteration methods for linear complementarity problems

2. On the solution of large, structured linear complementarity problems: The tridiagonal case

3. Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications