Spectral methods for solving elliptic PDEs on unknown manifolds

被引:2
|
作者
Yan, Qile [1 ]
Jiang, Shixiao Willing [2 ]
Harlim, John [3 ]
机构
[1] Penn State Univ, Dept Math, University Pk, PA 16802 USA
[2] ShanghaiTech Univ, Inst Math Sci, Shanghai 201210, Peoples R China
[3] Penn State Univ, Inst Computat & Data Sci, Dept Math, Dept Meteorol & Atmospher Sci, University Pk, PA 16802 USA
关键词
Radial basis function; Galerkin approximation; Elliptic PDEs solver; Point cloud data; PARTIAL-DIFFERENTIAL-EQUATIONS; FINITE-ELEMENT METHODS; RADIAL BASIS FUNCTIONS; POINT INTEGRAL METHOD; SHAPE-PARAMETERS; INTERPOLATION; LAPLACIAN; SCHEME;
D O I
10.1016/j.jcp.2023.112132
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
In this paper, we propose a mesh-free numerical method for solving elliptic PDEs on unknown manifolds, identified with randomly sampled point cloud data. The PDE solver is formulated as a spectral method where the test function space is the span of the leading eigenfunctions of the Laplacian operator, which are approximated from the point cloud data. While the framework is flexible for any test functional space, we will consider the eigensolutions of a weighted Laplacian obtained from a symmetric Radial Basis Function (RBF) method induced by a weak approximation of a weighted Laplacian on an appropriate Hilbert space. In this paper, we consider a test function space that encodes the geometry of the data yet does not require us to identify and use the sampling density of the point cloud. To attain a more accurate approximation of the expansion coefficients, we adopt a second -order tangent space estimation method to improve the RBF interpolation accuracy in estimating the tangential derivatives. This spectral framework allows us to efficiently solve the PDE many times subjected to different parameters, which reduces the computational cost in the related inverse problem applications. In a well-posed elliptic PDE setting with randomly sampled point cloud data, we provide a theoretical analysis to demonstrate the convergence of the proposed solver as the sample size increases. We also report some numerical studies that show the convergence of the spectral solver on simple manifolds and unknown, rough surfaces. Our numerical results suggest that the proposed method is more accurate than a graph Laplacian-based solver on smooth manifolds. On rough manifolds, these two approaches are comparable. Due to the flexibility of the framework, we empirically found improved accuracies in both smoothed and unsmoothed Stanford bunny domains by blending the graph Laplacian eigensolutions and RBF interpolator. (c) 2023 Elsevier Inc. All rights reserved.
引用
收藏
页数:27
相关论文
共 50 条