A dual basis approach to multidimensional scaling

DOI10.1016/j.laa.2023.11.004zbMath1530.51006arXiv2303.05682OpenAlexW4388562269MaRDI QIDQ6185978

Samuel Lichtenberg, Abiy Tasissa

Publication date: 9 January 2024

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

Full work available at URL: https://arxiv.org/abs/2303.05682

zbMATH Keywords

distance geometrymultidimensional scalingdual basismatrix nearness

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalue problems for linear operators (47A75) Structural characterization of families of graphs (05C75) General theory of distance geometry (51K05)

Cites Work

• Sensor network localization, Euclidean distance matrix completions, and graph realization
• Matrix pencils: Theory, applications, and numerical methods
• Recent advances on the discretizable molecular distance geometry problem
• Multidimensional scaling. I: Theory and method
• Exact matrix completion via convex optimization
• Using a Distributed SDP Approach to Solve Simulated Protein Molecular Conformation Problems
• Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
• The Metric Nearness Problem
• Exact Reconstruction of Euclidean Distance Geometry Problem Using Low-Rank Matrix Completion
• Some distance properties of latent root and vector methods used in multivariate analysis

This page was built for publication: A dual basis approach to multidimensional scaling