| New Upper Bounds for the Inverse of $H$-Matrices Including $S$-SDD Matrices and Linear Complementarity Problems |
| Received:March 17, 2023 Revised:July 08, 2023 |
| Key Words:
linear complementarity problem error bound upper bound $S$-SDD matrices $H$-matrices
|
| Fund Project:Supported by the Scientific Research Project of Education Department of Hunan Province (Grant No.21C0837). |
|
| Hits: 134 |
| Download times: 145 |
| Abstract: |
| A partition reduction method is used to obtain new upper bounds for the inverses of $H$-matrices and $S$-strictly diagonally dominant ($S$-SDD) matrices. The estimates are expressed via the determinants of third order matrices. Numerical experiments with various random matrices show that they are stable and better than the estimates presented in literatures. We use these upper bounds to improve known error estimates for linear complementarity problems with $H$-matrices and $S$-SDD matrices. |
| Citation: |
| DOI:10.3770/j.issn:2095-2651.2024.02.004 |
| View Full Text View/Add Comment |
