Treediagonal matrices and their inverses

DOI10.1016/0024-3795(82)90142-2zbMath0479.15006OpenAlexW2078941536MaRDI QIDQ1161577

Douglas J. Klein

Publication date: 1982

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(82)90142-2

zbMATH Keywords

determinantinverseassociated graphtreediagonal matrix

Mathematics Subject Classification ID

Theory of matrix inversion and generalized inverses (15A09) Determinants, permanents, traces, other special matrix functions (15A15) Hermitian, skew-Hermitian, and related matrices (15B57)

Related Items (16)

Potentials of random walks on trees ⋮ Linear mappings which preserve acyclicity properties of graphs and digraphs and applications to matrices ⋮ Group inverses of adjacency matrices of cycles, wheels and brooms ⋮ Graph invertibility and median eigenvalues ⋮ A Class ofM-matrices whose Graphs are Trees ⋮ Qualitative comparative statics ⋮ On nonsingular acyclic M-matrices whose inverse is also acyclic ⋮ Singular matrices whose Moore-Penrose inverse is tridiagonal ⋮ Lower eigenvalue bounds for singular pencils of matrices ⋮ Unnamed Item ⋮ Factoring matrices with a tree-structured sparsity pattern ⋮ Matrix Diagonal Stability and Its Implications ⋮ Resonances in one dimension and Fredholm determinants ⋮ Determinantal formulae for matrices with sparse inverses ⋮ A Class of M-Matrices with Tree Graphs ⋮ Inverses of trees

Cites Work

• Unnamed Item
• Unnamed Item
• A theorem on inverses of tridiagonal matrices
• Parallel concepts in graph theory
• Partially Bounded Continued Fractions
• The Use of Linear Graphs in Gauss Elimination

This page was built for publication: Treediagonal matrices and their inverses