Construction of acyclic matrices from spectral data
Given a tree \(\Gamma\) with n vertices, an integer \(1\leq i\leq n\) and 2n-1 real numbers \(\lambda_ 1\geq \mu_ 1\geq \lambda_ 2\geq \mu_ 2\geq...\geq \mu_{n-1}\geq \lambda_ n\), the author shows that there is an \(n\times n\) Hermitian matrix A with the following properties: (i) \(a_{ij}=a_{ji}=0\) if \(i\neq j\) and \(\{\) i,j\(\}\) is not an edge of \(\Gamma\), (ii) A has eigenvalues \(\lambda_ 1,\lambda_ 2,...,\lambda_ n\), and (iii) A(i) obtained from A by deleting row i and column i has eigenvalues \(\mu_ 1,\mu_ 2,...,\mu_{n-1}\). The result is a generalization of a number of earlier theorems stated by different authors: \textit{G. E. Shilov}, An introduction to the theory of linear spaces (1952; Zbl 0046.241), \textit{Ky Fan} and \textit{G. Pall}, Can. J. Math. 9, 298-304 (1957; Zbl 0077.245 and Correction Zbl 0078.453), \textit{O. H. Hald}, Linear Algebra Appl. 14, 63-85 (1976; Zbl 0328.15007), etc.
- Construction of a Jacobi matrix from spectral data
- scientific article; zbMATH DE number 2109092
- Construction of matrices with a given graph and prescribed interlaced spectral data
- scientific article; zbMATH DE number 1022800
- Publication:4207518
- An algorithm for constructing a pseudo‐Jacobi matrix from given spectral data
- scientific article; zbMATH DE number 4126589
- On the construction of a pseudo-Jacobi matrix from its spectral data
- scientific article; zbMATH DE number 17441
- Construction of real band anti-symmetric matrices from spectral data
- A survey of matrix inverse eigenvalue problems
- Construction of a Jacobi matrix from spectral data
- Finite sequences of orthogonal polynomials connected by a Jacobi matrix
- scientific article; zbMATH DE number 3144516 (Why is no real title available?)
- scientific article; zbMATH DE number 3185973 (Why is no real title available?)
- Imbedding Conditions for Hermitian and Normal Matrices
- Inverse eigenvalue problems for Jacobi matrices
- Matrices with prescribed characteristic polynomials and a prescribed submatrix. I, II
- Matrices with Prescribed Characteristic Roots and Diagonal Elements
- On Orthogonal Polynomials
- On the construction of a Jacobi matrix from spectral data
- On the Eigenvalues and Eigenvectors of a Class of Matrices
- On the eigenvalues of non-negative Jacobi matrices
- Principal submatrices of normal and Hermitian matrices
- The behavior of eigenvalues and singular values under perturbations of restricted rank
- The Construction of Jacobi and Periodic Jacobi Matrices With Prescribed Spectra
- The numerically stable reconstruction of a Jacobi matrix from spectral data
- The numerically stable reconstruction of Jacobi matrices from spectral data
- The reconstruction of bordered-diagonal and Jacobi matrices from spectral data
- Smith normal form and acyclic matrices
- Constructing trees with given eigenvalues and angles
- Inverse eigenvalue problems and lists of multiplicities of eigenvalues for matrices whose graph is a tree: The case of generalized stars and double generalized stars.
- Inverse eigenvalue problems for acyclic matrices whose graph is a dense centipede
- A structured inverse spectrum problem for infinite graphs
- On the relationship between the multiplicities of eigenvalues in finite- and infinite-dimensional problems on graphs
- The inverse characteristic polynomial problem for trees
- The minimax inverse eigenvalue problem for matrices whose graph is a generalized star of depth 2
- Construction of real skew-symmetric matrices from interlaced spectral data, and graph
- Inverse eigenvalue problem for constructing a kind of acyclic matrices with two eigenpairs.
- The maximum multiplicity of the largest \(k\)-th eigenvalue in a matrix whose graph is acyclic or unicyclic
- On multiplicities of eigenvalues of a boundary value problem on a snowflake graph
- Dirichlet-Neumann inverse spectral problem for a star graph of Stieltjes strings
- Generalized inverse eigenvalue problem for matrices whose graph is a path
- Minimum-rank matrices with prescribed graph
- Inverse eigenvalue problems for two special acyclic matrices
- Diameter minimal trees
- The inverse eigenvalue problem for Hermitian matrices whose graphs are cycles
- The λ − τ structured inverse eigenvalue problem
- Branch duplication for the construction of multiple eigenvalues in an Hermitian matrix whose graph is a tree
- Construction of matrices with a given graph and prescribed interlaced spectral data
- scientific article; zbMATH DE number 4126589 (Why is no real title available?)
- Realizations of interlacing by tree-patterned matrics
- Inverse eigenvalue problems with partial eigen data for acyclic matrices whose graph is a broom
- Reconstructing real symmetric matrices from eigenvalues of finite dimensional perturbations
- The number of interlacing equalities resulting from removal of a vertex from a tree
- On the eigenvalues of generalized and double generalized stars
- On multiplicities of eigenvalues of a spectral problem on a prolate tree
- Bordering of symmetric matrices and an application to the minimum number of distinct eigenvalues for the join of graphs
- Diminimal families of arbitrary diameter
- Inverse eigenvalue problems associated with spring-mass systems
- The minimum number of distinct eigenvalues of a threshold graph is at most 4
- The strong singular value property for matrices
- Augmented Lagrangian based sequential quadratic programming for a constrained inverse eigenvalue problem of a graph
This page was built for publication: Construction of acyclic matrices from spectral data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1112923)
