2020
DOI: 10.1137/17m1158641
|View full text |Cite
|
Sign up to set email alerts
|

Extrinsic Meshless Collocation Methods for PDEs on Manifolds

Abstract: \bfA \bfb \bfs \bft \bfr \bfa \bfc \bft. We proposed ways to implement meshless collocation methods extrinsically for solving elliptic PDEs on smooth, closed, connected, and complete Riemannian manifolds with arbitrary codimensions. Our methods are based on strong-form collocations with oversampling and least-squares minimizations, which can be implemented either analytically or approximately. By restricting global kernels to the manifold, our methods resemble their easy-to-implement domain-type analogies, i.e… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
13
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
5
1
1

Relationship

3
4

Authors

Journals

citations
Cited by 26 publications
(16 citation statements)
references
References 54 publications
1
13
0
Order By: Relevance
“…for some sufficiently dense set of collocation points X ⊂ S. In [15], we show that the numerical solution U of (15) satisfies the estimate…”
Section: Numerical Algorithmsmentioning
confidence: 91%
“…for some sufficiently dense set of collocation points X ⊂ S. In [15], we show that the numerical solution U of (15) satisfies the estimate…”
Section: Numerical Algorithmsmentioning
confidence: 91%
“…We will solve the coupled problem in (1)-( 3) for the solutions (u B , u S ) by a domain-type meshless collocation method in [6] and an intrinsic surface-type approach in [4]. Our method is based on the coupled trial space U Z Ω ,Ω,Φ μ B × U Z S ,S,Ψ μ S in ( 9) and (10).…”
Section: Meshless Collocation Methods For Coupled Bulk-surface Pdesmentioning
confidence: 99%
“…/2 and ν ≥ 3.5 are essential in terms of the H ν−3/2 (S) error only for the surface PDE (22), see [4]. Therefore, in this case, we need…”
Section: Theoretical Requirements For Smoothness Of Kernelsmentioning
confidence: 99%
See 1 more Smart Citation
“…With the increasing numbers of both centers and collocation points, the L ∞ [0, T ]; L 2 (S(t)) errors decrease. We then compare results in Table 1 with those listed in Table 2 obtained by the corresponding exactly deter- (S(t)) errors and the corresponding estimated order of convergence (eoc) by (17) with respect to h Z , obtained by Algorithm 1 with overdetermined formulas (n X > n Z ), under the same other settings as in Figure 3. (S(t)) and L ∞ [0, T ]; L 2 (S(t)) errors and the corresponding convergence rates (eoc) with respect to h, obtained by Algorithm 1 with exactly determined formulas and the unfitted FEM [15], under the same other settings as in Figure 3.…”
Section: Numerical Examplesmentioning
confidence: 99%