Methods for constructing distance matrices and the inverse eigenvalue problem

DOI10.1016/S0024-3795(99)00065-8MaRDI QIDQ1124929zbMATH OpenWikidataFDO

Authors Thomas L. Hayden, Robert Reams, James H. Wells

Publication date 29 November 1999

Published in Linear Algebra and its Applications (Search for Journal in Brave)

zbMATH Keywords

distance matrixinverse eigenvalue problemHadamard matrixPerron eigenvector

Mathematics Subject Classification ID

Eigenvalues, singular values, and eigenvectors (15A18) Hermitian, skew-Hermitian, and related matrices (15B57) Positive matrices and their generalizations; cones of matrices (15B48) Inverse problems in linear algebra (15A29)

Recommendations

• 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

Cited in

(16)

• Distance matrices and quadratic embedding of graphs
• On Euclidean distance matrices
• Semidefinite programming for discrete optimization and matrix completion problems
• On properties of cell matrices
• Euclidean graph distance matrices of generalizations of the star graph
• On the inverse eigenvalue problem of symmetric nonnegative matrices
• A note on ``Methods for constructing distance matrices and the inverse eigenvalue problem
• Inverse eigenvalue problem for Euclidean distance matrices of size 3
• Inverse eigenvalue problem of distance matrix via orthogonal matrix
• Euclidean and circum-Euclidean distance matrices: characterizations and interlacing property
• On the diagonal scaling of Euclidean distance matrices to doubly stochastic matrices
• On unit spherical Euclidean distance matrices which differ in one entry
• An exact cutting plane method for the Euclidean max-sum diversity problem
• Semidefiniteness without real symmetry
• Estimating the gap of finite metric spaces of strict \(p\)-negative type
• An inverse formula for the distance matrix of a fan graph

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)