A combinatorial interpretation of the LDU-decomposition of totally positive matrices and their inverses

DOI10.3336/GM.53.1.05zbMATHOpenAlexWikidataMaRDI QIDQ3177781FDO

Authors Muhammad Elgebali, Nermine El-Sissi

Publication date 2 August 2018

Published in Glasnik Matematicki (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1510.07675

zbMATH Keywords

factorizationplanar networktotally positive matrices

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Factorization of matrices (15A23)

Abstract: We study the combinatorial description of the LDU decomposition of totally positive matrices. We give a description of the lower triangular L, the diagonal D, and the upper triangular U matrices of the LDU decomposition of totally positive matrices in terms of the combinatorial structure of essential planar networks described by Zelvinsky and Fomin. Similarly, we find a combinatorial description of the inverses of these matrices. In addition, we provide recursive formulae for computing the L, D, and U matrices of a totally positive matrix.

Recommendations

• $LDU$ Factorization of Nonsingular Totally Nonpositive Matrices
• Combinatorics and total positivity
• scientific article; zbMATH DE number 1136347
• Quasi-\(LDU\) factorization of nonsingular totally nonpositive matrices
• Full rank factorization in quasi-\(LDU\) form of totally nonpositive rectangular matrices

Cited in

(2)

• Schur complements and LDU decomposition in an additive category
• scientific article; zbMATH DE number 3892462 (Why is no real title available?)

This page was built for publication: A combinatorial interpretation of the LDU-decomposition of totally positive matrices and their inverses

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3177781)