On certain linear mappings between inner-product and squared-distance matrices

DOI10.1016/0024-3795(88)90006-7zbMath0644.15003OpenAlexW2147902861MaRDI QIDQ1102346

Frank Critchley

Publication date: 1988

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

Full work available at URL: https://doi.org/10.1016/0024-3795(88)90006-7

zbMATH Keywords

inverseinner product spacemultidimensional scalingadjoint mappingsinner product matricesSpectral decompositionssquared distance matrices

Mathematics Subject Classification ID

Eigenvalues, singular values, and eigenvectors (15A18) Algebraic systems of matrices (15A30) Linear transformations, semilinear transformations (15A04) Conditioning of matrices (15A12)

Related Items

Better initial configurations for metric multidimensional scaling, On cell matrices: a class of Euclidean distance matrices, On dimensional rigidity of bar-and-joint frameworks, Uniqueness of the solutions of some completion problems, Connections between the real positive semidefinite and distance matrix completion problems, The cone of distance matrices, Circum-Euclidean distance matrices and faces, On yielding and jointly yielding entries of Euclidean distance matrices, Wasserstein distances in the analysis of time series and dynamical systems, A facial reduction approach for the single source localization problem, Unnamed Item, Iterative denoising, On the uniqueness of Euclidean distance matrix completions., The walk distances in graphs, Equality relating Euclidean distance cone to positive semidefinite cone, Inverse eigenvalue problem of distance matrix via orthogonal matrix, The embedding problem for predistance matrices, Graph rigidity via Euclidean distance matrices, Universal rigidity of bar frameworks via the geometry of spectrahedra, Sensitivity analysis of the strain criterion for multidimensional scaling, On the nullspace, the rangespace and the characteristic polynomial of Euclidean distance matrices, On the uniqueness of Euclidean distance matrix completions: the case of points in general position, On representations of graphs as two-distance sets, Moore-Penrose inverse of a hollow symmetric matrix and a predistance matrix, Euclidean Distance Matrices and Applications, Combining dissimilarity matrices by using rank correlations, The out-of-sample problem for classical multidimensional scaling, On unit spherical Euclidean distance matrices which differ in one entry, Block matrices and multispherical structure of distance matrices, A genetic algorithm for circulant Euclidean distance matrices, Approximate and exact completion problems for Euclidean distance matrices using semidefinite programming, Extensions of classical multidimensional scaling via variable reduction, Distance matrices and regular figures, Semi-supervised learning with regularized Laplacian, An optimization problem on subsets of the symmetric positive-semidefinite matrices

Cites Work

• The best Euclidean fit to a given distance matrix in prescribed dimensions
• Properties of Euclidean and non-Euclidean distance matrices
• The relation between hierarchical and Euclidean models for psychological distances
• Quadratic entropy and analysis of diversity
• Some boundary conditions for a monotone analysis of symmetric matrices
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item