scholarly journals New error bounds for linear complementarity problems of weakly chained diagonally dominant B-matrices

2017 ◽  
Vol 15 (1) ◽  
pp. 978-986 ◽  
Author(s):  
Deshu Sun ◽  
Feng Wang
Keyword(s):  
Error Bounds ◽  
Complementarity Problems ◽  
Linear Complementarity Problems ◽  
Linear Complementarity ◽  
Numerical Examples ◽  
Diagonally Dominant

Abstract Some new error bounds for the linear complementarity problems are obtained when the involved matrices are weakly chained diagonally dominant B-matrices. Numerical examples are given to show the effectiveness of the proposed bounds.

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

2019 ◽  
Vol 17 (1) ◽  
pp. 1599-1614
Author(s):  
Zhiwu Hou ◽  
Xia Jing ◽  
Lei Gao
Keyword(s):  
Linear Algebra ◽  
Error Bound ◽  
Linear Complementarity Problem ◽  
Error Bounds ◽  
Complementarity Problems ◽  
Linear Complementarity Problems ◽  
Linear Complementarity ◽  
Numerical Examples ◽  
Numer Algor ◽  
Better Than

Abstract 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.

scholarly journals Note on error bounds for linear complementarity problems involving $ B^S $-matrices

2021 ◽  
Vol 7 (2) ◽  
pp. 1896-1906
Author(s):  
Deshu Sun ◽  
Keyword(s):  
Error Bounds ◽  
Complementarity Problems ◽  
Matrix Theory ◽  
Linear Complementarity Problems ◽  
Linear Complementarity ◽  
Upper Bounds ◽  
Theory Analysis ◽  
Infinity Norm ◽  
S Matrix ◽  
Diagonally Dominant

<abstract><p>Using the range for the infinity norm of inverse matrix of a strictly diagonally dominant $ M $-matrix, some new error bounds for the linear complementarity problem are obtained when the involved matrix is a $ B^S $-matrix. Theory analysis and numerical examples show that these upper bounds are more accurate than some existing results.</p></abstract>

scholarly journals Norm bounds for the inverse and error bounds for linear complementarity problems for {P1,P2}-Nekrasov matrices

Filomat ◽  
2021 ◽  
Vol 35 (1) ◽  
pp. 239-250
Author(s):  
M. Nedovic ◽  
Lj. Cvetkovic
Keyword(s):  
Error Bound ◽  
Error Bounds ◽  
Complementarity Problems ◽  
Linear Complementarity Problems ◽  
Linear Complementarity ◽  
Numerical Examples ◽  
Different Types ◽  
Nekrasov Matrices

{P1,P2}-Nekrasov matrices represent a generalization of Nekrasov matrices via permutations. In this paper, we obtained an error bound for linear complementarity problems for fP1; P2g-Nekrasov matrices. Numerical examples are given to illustrate that new error bound can give tighter results compared to already known bounds when applied to Nekrasov matrices. Also, we presented new max-norm bounds for the inverse of {P1,P2}-Nekrasov matrices in the block case, considering two different types of block generalizations. Numerical examples show that new norm bounds for the block case can give tighter results compared to already known bounds for the point-wise case.

Note on error bounds for linear complementarity problems of Nekrasov matrices

2019 ◽  
Vol 83 (1) ◽  
pp. 355-372 ◽  
Author(s):  
Chaoqian Li ◽  
Shaorong Yang ◽  
Hui Huang ◽  
Yaotang Li ◽  
Yimin Wei
Keyword(s):  
Error Bounds ◽  
Complementarity Problems ◽  
Linear Complementarity Problems ◽  
Linear Complementarity ◽  
Nekrasov Matrices
Sign in / Sign up

Export Citation Format

Share Document