首页|New Upper Bounds for the Inverse of H-Matrices Including S-SDD Matrices and Linear Complementarity Problems
New Upper Bounds for the Inverse of H-Matrices Including S-SDD Matrices and Linear Complementarity Problems
扫码查看
点击上方二维码区域，可以放大扫码查看
原文链接
NETL
NSTL
万方数据
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 ma-trices 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.
linear complementarity problemerror boundupper boundS-SDD matricesH-matrices
Yebo XIONG
展开 >
Department of Mathematics and Statistics,Hunan First Normal University,Hunan 410205,P.R.China
Scientific Research Project of Education Department of Hunan Province
NETL
NSTL
万方数据
