Necessary and sufficient conditions are given on the data for completability of a partial symmetric inverse M-matrix, the graph of whose specified entries is a cycle, and these conditions coincide with those we identify to be necessary in the general (nonsymmetric) case. Graphs for which all partial
Inverse M-matrix completion problem with zeros in the inverse completion
✍ Scribed by C. Jordán; J.R. Torregrosa; A.M. Urbano
- Publisher
- Elsevier Science
- Year
- 2002
- Tongue
- English
- Weight
- 530 KB
- Volume
- 15
- Category
- Article
- ISSN
- 0893-9659
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
A list of positions in an i1 x n real matrix that includes all diagonal positions (a pattern) is said to have inverse M-completion if every partial inverse M-matrix that specifies exactly these positions can be completed to an inverse M-matrix. Johnson and Smith (C.R. Johnson, R.L. Smith, Linear Alg
An n × n matrix is called an N -matrix if all its principal minors are negative. In this paper, we are interested in the symmetric N -matrix completion problem, that is, when a partial symmetric N -matrix has a symmetric N -matrix completion. Here, we prove that a partial symmetric N -matrix has a s