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
Completions of M-matrix patterns
β Scribed by Leslie Hogben
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 624 KB
- Volume
- 285
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
β¦ Synopsis
A list of positions in an n x n real matrix (a pattern) is said to have M-completion if every partial M-matrix that specifies exactly these positions can be completed to an Mmatrix. Let Q be a pattern that includes all diagonal entries and let G be its digraph. The following are equivalent. (1) the pattern Q has M-completion; (2) the pattern Q is permutation similar to a block triangular pattern with all the diagonal blocks completely specified; (3) any strongly connected subdigraph of G is complete. A pattern with some diagonal entries unspecified has M-completion if and only if the principal subpattern defined by the specified diagonal positions has M-completion.
π SIMILAR VOLUMES
## Given a matrix quadruple e 3 we completely characterize the feedback invariants of the matrix pair e 1 e 2 ! Y e 3 e 4 ! Y for all possible selections of matrices P F n 1 Γn 2 and P F n 2 Γn 2 .
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