Research Article
The Block Principal Pivoting Algorithm for the Linear Complementarity Problem with an -Matrix
Algorithm 1
Block-Principal-Pivoting-Algorithm.
Require: | |
Ensure: | |
1: function = BLOCKPIVOTINGALGORITHM | |
2: = Location | |
3: if equals to then | |
4: | |
5: return | |
6: end if | |
7: if equals to an empty set then | |
8: | |
9: return | |
10: end if | |
11: extract from according to | |
12: split into and according to | |
13: | |
14: | |
15: construct with and | |
16: end function | |
17: function NEGATIVELOCATION = LOCATION(MatrixA, VectorQ) | |
18: according to the sign of each element of | |
19: if then | |
20: return | |
21: end if | |
22: if then | |
23: return | |
24: end if | |
25: extract and from according to | |
26: split into and according to | |
27: | |
28: | |
29: Location | |
30: construct by and | |
31: return | |
32: end function |