1996
DOI: 10.1090/s0025-5718-96-00781-8
|View full text |Cite
|
Sign up to set email alerts
|

The $p$ and $hp$ versions of the finite element method for problems with boundary layers

Abstract: Abstract. We study the uniform approximation of boundary layer functions exp(−x/d) for x ∈ (0, 1), d ∈ (0, 1], by the p and hp versions of the finite element method. For the p version (with fixed mesh), we prove super-exponential convergence in the range p + 1/2 > e/(2d). We also establish, for this version, an overall convergence rate of O(p −1 √ ln p) in the energy norm error which is uniform in d, and show that this rate is sharp (up to the √ ln p term) when robust estimates uniform in d ∈ (0, 1] are consid… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

7
116
0

Year Published

1998
1998
2014
2014

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 147 publications
(123 citation statements)
references
References 17 publications
7
116
0
Order By: Relevance
“…Particularly in the anisotropic case, we notice that relative large polynomial degrees are applied near the boundaries. This is consistent with the theoretical results in [29] or [20, Section 3.4.6, page 118]. Indeed, since the solution is analytic and once the layers are resolved, p-refinement is the most effective refinement strategy.…”
Section: Examplesupporting
confidence: 87%
See 1 more Smart Citation
“…Particularly in the anisotropic case, we notice that relative large polynomial degrees are applied near the boundaries. This is consistent with the theoretical results in [29] or [20, Section 3.4.6, page 118]. Indeed, since the solution is analytic and once the layers are resolved, p-refinement is the most effective refinement strategy.…”
Section: Examplesupporting
confidence: 87%
“…They also overestimate the weighted L 2 -errors (which is not guaranteed by Theorem 3). On the basis of the a-priori analysis in [29] or [20, Section 3.4.6, page 118], we plot the errors against N 1 2 , where N is the number of degrees of freedom. In the asymptotic regime and in a semi-logarithmic scale, all the curves are roughly straight lines, indicating exponential convergence in N 1 2 .…”
Section: Examplementioning
confidence: 99%
“…, versus p in semilogarithmic coordinates, and in each case: σ = 5 with circles, σ = 20 with squares, and σ = 80 with diamonds. We refer to [19] for theoretical results of convergence for the p-version in presence of an exponentially decreasing boundary layer. In Figure 9 we use mesh M 3 instead of M 1 .…”
Section: Interpolation Degreementioning
confidence: 99%
“…For singularity resolution, n is required to be proportional to the polynomial degree k; see [3,5]. For boundary layers, the width of the thinnest layer mesh needs to be comparable to that of the boundary layer; see [36,51,52].…”
Section: Geometric Boundary Layer Meshesmentioning
confidence: 99%
“…We note that this is a genuine hp approximation. As shown in [3,5,36,51], in order to obtain exponential convergence in presence of singularities in polyhedral domains, the number of layers n must be at least equal to the spectral degree k, thus better accuracy is achieved by simultaneously increasing the polynomial degree and the number of layers. In our experiments we have chosen n = k.…”
Section: Problem Iii: a Laplace Problem On A Boundary Layer Meshmentioning
confidence: 99%