7 research outputs found

    Inverses of Unipathic M-Matrices

    Full text link

    Inverse M-matrices, II

    Get PDF
    AbstractThis is an update of the 1981 survey by the first author. In the meantime, a considerable amount has been learned about the very special structure of the important class of inverse M-matrices. Developments since the earlier survey are emphasized, but we have tried to be somewhat complete; and, some results have not previously been published. Some proofs are given where appropriate and references are given for others. After some elementary preliminaries, results are grouped by certain natural categories

    Characterizations of inverse M-matrices with special zero patterns

    Get PDF
    AbstractIn this paper, we provide some characterizations of inverse M-matrices with special zero patterns. In particular, we give necessary and sufficient conditions for k-diagonal matrices and symmetric k-diagonal matrices to be inverse M-matrices. In addition, results for triadic matrices, tridiagonal matrices and symmetric 5-diagonal matrices are presented as corollaries

    Inverse M-matrices, II

    Get PDF
    AbstractThis is an update of the 1981 survey by the first author. In the meantime, a considerable amount has been learned about the very special structure of the important class of inverse M-matrices. Developments since the earlier survey are emphasized, but we have tried to be somewhat complete; and, some results have not previously been published. Some proofs are given where appropriate and references are given for others. After some elementary preliminaries, results are grouped by certain natural categories

    Subject Index Volumes 1–200

    Get PDF

    Inverses Of Unipathic M-Matrices

    No full text
    In this paper we characterize all nonnegative matrices whose inverses are M-matrices with unipathic digraphs. A digraph is called unipathic if there is at most one simple path from any vertex j to any other vertex k. The set of unipathic digraphs on n vertices includes the simple n-cycle and all digraphs whose underlying undirected graphs are trees (or forests). Our results facilitate the construction of nonnegative matrices whose inverses are M-matrices with unipathic digraphs. We highlight this procedure for inverses of tridiagonal M-matrices and of M-matrices whose digraphs are simple n-cycles with loops
    corecore