30. hp - Finite Elements#
Let \(V_{hp}\) be a \(p\)-th order finite element sub-space of \(H^1\). By scaling and Bramble-Hilbert technique one obtains the best-approxiamtion error estimate
for \(m \leq p+1\). The constant \(c\) depends on the order \(p\). If \(m\) is fixed, we do obtain reduction of the approximation error as we increase \(p\). Next we develop methods to obtain so called \(p\)-version error estimates
where \(c\) is independent of \(h\) and \(p\). This estimate proves also convergence of the \(p\)-version finite element method: One may fix the mesh, and increase the order \(p\).
A detailed analysis of local \(H^m\) norms allows an optimal balance of mesh-size \(h\) and polynomial order \(p\). This \(hp\)-version leads to exponential convergence
where \(N\) is the number of unknowns.
We will prove the \(p\)-version estimate, but not the \(hp\)-result.
30.1. Legendre Polynomials#
Orthogonal polynomials are important to construct stable basis functions for the \(p\)-FEM, as well as for error estimates.
Let \(\Pi_n\) denote the space of polynomials up to order \(n\). We write \(\pi_n\) for a generic polynomial in \(\Pi_n\), with a different value any time it appears.
Definition of Legendre polynomials via Rodrigues’ formula:
It is a polynomial of degree \(n\). The first few Legendre polynomials are
\(P_n\) is even if \(n\) is even, and \(P_n\) is odd if \(n\) is odd. Since \((x^2-1)^n = x^{2n} - n x^{2n-2} + \pi_{2n-4}\) (with proper modification for small \(n\)) we have
Lemma: Orthogonality
There holds
\[ \int_{-1}^1 P_n(x) P_m(x) \, dx = \frac{2}{2n+1} \delta_{n,m}. \]
Proof: W.l.o.g. let \(n \leq m\). Multiple integration by parts gives
For \(n < m\), the first factor of the integrand vanishes, and we have orthogonality. For \(n = m\) this equals
which proves the scaling. \(\Box\)
Next we prove the 3-term recurrency, which can be used for efficient evaluation.
Lemma: Three term recurrence:
There holds
(30.1)#\[\begin{equation} % \label{equ_threeterm} (n+1) P_{n+1} (x) = (2n+1) x P_n(x) - n P_{n-1}(x). \end{equation}\]
Proof: Set \(r(x) = (n+1) P_{n+1} (x) - (2n+1) x P_n(x) + n P_{n-1}(x)\). Using (\ref{equ_leadingcoef}), we see that the leading coefficients cancel, and thus \(r \in \Pi_{n-2}\). From Lemma~\ref{lemma_ortho} we get for any \(q \in \Pi_{n-2}\)
and thus \(r = 0\). \(\Box\)
Lemma: Sturm-Liouville
Legendre polynomials satisfy the Sturm-Liouville differential equation
\[ \frac{d}{dx} \big[ (x^2-1) \frac{d}{dx} P_n(x) \big] = n (n+1) P_n(x) \]
Proof: Both sides are in \(\Pi_n\). We compare leading coefficients, for this set \(P_n = a_n x^n + \pi_{n-2}\) (with \(a_n = \frac{1}{2^n n!} \frac{ (2n)! }{ n! }\)).
and we get the same leading coefficient for rhs. Furthermore, for \(q \in \Pi_{n-1}\) there holds
and the same for the rhs. Thus the identity is proven. \end{proof}
Lemma~\ref{lemma_sturmliouville} implies that the Legendre polynomials are also orthogonal w.r.t. \((u^\prime, v^\prime)_{L_2, 1-x^2}\), i.e. $\( \int_{-1}^1 (1-x^2) P_n^\prime P_m^\prime = n(n+1) \| P_n \|_{L_2}^2 \delta_{n,m} \)$
30.2. Error estimate of the \(L_2\) projection#
Since polynomials are dense in \(L_2(-1,1)\), we get
with the generalized Fourier coefficients
and
Let \(P_{L_2}^{\Pi_p}\) denote the \(L_2\)-projection onto \(\Pi_p\). There holds
The projection error is
Lemma Projection error:
The \(L_2\)-projection error satisfies
(30.2)#\[\begin{equation} \| u - P_{L_2}^{\Pi_p} u \|_{L_2(-1,1)} \leq \frac{1}{\sqrt{(p+1)(p+2)}} \, | u |_{H^1(-1,1)} \end{equation}\]
Proof: Since \(P_n\) are orthogonal also w.r.t. \((u^\prime, v^\prime)_{L_2, 1-x^2}\), there holds
provided that \(u\) is in \(H^1\). The projection error satisfies
Finally, the result follows from
\(\Box\)
Similar as in Lemma~\ref{lemma_sturmliouville} on shows also
for \(m \leq n\), and, as in Lemma~\ref{lemma_l2est}
30.3. Orthogonal polynomials on triangles#
Orthogonal polynomials on tensor product elements are simply constructed by tensorization. Orthogonal polynomials on simplicial elements are more advanced. They are based on Jacobi polynomials:
For \(\alpha, \beta > -1\), Jacobi polynomials are defined by
with the weight function
Jacobi polynomials are orthogonal w.r.t. the weighted inner product
Note that \(P^{(0,0)}_n = P_n\).
Define the unit-triangle \(T\) with vertices \((-1,0)\), \((1,0)\) and \((0,1)\).
Lemma: Dubiner basis
The functions
\[ \varphi_{i,j} (x,y) := P_i \big( \tfrac{x}{1-y} \big) (1-y)^i P_j^{(2i+1,0)} (2y-1) \qquad i+j \leq p \]form an \(L_2(T)\)-orthogonal basis for \(\Pi_p(T)\).
Proof: Note that \(\varphi_{i,j} \in \Pi_{i+j}\). Substitution \(\xi = \frac{x}{1-y}\) leads to
\(\Box\)
30.4. Projection based interpolation#
By means of the orthogonal polynomials one shows approximation error estimates of the form $\( \inf_{q \in \Pi_p(T)} \| u - q \|_{H^k(T)} \leq c p^{k-m} | u |_{H^m(T)} \qquad m \geq k, \)\( with \)c \neq c(p)\(, easily in 1D and tensor product elements, and also on \)n$-dimensional simplices [Braess+Schwab: Approximation on simplices with respect to weighted Sobolev norms, J. Approximation Theory 103, 329-337 (2000)].
But, an interpolation operator to an \(H^1\)-conforming finite element space has to satisfy continuity constraints across element boundaries. We show that we get the same rate of convergence under these constraints.
30.4.1. The 1D case#
Let \(I=(-1,1)\). We define the operator \(I_p : H^1(I) \rightarrow \Pi_p\) such that
where \(\Pi_{p,0}(D) := \{ q \in \Pi_p(D) : q = 0 \text{ on } \partial D\}\). This procedure is exactly a \(p\)-version Galerkin-method for the Dirichlet problem. Since boundary values are preserved, the interpolation operator produces a globally continuous function. The operator \(I_p\) is a kind of mixture of interpolation and projection, thus the term {\em projection based interpolation} introduced by Demkowicz has been established.
Lemma: Commuting diagram There holds
\[ \Pi_{L_2}^{\Pi_{p-1}} u^\prime = (I_p u)^\prime \]
Proof: The range of both sides is \(\Pi_{p-1}\). We have to show that \((I_p u)^\prime\) is indeed the \(L_2\)-projection of \(u^\prime\), i.e.
This holds since \(\{ q^\prime : q \in \Pi_{p,0} \} = \{ q \in \Pi_{p-1} : \int q = 0 \}\) and (\ref{equ_projbased2}), and
\(\Box\)
The \(H^1\)-error estimate follows directly from the commuting diagram property:
By the Aubin-Nitsche technique one obtains an extra \(p\) for the \(L_2\)-error:
One also gets for \(q \in \Pi_p\)
30.4.2. Projection based interpolation on triangles#
We define the operator \(I_p : H^2(T) \rightarrow \Pi_p(T)\) as follows:
Note that \(I_p u\) on the edge \(E\) depends only on \(u|_E\), and thus the interpolant is continuous across neighbouring elements.
Lemma: Let \(v \in C(\partial T)\) such that \(v|_E \in \Pi_p(E)\). Then there exists an extension \(\tilde v \in \Pi_p(T)\) such that \(\tilde v|_{\partial T} = v\) and
\[ | \tilde v |_{H^1} \leq c \, | v |_{H^{1/2}(\partial T)}, \]where \(c\) is independent of \(p\).
Major steps have been shown in exercises 5.2 and 6.6. Note that the minimal-norm extension \(\tilde v\) is the solution of the Dirichlet problem, i.e. $\( \int_T \nabla \tilde v \nabla w = 0 \qquad \forall \, w \in \Pi_{p,0} \)$
Theorem: error estimate
There holds
\[ | u - I_p u |_{H^1} \preceq \inf_{q \in \Pi_p} | u - q |_{H^1(T)} + \sum_{E \subset \partial T} \frac{1}{\sqrt{p}} \inf_{q \in \Pi_p(E)} | u - q |_{H^1(E)} \preceq \frac{1}{p^{m-1}} | u |_{H^m} \]
for \(u \in H^m, m \geq 2\).
Proof: Let \(u_p\) be the \(|\cdot |_{H^1}\) best approximation to \(u\), i.e.
and, for uniqueness, mean values are preserved: \(\int_T u_p = \int_T u\). There holds
We apply the triangle inequality:
Since
we have that
i.e. \(u_p - I_p u\) is solution of the Dirichlet problem with boundary values \( (u_p - I_p u)|_{\partial T}\). Lemma~\ref{lemma_polext} implies that
We insert an \(u\) on the boundary to obtain
In the last step we used that \(H^{1/2}(\partial T) = [L_2, H^1]_{1/2}\) (i.e. the interpolation space). Next, we observe that \(I_p\) restricted to one edge \(E\) is exactly the 1D operator. Using Aubin-Nitsche we get
In the last step we used the trace theorem. \(\Box\)