Author:
Zhao Yingxia,Liu Lanlan,Wang Feng
Abstract
<abstract><p>An upper bound of the infinity norm for the inverse of $ SD{D_1} $ matrix is presented. We apply the new bound to linear complementarity problems (LCPs) and obtain an alternative error bound for LCPs of $ SD{D_1} $ matrices and $ SD{{D}_{1}} $-$ B $ matrices. In addition, a new lower bound for the smallest singular value is also given. Numerical examples show the validity of the results.</p></abstract>
Publisher
American Institute of Mathematical Sciences (AIMS)
Reference28 articles.
1. A. Berman, R. J. Plemmons, Nonnegative matrix in the mathematical sciences, Society for Industrial and Applied Mathematics, 1994.
2. R. W. Cottle, J. S. Pang, R. E. Stone, The linear complementarity problem, SIAM, 1992.
3. K. G. Murty, F. T. Yu, Linear Complementarity, Linear and nonlinear Programming, Berlin: Heldermann Verlag, 1998.
4. X. J. Chen, S. H. Xiang, Computation of error bounds for $P$-matrix linear complementarity problem, Math. Program., 106 (2006), 513–525. https://doi.org/10.1007/s10107-005-0645-9
5. J. C. Li, G. Li, Error bounds for linear complementarity problems of $S$-$QN$ matrices, Numer. Algor., 83 (2020), 935–955. https://doi.org/10.1007/s11075-019-00710-0
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献