The inverse M-matrix problem

51Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

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 i≠j. 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. © 1977.

Cite

CITATION STYLE

APA

Willoughby, R. A. (1977). The inverse M-matrix problem. Linear Algebra and Its Applications, 18(1), 75–94. https://doi.org/10.1016/0024-3795(77)90081-7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free