New error bounds for linear complementarity problems of weakly chained diagonally dominant \(B\)-matrices
From MaRDI portal
Publication:2406575
DOI10.1515/math-2017-0080zbMath1379.90041OpenAlexW2738945167MaRDI QIDQ2406575
Publication date: 5 October 2017
Published in: Open Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/math-2017-0080
error boundslinear complementarity problems\(B\)-matricesweakly chained diagonally dominant matrices
Sums of independent random variables; random walks (60G50) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Numerical computation of matrix norms, conditioning, scaling (65F35)
Related Items
A new error bound for linear complementarity problems with weakly chained diagonally dominant \(B\)-matrices, A new error bound for linear complementarity problems of weakly chained diagonally dominant B-matrices
Cites Work
- Unnamed Item
- Unnamed Item
- Note on error bounds for linear complementarity problems for \(B\)-matrices
- B-Nekrasov matrices and error bounds for linear complementarity problems
- Error bounds for linear complementarity problems involving \(B^S\)-matrices
- Weakly chained diagonally dominant \(B\)-matrices and error bounds for linear complementarity problems
- Error bounds for linear complementarity problems of \(DB\)-matrices
- Error bounds for linear complementarity problems of \(MB\)-matrices
- Error bounds for linear complementarity problems for \(B\)-matrices
- Computation of error bounds for P-matrix linear complementarity problems
- New error bounds for the linear complementarity problem with an \(SB\)-matrix
- A Class of P-Matrices with Applications to the Localization of the Eigenvalues of a Real Matrix
- Perturbation Bounds of P-Matrix Linear Complementarity Problems
- A Sufficient Condition for Nonvanishing of Determinants