Solving partial differential equations on manifolds from incomplete interpoint distance

DOI10.1137/17M1111176zbMATH Open1375.65146OpenAlexW2577744398MaRDI QIDQ5364201FDOQ5364201

Authors Rongjie Lai, J. Li 

Publication date 4 October 2017

Published in SIAM Journal on Scientific Computing (Search for Journal in Brave)

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

zbMATH Keywords

low-rank matrix completionmanifoldsnumerical experimenteikonal equationLaplace-Beltrami eigenproblemlocal reconstructioninterpoint distance information

Mathematics Subject Classification ID

Matrix completion problems (15A83) Hamilton-Jacobi equations (35F21) Elliptic equations on manifolds, general theory (58J05) Numerical methods for eigenvalue problems for boundary value problems involving PDEs (65N25)

Abstract: 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.

Recommendations

• Solving PDEs on manifolds represented as point clouds and applications
• Solving partial differential equations on point clouds
• Point Integral Method for Solving Poisson-Type Equations on Manifolds from Point Clouds with Convergence Guarantees
• A local mesh method for solving PDEs on point clouds
• Partial differential equations for interpolation and compression of surfaces

Cites work

• scientific article; zbMATH DE number 3877889 (Why is no real title available?)
• scientific article; zbMATH DE number 699389 (Why is no real title available?)
• scientific article; zbMATH DE number 7051273 (Why is no real title available?)
• scientific article; zbMATH DE number 2152053 (Why is no real title available?)
• scientific article; zbMATH DE number 2188749 (Why is no real title available?)
• 10.1162/153244304322972667
• A fast marching level set method for monotonically advancing fronts.
• A fast sweeping method for Eikonal equations
• A feasible method for optimization with orthogonality constraints
• A level-set method for computing the eigenvalues of elliptic operators defined on compact hypersurfaces
• A local mesh method for solving PDEs on point clouds
• A note on two problems in connexion with graphs
• A remark on global positioning from local distances
• Alternating direction augmented Lagrangian methods for semidefinite programming
• Computing Discrete Minimal Surfaces and Their Conjugates
• Computing geodesic paths on manifolds
• Convergence of a block coordinate descent method for nondifferentiable minimization
• Diffusion maps
• Embedding Riemannian manifolds by their heat kernel
• Exact matrix completion via convex optimization
• Finite element methods for surface PDEs
• Fronts propagating with curvature-dependent speed: Algorithms based on Hamilton-Jacobi formulations
• Geometric curve flows on parametric manifolds
• Global registration of multiple point clouds using semidefinite programming
• Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
• Image Processing and Data Analysis
• Manifold parametrizations by eigenfunctions of the Laplacian and heat kernels
• Modern multidimensional scaling. Theory and applications.
• Multiscale nonrigid point cloud registration using rotation-invariant sliced-Wasserstein distance via Laplace-Beltrami eigenmap
• Principal component analysis.
• Reconstructing a three-dimensional model with arbitrary errors
• Semi-supervised learning on Riemannian manifolds
• Semidefinite Programming
• Semidefinite optimization
• Solving Euclidean distance matrix completion problems via semidefinite progrmming
• Solving partial differential equations on point clouds
• The discretizable molecular distance geometry problem
• Variational method on Riemann surfaces using conformal parameterization and its applications to image processing
• Variational problems and partial differential equations on implicit surfaces

Cited in

(8)

• Ghost Point Diffusion Maps for Solving Elliptic PDEs on Manifolds with Classical Boundary Conditions
• Low-rank matrix completion in a general non-orthogonal basis
• Multi-dimensional scaling from \(K\)-nearest neighbourhood distances
• Solving PDEs with Incomplete Information
• Solving variational problems and partial differential equations that map between manifolds via the closest point method
• Solving PDEs on manifolds represented as point clouds and applications
• Solving partial differential equations on point clouds
• Bridging and Improving Theoretical and Computational Electrical Impedance Tomography via Data Completion

Describes a project that uses

Uses Software

• SNLSDP

This page was built for publication: Solving partial differential equations on manifolds from incomplete interpoint distance

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5364201)