𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The symmetric inverse M-matrix completion problem

✍ Scribed by Charles R. Johnson; Ronald L. Smith

Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
830 KB
Volume
290
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

✦ Synopsis

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 symmetric inverse M-matrices have symmetric inverse M-matrix completions are identified and these include those that arise in the general (positionally symmetric) case. However, the identification of all such graphs is more subtle than the general case. Finally, we show that our new cycle conditions are sufficient for completability of all partial symmetric inverse M-matrices, the graph of whose specified entries is a block graph.

πŸ“œ SIMILAR VOLUMES

The symmetric N-matrix completion proble
The symmetric N-matrix completion problem
✍ C. Mendes AraΓΊjo; Juan R. Torregrosa; Ana M. Urbano πŸ“‚ Article πŸ“… 2005 πŸ› Elsevier Science 🌐 English βš– 261 KB

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

The inverse M-matrix problem
The inverse M-matrix problem
✍ R.A. Willoughby πŸ“‚ Article πŸ“… 1977 πŸ› Elsevier Science 🌐 English βš– 908 KB
N-matrix completion problem
N-matrix completion problem
✍ C.Mendes AraΓΊjo; Juan R. Torregrosa; Ana M. Urbano πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 132 KB