Methods for constructing distance matrices and the inverse eigenvalue problem

DOI10.1016/S0024-3795(99)00065-8zbMath0935.15004WikidataQ127109511 ScholiaQ127109511MaRDI QIDQ1124929

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

Publication date: 29 November 1999

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

zbMATH Keywords

Hadamard matrixinverse eigenvalue problemdistance matrixPerron eigenvector

Mathematics Subject Classification ID

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

Related Items (14)

Euclidean graph distance matrices of generalizations of the star graph ⋮ Estimating the gap of finite metric spaces of strict \(p\)-negative type ⋮ On Euclidean distance matrices ⋮ On the inverse eigenvalue problem of symmetric nonnegative matrices ⋮ An inverse formula for the distance matrix of a fan graph ⋮ An exact cutting plane method for the Euclidean max-sum diversity problem ⋮ Inverse eigenvalue problem of distance matrix via orthogonal matrix ⋮ Semidefiniteness without real symmetry ⋮ INVERSE EIGENVALUE PROBLEM FOR EUCLIDEAN DISTANCE MATRICES OF SIZE 3 ⋮ A note on ``Methods for constructing distance matrices and the inverse eigenvalue problem ⋮ Semidefinite programming for discrete optimization and matrix completion problems ⋮ On properties of cell matrices ⋮ On the diagonal scaling of Euclidean distance matrices to doubly stochastic matrices ⋮ Distance matrices and quadratic embedding of graphs

This page was built for publication: Methods for constructing distance matrices and the inverse eigenvalue problem