S‐strictly dominant B‐matrices (SB‐matrices) are introduced by Li et al. (2007). In this paper, we give error bounds for the linear complementarity problem when the matrix involved is an SB‐matrix, which generalize those of DB‐matrix linear complementarity problem and show advantages with respect to the computational cost. Then the perturbation bounds of SB‐matrices linear complementarity problems are also provided. The preliminary numerical results show the sharpness of the bounds.
