A new error bound for linear complementarity problems for B-matrices
Provides a tighter theoretical bound for a specific class of matrices, offering incremental improvement for researchers working on error analysis of linear complementarity problems.
The paper presents a new error bound for linear complementarity problems with B-matrices, which is shown to be sharper than two previous bounds from 2016.
A new error bound for the linear complementarity problem is given when the involved matrix is a B-matrix. It is shown that this bound is sharper than some previous bounds [C.Q. Li, Y.T. Li. Note on error bounds for linear complementarity problems for B-matrices, Applied Mathematics Letters, 57:108-113,2016] and [C.Q. Li, Y.T. Li. Weakly chained diagonally dominant B-matrices and error bounds for linear complementarity problems, to appear in Numer.Algor.].