Methods for constructing distance matrices and the inverse eigenvalue problem
Necessary conditions are provided on \(Z\) in order that \(D=\left[ \begin{smallmatrix} D_1 & Z\\ Z^T & D_2\end{smallmatrix}\right]\in\mathbb{R}^{n\times n}\) is a distance matrix \((D_1,D_2\) are distance matrices). To construct an \((n+1) \times (n+1)\) distance matrix it is always possible to border an \(n\times n\) distance matrix with certain scalar multiples of the Perron eigenvector. Necessary and sufficient conditions are obtained for the use of the Perron eigenvector related to the \(D_1\) and \(D_2\) blocks in the formation of the above distance matrix. The solution of the inverse eigenvalue problem is discussed. The case of the existence of a Hadamard matrix is included.
- A note on ``Methods for constructing distance matrices and the inverse eigenvalue problem
- Inverse eigenvalue problem of distance matrix via orthogonal matrix
- On the eigenvalues of Euclidean distance matrices
- A note on the determinants and eigenvalues of distance matrices
- Eigenvalues of euclidean distance matrices
- On distance matrices and Laplacians
- Inverse eigenvalue problem for Euclidean distance matrices of size 3
- Structure method for solving the nearest Euclidean distance matrix problem
- Norm estimates for inverses of Euclidean distance matrices
- A constructive algorithm for realizing a distance matrix
- Euclidean graph distance matrices of generalizations of the star graph
- Estimating the gap of finite metric spaces of strict \(p\)-negative type
- A note on ``Methods for constructing distance matrices and the inverse eigenvalue problem
- On the diagonal scaling of Euclidean distance matrices to doubly stochastic matrices
- Semidefiniteness without real symmetry
- On the inverse eigenvalue problem of symmetric nonnegative matrices
- On unit spherical Euclidean distance matrices which differ in one entry
- Inverse eigenvalue problem of distance matrix via orthogonal matrix
- Inverse eigenvalue problem for Euclidean distance matrices of size 3
- Distance matrices and quadratic embedding of graphs
- An inverse formula for the distance matrix of a fan graph
- An exact cutting plane method for the Euclidean max-sum diversity problem
- Euclidean and circum-Euclidean distance matrices: characterizations and interlacing property
- Semidefinite programming for discrete optimization and matrix completion problems
- On Euclidean distance matrices
- On properties of cell matrices
This page was built for publication: Methods for constructing distance matrices and the inverse eigenvalue problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1124929)
