Inverse eigenvalue problem for Euclidean distance matrices of size 3

DOI10.1017/S0004972712000755zbMATH Open1273.15009OpenAlexW2044014926MaRDI QIDQ4909991FDOQ4909991

Authors: Gašper Jaklič, Jolanda Modic 

Publication date: 22 March 2013

Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0004972712000755

Recommendations

• Inverse eigenvalue problem of distance matrix via orthogonal matrix
• A note on ``Methods for constructing distance matrices and the inverse eigenvalue problem
• On the eigenvalues of Euclidean distance matrices
• Euclidean distance matrices: new characterization and boundary properties
• Generalized Euclidean distance matrices

zbMATH Keywords

Euclidean distance matrixinverse eigenvalue problembordered matrix

Mathematics Subject Classification ID

Eigenvalues, singular values, and eigenvectors (15A18) Positive matrices and their generalizations; cones of matrices (15B48) Inverse problems in linear algebra (15A29) Numerical solutions to inverse eigenvalue problems (65F18)

Cites Work

• Eigenvalues of nonnegative symmetric matrices
• Constructing a Hermitian Matrix from Its Diagonal Entries and Eigenvalues
• Construction of nonnegative symmetric matrices with given spectrum
• On properties of cell matrices
• Some inverse problems for elliptic matrices with zero diagonal
• Methods for constructing distance matrices and the inverse eigenvalue problem

Cited In (3)

• Methods for constructing distance matrices and the inverse eigenvalue problem
• Euclidean graph distance matrices of generalizations of the star graph
• Inverse eigenvalue problem of distance matrix via orthogonal matrix

This page was built for publication: Inverse eigenvalue problem for Euclidean distance matrices of size 3

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4909991)