Inverse eigenvalue problems for two special acyclic matrices
Summary: In this paper, we study two inverse eigenvalue problems (IEPs) of constructing two special acyclic matrices. The first problem involves the reconstruction of matrices whose graph is a path, from given information on one eigenvector of the required matrix and one eigenvalue of each of its leading principal submatrices. The second problem involves reconstruction of matrices whose graph is a broom, the eigen data being the maximum and minimum eigenvalues of each of the leading principal submatrices of the required matrix. In order to solve the problems, we use the recurrence relations among leading principal minors and the property of simplicity of the extremal eigenvalues of acyclic matrices.
- Inverse eigenvalue problems with partial eigen data for acyclic matrices whose graph is a broom
- Two inverse eigenvalue problems for a special kind of matrices
- Inverse eigenvalue problems for acyclic matrices whose graph is a dense centipede
- Some inverse problems for acyclic matrices
- Generalized inverse eigenvalue problem for matrices whose graph is a path
- m-functions and inverse generalized eigenvalue problem
- Acyclic matrices with a small number of distinct eigenvalues
- Construction of acyclic matrices from spectral data
- Construction of matrices with a given graph and prescribed interlaced spectral data
- Dirichlet-Neumann inverse spectral problem for a star graph of Stieltjes strings
- Generalized inverse eigenvalue problem for matrices whose graph is a path
- Generalized inverse eigenvalue problem with mixed eigendata
- scientific article; zbMATH DE number 2128210 (Why is no real title available?)
- Inverse Eigenvalue Problems
- Inverse eigenvalue problems associated with spring-mass systems
- Location and multiplicities of eigenvalues for a star graph of Stieltjes strings
- On Some Eigenvector-Eigenvalue Relations
- On the minimum number of distinct eigenvalues for a symmetric matrix whose graph is a given tree
- Spectral graph theory and the inverse eigenvalue problem of a graph
- The Parter--Wiener Theorem: Refinement and Generalization
- Two inverse eigenvalue problems for a special kind of matrices
- Inverse eigenvalue problems for acyclic matrices whose graph is a dense centipede
- The minimax inverse eigenvalue problem for matrices whose graph is a generalized star of depth 2
- Inverse eigenvalue problem for constructing a kind of acyclic matrices with two eigenpairs.
- On the inverse eigenvalue problem for a special kind of acyclic matrices.
- Two inverse eigenvalue problems for a special kind of matrices
- Inverse eigenvalue problems with partial eigen data for acyclic matrices whose graph is a broom
- On the inverse eigenvalue problem for periodic Jacobi matrices
- Inverse singular value problem for nonsymmetric ahead arrow matrix
- Two inverse eigenvalue problems for matrices whose graphs are trees
- Inverse spectral problems for arrowhead matrices
- Extremal realization spectra by two acyclic matrices whose graphs are caterpillars
- Extremal inverse eigenvalue problem for matrices described by a connected unicyclic graph.
- Some inverse problems for acyclic matrices
This page was built for publication: Inverse eigenvalue problems for two special acyclic matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q272125)
