The block principal pivoting algorithm for the linear complementarity problem with an \(M\)-matrix (Q781116)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7221702
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The block principal pivoting algorithm for the linear complementarity problem with an \(M\)-matrix |
scientific article; zbMATH DE number 7221702 |
Statements
The block principal pivoting algorithm for the linear complementarity problem with an \(M\)-matrix (English)
0 references
16 July 2020
0 references
Summary: 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.
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.93858206
0 references
0.9022728
0 references
0.88601327
0 references
0.88530564
0 references
0.8838188
0 references
0.8811938
0 references
0.8790584
0 references
0.87890947
0 references
0.87395865
0 references
