Treediagonal matrices and their inverses
From MaRDI portal
Cites work
- A theorem on inverses of tridiagonal matrices
- scientific article; zbMATH DE number 3553637 (Why is no real title available?)
- scientific article; zbMATH DE number 3408799 (Why is no real title available?)
- Parallel concepts in graph theory
- Partially Bounded Continued Fractions
- The Use of Linear Graphs in Gauss Elimination
Cited in
(17)- Determinantal formulae for matrices with sparse inverses
- Inverses of trees
- Linear mappings which preserve acyclicity properties of graphs and digraphs and applications to matrices
- Lower eigenvalue bounds for singular pencils of matrices
- Qualitative comparative statics
- Resonances in one dimension and Fredholm determinants
- Group inverses of adjacency matrices of cycles, wheels and brooms
- On nonsingular acyclic M-matrices whose inverse is also acyclic
- Potentials of random walks on trees
- Matrix Diagonal Stability and Its Implications
- Graph invertibility and median eigenvalues
- A Class of M-Matrices with Tree Graphs
- A Class ofM-matrices whose Graphs are Trees
- scientific article; zbMATH DE number 7510499 (Why is no real title available?)
- Factoring matrices with a tree-structured sparsity pattern
- Singular matrices whose Moore-Penrose inverse is tridiagonal
- On sign-invertible graphs
This page was built for publication: Treediagonal matrices and their inverses
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1161577)
