Back to search

University of Waterloo

Euclidean Distance Matrix Correction with a Single Corrupted Element

Abstract

dc:description.abstract

In this thesis, we study the problem of correcting the error from a noisy Euclidean distance matrix (EDM). An EDM is a matrix where elements are squared distance between points in R^d. We consider the special case where only one of the distance is corrupted. We develop efficient algorithms to solve this problem, initially assuming that the points are in general position, and solve the problem using three different types of facial reduction: exposing vector, facial vectors, and Gale transform. Furthermore, we investigate yielding elements of an EDM and develop an algorithm for identifying one small principal submatrix with the embedding dimension d when many of the points are in a linear manifold of dimension smaller than d, allowing us to handle a more general problem. We present numerical experiments implemented in MATLAB, demonstrating the effectiveness of our solutions.

Degree

thesis:*
Grantor dc:publisher
University of Waterloo
Year dc:date.issued
2024

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Tina Chenrui, Xu
Advisors dc:contributor.advisor
  • Wolkowicz, Henry
  • Walaa, Moursi

Rights

Language dc:language.iso
en

Identifiers

dc:identifier.*
Handle dc:identifier.uri
https://hdl.handle.net/10012/20880

Chain of custody

source
Harvested from
University of Waterloo
Base URL
dspacemainprd01.lib.uwaterloo.ca/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
related terms
citation

Tina Chenrui, Xu. Euclidean Distance Matrix Correction with a Single Corrupted Element. University of Waterloo, 2024. https://hdl.handle.net/10012/20880