On the Optimal Order Approximation of the Partition of Unity Finite Element Method

Yunqing Huang , Shangyou Zhang

CSIAM Trans. Appl. Math. ›› 2024, Vol. 5 ›› Issue (2) : 221 -233.

PDF (53KB)
CSIAM Trans. Appl. Math. ›› 2024, Vol. 5 ›› Issue (2) : 221 -233. DOI: 10.4208/csiam-am.SO-2023-0022
research-article

On the Optimal Order Approximation of the Partition of Unity Finite Element Method

Author information +
History +
PDF (53KB)

Abstract

In the partition of unity finite element method, the nodal basis of the standard linear Lagrange finite element is multiplied by the Pk polynomial basis to form a local basis of an extended finite element space. Such a space contains the P1 Lagrange element space, but is a proper subspace of the Pk+1 Lagrange element space on triangular or tetrahedral grids. It is believed that the approximation order of this extended finite element is k, in H1-norm, as it was proved in the first paper on the partition of unity, by Babuska and Melenk. In this work we show surprisingly the approximation order is k+1 in H1-norm. In addition, we extend the method to rectangular/cuboid grids and give a proof to this sharp convergence order. Numerical verification is done with various partition of unity finite elements, on triangular, tetrahedral, and q-uadri-lateral grids.

Keywords

Finite element / partition of unity / triangular grid / tetrahedral grid / rectangular grid

Cite this article

Download citation ▾
Yunqing Huang, Shangyou Zhang. On the Optimal Order Approximation of the Partition of Unity Finite Element Method. CSIAM Trans. Appl. Math., 2024, 5(2): 221-233 DOI:10.4208/csiam-am.SO-2023-0022

登录浏览全文

4963

注册一个新账户 忘记密码

References

AI Summary AI Mindmap
PDF (53KB)

120

Accesses

0

Citation

Detail

Sections
Recommended

AI思维导图

/