Solving Partial Differential Equations on Manifolds From Incomplete Inter-Point Distance
Not on the map. Why?
Abstract (arXiv)
Solutions of partial differential equations (PDEs) on manifolds have provided important applications in different fields in science and engineering. Existing methods are majorly based on discretization of manifolds as implicit functions, triangle meshes, or point clouds, where the manifold structure is approximated by either zero level set of an implicit function or a set of points. In many applications, manifolds might be only provided as an inter-point distance matrix with possible missing values. This paper discusses a framework to discretize PDEs on manifolds represented as incomplete inter-point distance information. Without conducting a time-consuming global coordinates reconstruction, we propose a more efficient strategy by discretizing differential operators only based on point-wisely local reconstruction. Our local reconstruction model is based on the recent advances of low-rank matrix completion theory, where only a very small random portion of distance information is required. This method enables us to conduct analyses of incomplete distance data using solutions of special designed PDEs such as the Laplace-Beltrami (LB) eigen-system. As an application, we demonstrate a new way of manifold reconstruction from an incomplete distance by stitching patches using the spectrum of the LB operator. Intensive numerical experiments demonstrate the effectiveness of the proposed methods.
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). First posted on arXiv 11 Jan 2017.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 2; 2024: 1; 2025: 1; 2026: 1.
5 papers.
- 2023Localization from structured distance matrices via low-rank matrix recoverycited by 4
- 2024Riemannian Optimization for Non-convex Euclidean Distance Geometry with Global Recovery Guaranteescited by 4
- 2023Sharp analysis of EM for learning mixtures of pairwise differencescited by 1
- 2025Provable Non-Convex Euclidean Distance Matrix Completion: Geometry, Reconstruction, and Robustnesscited by 0
- 2026Bayesian Matrix Completion Under Geometric Constraintscited by 0
- 2026Bayesian Matrix Completion Under Geometric Constraints30 Jan 2026
- 2025Provable Non-Convex Euclidean Distance Matrix Completion: Geometry, Reconstruction, and Robustness31 Jul 2025
- 2024Riemannian Optimization for Non-convex Euclidean Distance Geometry with Global Recovery Guarantees8 Oct 2024
- 2023Localization from structured distance matrices via low-rank matrix recovery29 Nov 2023
- 2023Sharp analysis of EM for learning mixtures of pairwise differences20 Feb 2023