New error bounds for linear complementarity problems of Σ-SDD matrices and SB-matrices

A new error bound for the linear complementarity problem (LCP) of Σ -SDD matrices is given, which depends only on the entries of the involved matrices. Numerical examples are given to show that the new bound is better than that provided by García-Esnaola and Peña [Linear Algebra Appl., 2013, 438, 1339–1446] in some cases. Based on the obtained results, we also give an error bound for the LCP of SB -matrices. It is proved that the new bound is sharper than that provided by Dai et al. [Numer. Algor., 2012, 61, 121–139] under certain assumptions.