<?xml version="1.0" encoding="UTF-8"?><rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:dcq="http://purl.org/dc/terms/"><records count="1" morepages="false" start="1" end="1"><record rownumber="1"><dc:product_type>Journal Article</dc:product_type><dc:title>A dual basis approach to multidimensional scaling</dc:title><dc:creator>Lichtenberg, Samuel; Tasissa, Abiy</dc:creator><dc:corporate_author/><dc:editor/><dc:description>Classical multidimensional scaling (CMDS) is a technique that embeds a set of objects in a Euclidean space given their pairwise Euclidean distances. The main part of CMDS involves double centering a squared distance matrix and using a truncated eigendecomposition to recover the point coordinates. In this paper, motivated by a study in Euclidean distance geometry, we explore a dual basis approach to CMDS. We give an explicit formula for the dual basis vectors and fully characterize the spectrum of an essential matrix in the dual basis framework. We make connections to a related problem in metric nearness.</dc:description><dc:publisher>Linear Algebra and its Application</dc:publisher><dc:date>2024-02-01</dc:date><dc:nsf_par_id>10532111</dc:nsf_par_id><dc:journal_name>Linear Algebra and its Applications</dc:journal_name><dc:journal_volume>682</dc:journal_volume><dc:journal_issue>C</dc:journal_issue><dc:page_range_or_elocation>86 to 95</dc:page_range_or_elocation><dc:issn>0024-3795</dc:issn><dc:isbn/><dc:doi>https://doi.org/10.1016/j.laa.2023.11.004</dc:doi><dcq:identifierAwardId>2208392</dcq:identifierAwardId><dc:subject>Multidimensional scaling</dc:subject><dc:subject>Distance geometry</dc:subject><dc:subject>Dual basis</dc:subject><dc:subject>Matrix nearness</dc:subject><dc:version_number/><dc:location/><dc:rights/><dc:institution/><dc:sponsoring_org>National Science Foundation</dc:sponsoring_org></record></records></rdf:RDF>