High-order AFEM for the Laplace-Beltrami operator: convergence rates (Q506611): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1007/s10208-016-9335-7 / rank
Normal rank
 
Property / DOI
 
Property / DOI: 10.1007/S10208-016-9335-7 / rank
 
Normal rank

Latest revision as of 19:46, 9 December 2024

scientific article
Language Label Description Also known as
English
High-order AFEM for the Laplace-Beltrami operator: convergence rates
scientific article

    Statements

    High-order AFEM for the Laplace-Beltrami operator: convergence rates (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    1 February 2017
    0 references
    A new AFEM (adaptive finite element method) for the Laplace-Beltrami operator with arbitrary polynomial degree on parametric surfaces, which are globally \(W^1_\infty\) and piecewise in a suitable Besov class embedded in \(C^{1,\alpha}\) with \(\alpha \in (0,1]\), is presented. The idea is to have the surface sufficiently well resolved in \(W^1_\infty\) relative to the current resolution of the partial differential equation (PDE) in \(H ^1\). This gives rise to a conditional contraction property of the PDE module. A suitable approximation class is presented and its relation to Besov regularity of the surface, solution, and forcing is discussed. In addition, optimal convergence rates for AFEM are proved.
    0 references
    Laplace-Beltrami operator
    0 references
    parametric surfaces
    0 references
    adaptive finite element method
    0 references
    convergence rates
    0 references
    higher order
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references