The Block Principal Pivoting Algorithm for the Linear Complementarity Problem with an M-Matrix
Joint Authors
Qiao, Zhijun
Fang, Xi-Ming
Zhao, Heng-Jun
Source
Advances in Mathematical Physics
Issue
Vol. 2019, Issue 2019 (31 Dec. 2019), pp.1-7, 7 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2019-07-30
Country of Publication
Egypt
No. of Pages
7
Main Subjects
Abstract EN
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.
American Psychological Association (APA)
Fang, Xi-Ming& Qiao, Zhijun& Zhao, Heng-Jun. 2019. The Block Principal Pivoting Algorithm for the Linear Complementarity Problem with an M-Matrix. Advances in Mathematical Physics،Vol. 2019, no. 2019, pp.1-7.
https://search.emarefa.net/detail/BIM-1118897
Modern Language Association (MLA)
Fang, Xi-Ming…[et al.]. The Block Principal Pivoting Algorithm for the Linear Complementarity Problem with an M-Matrix. Advances in Mathematical Physics No. 2019 (2019), pp.1-7.
https://search.emarefa.net/detail/BIM-1118897
American Medical Association (AMA)
Fang, Xi-Ming& Qiao, Zhijun& Zhao, Heng-Jun. The Block Principal Pivoting Algorithm for the Linear Complementarity Problem with an M-Matrix. Advances in Mathematical Physics. 2019. Vol. 2019, no. 2019, pp.1-7.
https://search.emarefa.net/detail/BIM-1118897
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1118897
