Realizations of interlacing by tree-patterned matrics

DOI10.1080/03081089508818337zbMath0817.05044OpenAlexW2026369810MaRDI QIDQ4322523

Frank Uhlig, Peter M. Nylen

Publication date: 9 February 1995

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

Full work available at URL: https://doi.org/10.1080/03081089508818337

zbMATH Keywords

treesingular valuesinterlacingreal matrix

Mathematics Subject Classification ID

Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20)

Related Items

Dirichlet-Neumann inverse spectral problem for a star graph of Stieltjes strings ⋮ On the relationship between the multiplicities of eigenvalues in finite- and infinite-dimensional problems on graphs ⋮ Inverse eigenvalue problems associated with spring-mass systems ⋮ Minimum-rank matrices with prescribed graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimax and interlacing theorems for matrices
• Construction of acyclic matrices from spectral data
• The numerically stable reconstruction of a Jacobi matrix from spectral data
• Interlacing inequalities for invariant factors
• Imbedding conditions for \(\lambda\)-matrices
• Principal submatrices. IX: Interlacing inequalities for singular values of submatrices
• Imbedding Conditions for Hermitian and Normal Matrices
• The Use of Linear Graphs in Gauss Elimination

This page was built for publication: Realizations of interlacing by tree-patterned matrics