科研之友
微信
新浪微博
Facebook
分享链接
摘要
A new error bound for the linear complementarity problems, which involves a parameter, is given when the involved matrices are Nekrasov matrices. It is shown that there exists an optimal value of the parameter such that the new bound is sharper than that provided by Li et al. (Numer Algor. 2017;74:997-1009). Numerical examples are given to illustrate the corresponding results.
