Shixiao Willing Jiang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Shixiao Willing Jiang has a total of 20 co-authors. Here are the top co-authors by number of shared publications:
- John Harlim
Department of Mathematics Department of Meteorology and Atmospheric Science Institute for Computational and Data Sciences the Pennsylvania State University 16802 University Park PA USA
9 shared publications - Qile Yan
School of Mathematics, University of Minnesota, Minneapolis, MN 55455 USA
5 shared publications - Douglas Zhou
School of Mathematical Sciences, Shanghai Jiao Tong University, Shanghai, China
3 shared publications - Gregor Kovačič
Mathematical Sciences Department, Rensselaer Polytechnic Institute, Troy, New York, U.S.A.
3 shared publications - Haizhao Yang
Department of Mathematics University of Maryland College Park MD USA
3 shared publications David Cai
School of Mathematical Sciences, MOE-LSC, and Institute of Natural Sciences, Shanghai Jiao Tong University, Shanghai 200240, PR China
2 shared publications
Latest Publications
- 4 May 2026
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 48 (3) , A1101-A1132
Generalized Moving Least-Squares Methods for Solving Vector-Valued PDEs on Unknown Manifolds
In this paper, we extend the generalized moving least-squares method in two different ways to solve the vector-valued PDEs on unknown smooth manifolds without boundaries, identified with randomly sampled point cloud data. The two approaches are referred to as the intrinsic method and the extrinsic method. For the intrinsic method, which relies on local approximations of metric tensors, we simplify the formula of Laplacians and covariant derivatives acting on vector fields at the base point by calculating them in a local Monge coordinate system. On the other hand, the extrinsic method formulates tangential derivatives on a submanifold as the projection of the directional derivative in the ambient Euclidean space onto the tangent space of the submanifold. One challenge of this method is that the discretization of vector Laplacians yields a matrix whose size relies on the ambient dimension. To overcome this issue, we reduce the dimension of vector Laplacian matrices by employing a coordinate transformation. The complexity of both methods scales well with the dimension of manifolds rather than with the ambient dimension. We also present supporting numerical examples, including eigenvalue problems, linear Poisson equations, and nonlinear Burgers’ equations, to examine the numerical accuracy of the proposed methods on various smooth manifolds.
- 4 May 2026
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 48 (3) , A1101-A1132
Generalized Moving Least-Squares Methods for Solving Vector-Valued PDEs on Unknown Manifolds
In this paper, we extend the generalized moving least-squares method in two different ways to solve the vector-valued PDEs on unknown smooth manifolds without boundaries, identified with randomly sampled point cloud data. The two approaches are referred to as the intrinsic method and the extrinsic method. For the intrinsic method, which relies on local approximations of metric tensors, we simplify the formula of Laplacians and covariant derivatives acting on vector fields at the base point by calculating them in a local Monge coordinate system. On the other hand, the extrinsic method formulates tangential derivatives on a submanifold as the projection of the directional derivative in the ambient Euclidean space onto the tangent space of the submanifold. One challenge of this method is that the discretization of vector Laplacians yields a matrix whose size relies on the ambient dimension. To overcome this issue, we reduce the dimension of vector Laplacian matrices by employing a coordinate transformation. The complexity of both methods scales well with the dimension of manifolds rather than with the ambient dimension. We also present supporting numerical examples, including eigenvalue problems, linear Poisson equations, and nonlinear Burgers’ equations, to examine the numerical accuracy of the proposed methods on various smooth manifolds.
- 11 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Ultrasonics, Ferroelectrics, and Frequency Control
- Vol. 72 (12) , 1595-1606
Real-Time Heterogeneous Helical Wave Spectrum Method for Transabdominal Passive Acoustic Mapping
In focused ultrasound (FUS) therapy, passive acoustic mapping (PAM) with convex arrays is often employed to monitor the cavitation activity in human abdomen given their large acoustic window. However, phase aberration caused by the speed-of-sound (SoS) heterogeneity in the abdominal wall degrades the image quality, leading to inaccurate localization of the cavitation source and, hence, deteriorates the safety and efficacy level of the therapy. In this work, we derive the general solution to the wave equation in SoS heterogeneous media in polar coordinates. With the solution, we propose the real-time heterogeneous helical wave spectrum (HHWS) method to account for SoS heterogeneity in trans-abdominal PAM with convex arrays. In both the in silico and in vitro experiments mimicking trans-abdominal PAM imaging of single and multiple microbubble (MB) cavitation source(s) in humans, the results clearly demonstrated the phase aberration-correction capability of the HHWS method with improved image quality and source localization accuracy, compared to the HWS method for homogeneous media. A parallel implementation of the HHWS method realized a several tens of milliseconds image reconstruction speed for phase-aberration corrected PAM in a large field-of-view. Combined with B-mode imaging, real-time dual-mode monitoring of MB cavitation activity in the heterogeneous medium mimicking human abdominal wall with a single probe has been realized. These results well demonstrated the potential of the HHWS method for trans-abdominal PAM with convex arrays, for safe, effective, and controlled cavitation-based FUS therapies.
- 11 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Ultrasonics, Ferroelectrics, and Frequency Control
- Vol. 72 (12) , 1595-1606
Real-Time Heterogeneous Helical Wave Spectrum Method for Transabdominal Passive Acoustic Mapping
In focused ultrasound (FUS) therapy, passive acoustic mapping (PAM) with convex arrays is often employed to monitor the cavitation activity in human abdomen given their large acoustic window. However, phase aberration caused by the speed-of-sound (SoS) heterogeneity in the abdominal wall degrades the image quality, leading to inaccurate localization of the cavitation source and, hence, deteriorates the safety and efficacy level of the therapy. In this work, we derive the general solution to the wave equation in SoS heterogeneous media in polar coordinates. With the solution, we propose the real-time heterogeneous helical wave spectrum (HHWS) method to account for SoS heterogeneity in trans-abdominal PAM with convex arrays. In both the in silico and in vitro experiments mimicking trans-abdominal PAM imaging of single and multiple microbubble (MB) cavitation source(s) in humans, the results clearly demonstrated the phase aberration-correction capability of the HHWS method with improved image quality and source localization accuracy, compared to the HWS method for homogeneous media. A parallel implementation of the HHWS method realized a several tens of milliseconds image reconstruction speed for phase-aberration corrected PAM in a large field-of-view. Combined with B-mode imaging, real-time dual-mode monitoring of MB cavitation activity in the heterogeneous medium mimicking human abdominal wall with a single probe has been realized. These results well demonstrated the potential of the HHWS method for trans-abdominal PAM with convex arrays, for safe, effective, and controlled cavitation-based FUS therapies.
- Open Access
- 7 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Ultrasonics, Ferroelectrics, and Frequency Control
- Vol. 72 (10) , 1352-1363
High-Quality Passive Acoustic Mapping With the Cross-Correlated Angular Spectrum Method
While passive acoustic mapping (PAM) has been advanced for monitoring acoustic cavitation activity in focused ultrasound (FUS) therapy, achieving both real-time and high-quality imaging capabilities is still challenging. The angular spectrum (AS) method presents the most efficient algorithm for PAM, but it suffers from artifacts and low resolution due to the diffraction pattern of the imaging array. Data-adaptive beamformers suppress artifacts well, but their overwhelming computational complexity, more than two orders of magnitude higher than the classical time exposure acoustic (TEA) method, hinders their application in real time. In this work, we introduce the cross-correlated AS method to address the challenge. This method is based on cross-correlating the AS back-propagated wave fields, in the frequency domain (FD), measured by different apodized subapertures of the transducer array to provide the normalized cross-correlation coefficient (NCC) matrix for artifacts suppression. We observed that the spatial pattern of NCC matrix is variable, which can be utilized by the triple apodization with cross correlation (TAX) with AS scheme, namely, the AS-TAX method, for optimal artifacts suppression outcomes. Both the phantom and mouse tumor experiments showed that: 1) the AS-TAX method has comparable image quality as the data-adaptive beamformers, reducing the energy spread area (ESA) by 34.8%–65.0% and improving image signal-to-noise ratio (ISNR) by 10.6–14.4 dB compared to TEA; 2) it reduces the computational complexity by two orders of magnitude compared to TEA allowing millisecond-level image reconstruction speed with a parallel implementation; and 3) it can well map microbubble cavitation activity of different status (stable or inertial). The AS-TAX method represents a real-time approach to monitor cavitation-based FUS therapy with high image quality.
- 7 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Ultrasonics, Ferroelectrics, and Frequency Control
- Vol. 72 (10) , 1352-1363
Open AccessHigh-Quality Passive Acoustic Mapping With the Cross-Correlated Angular Spectrum Method
While passive acoustic mapping (PAM) has been advanced for monitoring acoustic cavitation activity in focused ultrasound (FUS) therapy, achieving both real-time and high-quality imaging capabilities is still challenging. The angular spectrum (AS) method presents the most efficient algorithm for PAM, but it suffers from artifacts and low resolution due to the diffraction pattern of the imaging array. Data-adaptive beamformers suppress artifacts well, but their overwhelming computational complexity, more than two orders of magnitude higher than the classical time exposure acoustic (TEA) method, hinders their application in real time. In this work, we introduce the cross-correlated AS method to address the challenge. This method is based on cross-correlating the AS back-propagated wave fields, in the frequency domain (FD), measured by different apodized subapertures of the transducer array to provide the normalized cross-correlation coefficient (NCC) matrix for artifacts suppression. We observed that the spatial pattern of NCC matrix is variable, which can be utilized by the triple apodization with cross correlation (TAX) with AS scheme, namely, the AS-TAX method, for optimal artifacts suppression outcomes. Both the phantom and mouse tumor experiments showed that: 1) the AS-TAX method has comparable image quality as the data-adaptive beamformers, reducing the energy spread area (ESA) by 34.8%–65.0% and improving image signal-to-noise ratio (ISNR) by 10.6–14.4 dB compared to TEA; 2) it reduces the computational complexity by two orders of magnitude compared to TEA allowing millisecond-level image reconstruction speed with a parallel implementation; and 3) it can well map microbubble cavitation activity of different status (stable or inertial). The AS-TAX method represents a real-time approach to monitor cavitation-based FUS therapy with high image quality.
- Open Access
Solving PDEs on Unknown Manifolds with Machine Learning
This paper proposes a mesh-free computational framework and machine learning theory for solving elliptic PDEs on unknown manifolds, identified with point clouds, based on diffusion maps (DM) and deep learning. The PDE solver is formulated as a supervised learning task to solve a least-squares regression problem that imposes an algebraic equation approximating a PDE (and boundary conditions if applicable). This algebraic equation involves a graph-Laplacian type matrix obtained via DM asymptotic expansion, which is a consistent estimator of second-order elliptic differential operators. The resulting numerical method is to solve a highly non-convex empirical risk minimization problem subjected to a solution from a hypothesis space of neural networks (NNs). In a well-posed elliptic PDE setting, when the hypothesis space consists of neural networks with either infinite width or depth, we show that the global minimizer of the empirical loss function is a consistent solution in the limit of large training data. When the hypothesis space is a two-layer neural network, we show that for a sufficiently large width, gradient descent can identify a global minimizer of the empirical loss function. Supporting numerical examples demonstrate the convergence of the solutions, ranging from simple manifolds with low and high co-dimensions, to rough surfaces with and without boundaries. We also show that the proposed NN solver can robustly generalize the PDE solution on new data points with generalization errors that are almost identical to the training errors, superseding a Nystrom-based interpolation method.
Open AccessSolving PDEs on Unknown Manifolds with Machine Learning
This paper proposes a mesh-free computational framework and machine learning theory for solving elliptic PDEs on unknown manifolds, identified with point clouds, based on diffusion maps (DM) and deep learning. The PDE solver is formulated as a supervised learning task to solve a least-squares regression problem that imposes an algebraic equation approximating a PDE (and boundary conditions if applicable). This algebraic equation involves a graph-Laplacian type matrix obtained via DM asymptotic expansion, which is a consistent estimator of second-order elliptic differential operators. The resulting numerical method is to solve a highly non-convex empirical risk minimization problem subjected to a solution from a hypothesis space of neural networks (NNs). In a well-posed elliptic PDE setting, when the hypothesis space consists of neural networks with either infinite width or depth, we show that the global minimizer of the empirical loss function is a consistent solution in the limit of large training data. When the hypothesis space is a two-layer neural network, we show that for a sufficiently large width, gradient descent can identify a global minimizer of the empirical loss function. Supporting numerical examples demonstrate the convergence of the solutions, ranging from simple manifolds with low and high co-dimensions, to rough surfaces with and without boundaries. We also show that the proposed NN solver can robustly generalize the PDE solution on new data points with generalization errors that are almost identical to the training errors, superseding a Nystrom-based interpolation method.
- 30 January 2024
- Published by Elsevier in Journal of Computational Physics
- Vol. 502
Generalized finite difference method on unknown manifolds
- 30 January 2024
- Published by Elsevier in Journal of Computational Physics
- Vol. 502
Generalized finite difference method on unknown manifolds
- Open Access
Radial basis approximation of tensor fields on manifolds: From operator estimation to manifold learning
In this paper, we study the Radial Basis Function (RBF) approximation to differential operators on smooth tensor fields defined on closed Riemannian submanifolds of Euclidean space, identified by randomly sampled point cloud data. {The formulation in this paper leverages a fundamental fact that the covariant derivative on a submanifold is the projection of the directional derivative in the ambient Euclidean space onto the tangent space of the submanifold. To differentiate a test function (or vector field) on the submanifold with respect to the Euclidean metric, the RBF interpolation is applied to extend the function (or vector field) in the ambient Euclidean space. When the manifolds are unknown, we develop an improved second-order local SVD technique for estimating local tangent spaces on the manifold. When the classical pointwise non-symmetric RBF formulation is used to solve Laplacian eigenvalue problems, we found that while accurate estimation of the leading spectra can be obtained with large enough data, such an approximation often produces irrelevant complex-valued spectra (or pollution) as the true spectra are real-valued and positive. To avoid such an issue,} we introduce a symmetric RBF discrete approximation of the Laplacians induced by a weak formulation on appropriate Hilbert spaces. Unlike the non-symmetric approximation, this formulation guarantees non-negative real-valued spectra and the orthogonality of the eigenvectors. Theoretically, we establish the convergence of the eigenpairs of both the Laplace-Beltrami operator and Bochner Laplacian {for the symmetric formulation} in the limit of large data with convergence rates. Numerically, we provide supporting examples for approximations of the Laplace-Beltrami operator and various vector Laplacians, including the Bochner, Hodge, and Lichnerowicz Laplacians.
Open AccessRadial basis approximation of tensor fields on manifolds: From operator estimation to manifold learning
In this paper, we study the Radial Basis Function (RBF) approximation to differential operators on smooth tensor fields defined on closed Riemannian submanifolds of Euclidean space, identified by randomly sampled point cloud data. {The formulation in this paper leverages a fundamental fact that the covariant derivative on a submanifold is the projection of the directional derivative in the ambient Euclidean space onto the tangent space of the submanifold. To differentiate a test function (or vector field) on the submanifold with respect to the Euclidean metric, the RBF interpolation is applied to extend the function (or vector field) in the ambient Euclidean space. When the manifolds are unknown, we develop an improved second-order local SVD technique for estimating local tangent spaces on the manifold. When the classical pointwise non-symmetric RBF formulation is used to solve Laplacian eigenvalue problems, we found that while accurate estimation of the leading spectra can be obtained with large enough data, such an approximation often produces irrelevant complex-valued spectra (or pollution) as the true spectra are real-valued and positive. To avoid such an issue,} we introduce a symmetric RBF discrete approximation of the Laplacians induced by a weak formulation on appropriate Hilbert spaces. Unlike the non-symmetric approximation, this formulation guarantees non-negative real-valued spectra and the orthogonality of the eigenvectors. Theoretically, we establish the convergence of the eigenpairs of both the Laplace-Beltrami operator and Bochner Laplacian {for the symmetric formulation} in the limit of large data with convergence rates. Numerically, we provide supporting examples for approximations of the Laplace-Beltrami operator and various vector Laplacians, including the Bochner, Hodge, and Lichnerowicz Laplacians.
- Open Access
Generalized Finite Difference Method on unknown manifolds
In this paper, we extend the Generalized Finite Difference Method (GFDM) on unknown compact submanifolds of the Euclidean domain, identified by randomly sampled data that (almost surely) lie on the interior of the manifolds. Theoretically, we formalize GFDM by exploiting a representation of smooth functions on the manifolds with Taylor's expansions of polynomials defined on the tangent bundles. We illustrate the approach by approximating the Laplace-Beltrami operator, where a stable approximation is achieved by a combination of Generalized Moving Least-Squares algorithm and novel linear programming that relaxes the diagonal-dominant constraint for the estimator to allow for a feasible solution even when higher-order polynomials are employed. We establish the theoretical convergence of GFDM in solving Poisson PDEs and numerically demonstrate the accuracy on simple smooth manifolds of low and moderate high co-dimensions as well as unknown 2D surfaces. For the Dirichlet Poisson problem where no data points on the boundaries are available, we employ GFDM with the volume-constraint approach that imposes the boundary conditions on data points close to the boundary. When the location of the boundary is unknown, we introduce a novel technique to detect points close to the boundary without needing to estimate the distance of the sampled data points to the boundary. We demonstrate the effectiveness of the volume-constraint employed by imposing the boundary conditions on the data points detected by this new technique compared to imposing the boundary conditions on all points within a certain distance from the boundary, where the latter is sensitive to the choice of truncation distance and require the knowledge of the boundary location.
Open AccessGeneralized Finite Difference Method on unknown manifolds
In this paper, we extend the Generalized Finite Difference Method (GFDM) on unknown compact submanifolds of the Euclidean domain, identified by randomly sampled data that (almost surely) lie on the interior of the manifolds. Theoretically, we formalize GFDM by exploiting a representation of smooth functions on the manifolds with Taylor's expansions of polynomials defined on the tangent bundles. We illustrate the approach by approximating the Laplace-Beltrami operator, where a stable approximation is achieved by a combination of Generalized Moving Least-Squares algorithm and novel linear programming that relaxes the diagonal-dominant constraint for the estimator to allow for a feasible solution even when higher-order polynomials are employed. We establish the theoretical convergence of GFDM in solving Poisson PDEs and numerically demonstrate the accuracy on simple smooth manifolds of low and moderate high co-dimensions as well as unknown 2D surfaces. For the Dirichlet Poisson problem where no data points on the boundaries are available, we employ GFDM with the volume-constraint approach that imposes the boundary conditions on data points close to the boundary. When the location of the boundary is unknown, we introduce a novel technique to detect points close to the boundary without needing to estimate the distance of the sampled data points to the boundary. We demonstrate the effectiveness of the volume-constraint employed by imposing the boundary conditions on the data points detected by this new technique compared to imposing the boundary conditions on all points within a certain distance from the boundary, where the latter is sensitive to the choice of truncation distance and require the knowledge of the boundary location.
- Open Access
Spectral methods for solving elliptic PDEs on unknown manifolds
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. Especially, 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 convergent 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.
Open AccessSpectral methods for solving elliptic PDEs on unknown manifolds
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. Especially, 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 convergent 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.
- 23 November 2022
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 94 (1) , 1-34
Kernel-Based Methods for Solving Time-Dependent Advection-Diffusion Equations on Manifolds
- 23 November 2022
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 94 (1) , 1-34
Kernel-Based Methods for Solving Time-Dependent Advection-Diffusion Equations on Manifolds
- Open Access
- 22 December 2021
- Published by Wiley in Communications on Pure and Applied Mathematics
- Vol. 76 (2) , 337-405
Ghost Point Diffusion Maps for Solving Elliptic PDEs on Manifolds with Classical Boundary Conditions
In this paper, we extend the class of kernel methods, the so‐called diffusion maps (DM) and its local kernel variants to approximate second‐order differential operators defined on smooth manifolds with boundaries that naturally arise in elliptic PDE models. To achieve this goal, we introduce the ghost point diffusion maps (GPDM) estimator on an extended manifold, identified by the set of point clouds on the unknown original manifold together with a set of ghost points, specified along the estimated tangential direction at the sampled points on the boundary. The resulting GPDM estimator restricts the standard DM matrix to a set of extrapolation equations that estimates the function values at the ghost points. This adjustment is analogous to the classical ghost point method in a finite‐difference scheme for solving PDEs on flat domains. As opposed to the classical DM, which diverges near the boundary, the proposed GPDM estimator converges pointwise even near the boundary. Applying the consistent GPDM estimator to solve well‐posed elliptic PDEs with classical boundary conditions (Dirichlet, Neumann, and Robin), we establish the convergence of the approximate solution under appropriate smoothness assumptions. We numerically validate the proposed mesh‐free PDE solver on various problems defined on simple submanifolds embedded in Euclidean spaces as well as on an unknown manifold. Numerically, we also found that the GPDM is more accurate compared to DM in solving elliptic eigenvalue problems on bounded smooth manifolds. © 2021 Wiley Periodicals LLC.
- 22 December 2021
- Published by Wiley in Communications on Pure and Applied Mathematics
- Vol. 76 (2) , 337-405
Open AccessGhost Point Diffusion Maps for Solving Elliptic PDEs on Manifolds with Classical Boundary Conditions
In this paper, we extend the class of kernel methods, the so‐called diffusion maps (DM) and its local kernel variants to approximate second‐order differential operators defined on smooth manifolds with boundaries that naturally arise in elliptic PDE models. To achieve this goal, we introduce the ghost point diffusion maps (GPDM) estimator on an extended manifold, identified by the set of point clouds on the unknown original manifold together with a set of ghost points, specified along the estimated tangential direction at the sampled points on the boundary. The resulting GPDM estimator restricts the standard DM matrix to a set of extrapolation equations that estimates the function values at the ghost points. This adjustment is analogous to the classical ghost point method in a finite‐difference scheme for solving PDEs on flat domains. As opposed to the classical DM, which diverges near the boundary, the proposed GPDM estimator converges pointwise even near the boundary. Applying the consistent GPDM estimator to solve well‐posed elliptic PDEs with classical boundary conditions (Dirichlet, Neumann, and Robin), we establish the convergence of the approximate solution under appropriate smoothness assumptions. We numerically validate the proposed mesh‐free PDE solver on various problems defined on simple submanifolds embedded in Euclidean spaces as well as on an unknown manifold. Numerically, we also found that the GPDM is more accurate compared to DM in solving elliptic eigenvalue problems on bounded smooth manifolds. © 2021 Wiley Periodicals LLC.