Error bounds for linear complementarity problems of \(DB\)-matrices (Q616418)

A real square matrix \(A= (a_{ij})\) is called a \(B\)-matrix if it has positive row sums and all its off diagonal elements are bounded above by their corresponding row means, i.e. for all \(i= 1,\dots,n\), \[ \sum^n_{k=1} a_{ik}> 0\quad\text{and}\quad {1\over n} \sum^n_{k=1} a_{ik}> a_{ij},\quad\forall i\neq j. \] A real matrix \(A= (a_{ij})\in\mathbb{R}^{n\times n}\) with diagonal elements satisfying. \(a_{ii}> r^+_i~\forall i\in \{1,\dots, n\}\) is a doubly \(B\)-matrix (\(DB\)-matrix) if, for all \(i\neq j\) \((i,j\in \{1,\dots, n\})\), \[ (a_{ii}- r^+_j)> \Biggl(\sum_{k\neq i} (r^+_i- a_{ik})\Biggr)\Biggl(\sum_{k\neq j} (r^+_j- a_{jk})\Biggr), \] where \(r^+_i= \max\{0,a_{ij}\mid~\forall j\neq i\}\). It is known that doubly \(B\)-matrices (\(DB\)-matrices), properly contain \(B\)-matrices. In this paper we present error bounds for the linear complementarity problem when the matrix involved is a \(DB\)-matrix and a new bound for linear complementarity problem of a \(B\)-matrix. Numerical examples showing the bounds are sharp are also presented.