Some properties of GM-matrices and their inverses (Q1112140)

From MaRDI portal
Revision as of 03:24, 31 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Some properties of GM-matrices and their inverses
scientific article

    Statements

    Some properties of GM-matrices and their inverses (English)
    0 references
    0 references
    0 references
    1988
    0 references
    This article studies the relation between the cycle structure of the signed digraph of a matrix and the signs of its principal minors. An \(n\times n\) matrix A is a GM-matrix if its diagonal elements are negative and each negative cycle is contained in any positive cycle it intersects. (The sign of a cycle is the product of the signs of its arcs.) The matrix is consistently signed if each \(p\times p\) principal minor has sign \((- 1)^ p.\) The authors classify irreducible GM-matrices as follows: I. All cycles are negative (L-matrix). II. All cycles are positive (simply related to Z-matrices and M-matrices). III. There are positive and negative cycles, and every positive cycle has length n (degenerate case). IV. There are positive and negative cycles, and some positive cycle has length less than n. Conditions are obtained for a matrix of class III or IV to be consistently signed, and a canonical form is specified for class IV. For consistently signed class IV matrices, some information about elements of the inverse is found.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    qualitative matrix
    0 references
    stability
    0 references
    structure
    0 references
    signed digraph
    0 references
    principal minors
    0 references
    GM-matrix
    0 references
    cycle
    0 references
    irreducible
    0 references
    L-matrix
    0 references
    Z-matrices
    0 references
    M-matrices
    0 references
    degenerate
    0 references
    consistently signed
    0 references
    inverse
    0 references