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

DOI10.3336/GM.53.1.05zbMATH Open1400.15015arXiv1510.07675OpenAlexW2809091040WikidataQ129650794 ScholiaQ129650794MaRDI QIDQ3177781FDOQ3177781

Authors: Muhammad Elgebali, Nermine El-Sissi 

Publication date: 2 August 2018

Published in: Glasnik Matematicki (Search for Journal in Brave)

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.

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

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

zbMATH Keywords

factorizationplanar networktotally positive matrices

Mathematics Subject Classification ID

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

Cited In (2)

• Schur complements and LDU decomposition in an additive category
• Title not available (Why is that?)

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)