报告主题：严格对角占优M矩阵之逆的新上界及其在线性完备问题中的应用（New upper bounds for the inverse of strictly diagonally dominant M-matrices with its applications in linear complementarity problems）
报 告 人：刘建州 教授（湘潭大学）
报告时间：2021年6月12日（周六） 8:50
会议地点：校本部G507
邀请人：王卿文
主办部门：理学院数学系
报告摘要：In this paper, by partition and summation, we obtain two new upper bounds for the inverse of strictly diagonally dominant (SDD) M-matrices by reduction method. Various numerical experiments with random matrices show that the upper bound (which is expressed by means of some determinants of third order matrices) is much sharper than existing ones. In addition, the new upper bounds for the matrix inverse can be utilized for the error analysis in LCPs for erro bounds, and we propose two sharper error bounds for B-matrices by computing the maximum value of multivariate functions. In addition, some other numerical experiments for error bounds of LCPs are presented to show the efficiency and superiority of our results.