A note on ``Methods for constructing distance matrices and the inverse eigenvalue problem
From MaRDI portal
Publication:1758477
DOI10.1016/j.laa.2012.06.044zbMath1270.15007OpenAlexW1976090124MaRDI QIDQ1758477
Publication date: 9 November 2012
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2012.06.044
Related Items (4)
Euclidean graph distance matrices of generalizations of the star graph ⋮ On the inverse eigenvalue problem of symmetric nonnegative matrices ⋮ Inverse eigenvalue problem of distance matrix via orthogonal matrix ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Construction of nonnegative symmetric matrices with given spectrum
- Equality relating Euclidean distance cone to positive semidefinite cone
- On properties of cell matrices
- On the eigenvalues of Euclidean distance matrices
- Methods for constructing distance matrices and the inverse eigenvalue problem
- Eigenvalues of nonnegative symmetric matrices
- On the nullspace, the rangespace and the characteristic polynomial of Euclidean distance matrices
- Constructing a Hermitian Matrix from Its Diagonal Entries and Eigenvalues
- Metric Spaces and Positive Definite Functions
This page was built for publication: A note on ``Methods for constructing distance matrices and the inverse eigenvalue problem