首页 | 本学科首页   官方微博 | 高级检索  
     


The inverse M-matrix problem
Authors:R.A. Willoughby
Affiliation:IBM Thomas J. Watson Research Center Yorktown Heights, New York 10598 U.S.A.
Abstract:One aspect of the inverse M-matrix problem can be posed as follows. Given a positive n × n matrix A=(aij) which has been scaled to have unit diagonal elements and off-diagonal elements which satisfy 0 < y ? aij ? x < 1, what additional element conditions will guarantee that the inverse of A exists and is an M-matrix? That is, if A?1=B=(bij), then bii> 0 and bij ? 0 for ij. If n=2 or x=y no further conditions are needed, but if n ? 3 and y < x, then the following is a tight sufficient condition. Define an interpolation parameter s via x2=sy+(1?s)y2; then B is an M-matrix if s?1 ? n?2. Moreover, if all off-diagonal elements of A have the value y except for aij=ajj=x when i=n?1, n and 1 ? j ? n?2, then the condition on both necessary and sufficient for B to be an M-matrix.
Keywords:Matrix Inverse  Principal Submatrices  Almost Principal Submatrices  Gauss-Jordan Transformations  Cycles Products  Diagonal Dominance
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号