Block Principal Pivoting Algorithm for VGLCP: A Block Principal Pivoting Algorithm for the Vertical Generalized Linear Complementarity Problem (VGLCP) with a Vertical Block P-matrix
Aniekan Ebiefug · UTC Scholar (University of Tennessee at Chattanooga) · 2020
A block principal pivoting algorithm for the vertical generalized linear complementarity problem (VGLCP) associated with a vertical block P-matrix is provided. A preliminary result shows that it is very efficient when applied to large scaled problems as it reduces the number of iterations needed to solve the VGLCP when compared to other direct algorithms.