Solving Partial Differential Equations on Manifolds From Incomplete Interpoint Distance
DOI10.1137/17M1111176zbMath1375.65146arXiv1701.02843OpenAlexW2577744398MaRDI QIDQ5364201
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
manifoldsnumerical experimenteikonal equationlow-rank matrix completionlocal reconstructionLaplace-Beltrami eigenprobleminterpoint distance information
Elliptic equations on manifolds, general theory (58J05) Numerical methods for eigenvalue problems for boundary value problems involving PDEs (65N25) Hamilton-Jacobi equations (35F21) Matrix completion problems (15A83)
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- A feasible method for optimization with orthogonality constraints
- A local mesh method for solving PDEs on point clouds
- A level-set method for computing the eigenvalues of elliptic operators defined on compact hypersurfaces
- Alternating direction augmented Lagrangian methods for semidefinite programming
- The discretizable molecular distance geometry problem
- Semi-supervised learning on Riemannian manifolds
- Geometric curve flows on parametric manifolds
- Variational method on Riemann surfaces using conformal parameterization and its applications to image processing
- Fronts propagating with curvature-dependent speed: Algorithms based on Hamilton-Jacobi formulations
- Solving Euclidean distance matrix completion problems via semidefinite progrmming
- Embedding Riemannian manifolds by their heat kernel
- Principal component analysis.
- Diffusion maps
- Modern multidimensional scaling. Theory and applications.
- Exact matrix completion via convex optimization
- Solving Partial Differential Equations on Point Clouds
- Manifold parametrizations by eigenfunctions of the Laplacian and heat kernels
- A remark on global positioning from local distances
- Reconstructing a three-dimensional model with arbitrary errors
- 10.1162/153244304322972667
- Image Processing and Data Analysis
- Semidefinite optimization
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- Computing geodesic paths on manifolds
- Computing Discrete Minimal Surfaces and Their Conjugates
- A fast sweeping method for Eikonal equations
- Semidefinite Programming
- A fast marching level set method for monotonically advancing fronts.
- Global Registration of Multiple Point Clouds Using Semidefinite Programming
- Multiscale Nonrigid Point Cloud Registration Using Rotation-Invariant Sliced-Wasserstein Distance via Laplace--Beltrami Eigenmap
- Finite element methods for surface PDEs
- Convergence of a block coordinate descent method for nondifferentiable minimization
- Variational problems and partial differential equations on implicit surfaces
This page was built for publication: Solving Partial Differential Equations on Manifolds From Incomplete Interpoint Distance