∎
22email: [email protected] 33institutetext: Y. Li 44institutetext: Department of Mathematics, The Pennsylvania State University, University Park, PA 16802, USA
44email: [email protected]
Superconvergent pseudostress-velocity finite element methods for the Oseen and Navier–Stokes equations
Abstract
We present a priori and superconvergence error estimates of mixed finite element methods for the pseudostress-velocity formulation of the Oseen equation. In particular, we derive superconvergence estimates for the velocity and a priori error estimates under unstructured grids, and obtain superconvergence results for the pseudostress under certain structured grids. A variety of numerical experiments validate the theoretical results and illustrate the effectiveness of the superconvergent recovery-based adaptive mesh refinement. It is also numerically shown that the proposed postprocessing yields apparent superconvergence in a benchmark problem for the incompressible Navier–Stokes equation.
Keywords:
pseudostresssuperconvergencesuperclosenesspostprocessingOseen equationNavier–Stokes equationMSC:
65N1265N1565N301 Introduction
In fluid mechanics, the Oseen equations describe the flow of a viscous and incompressible fluid at small Reynolds numbers. Instead of dropping the advective term completely, the Oseen approximation linearizes the advective acceleration term to , where represents the velocity at large distance. As a result it provides a lowest-order solution that is uniformly valid everywhere in the flow field. Since the Oseen equations partly account for the inertia terms (at large distance), they have better approximation in the far field while keeping the same order of accuracy as Stokes approximation near the body, see, e.g., kundu2015fluid . Mathematically speaking, the Oseen equation can be viewed as a linearized Navier–Stokes equation arising from fixed point iteration.
Let be a bounded Lipschiz domain with , , and be given data. Let denote the velocity field and denote the pressure subject to the zero-mean constraint
(1.1) |
The Oseen equation under the Dirichlet boundary condition is
(1.2a) | ||||
(1.2b) | ||||
(1.2c) |
where is the viscosity constant. As a default, vectors such as are always arranged as columns unless confusion arises. In (1.2a), is the Jacobian matrix of and we adopt the convention . When (resp. ), (1.2) reduces to the Brinkman equation (resp. Stokes equation). Replacing with in (1.2) yields the Navier–Stokes equation
(1.3a) | ||||
(1.3b) | ||||
(1.3c) |
Numerical analysis of Oseen, Brinkman, Stokes, or Navier–Stokes equations based on the velocity-pressure formulation is extensive, see, e.g., GiraultRaviart1986 ; BoffiBrezziFortin2013 ; GuzmanNeilan2014 ; FalkNeilan2013 for conforming mixed methods, ccs2006 ; CCNP2013 ; CockburnSayas2014 ; CesmeliogluCockburnQiu2017 ; FuQiu2019 for hybridized discontinuous Galerkin methods, Mulin2014 ; WangYe2016 ; LLC2016 for weak Galerkin methods, and ABMV2014 for virtual element methods.
Let denote the identity matrix. The nonsymmetric pseudostress and symmetric stress are
respectively. In a series of papers Caiwang2007 ; CaiWangZhang2010a ; CaiTongVassilevskiWang2010b , Cai et al. proposed the pseudostress-velocity formulation of the Stokes and Navier–Stokes equations, which could be discretized by classical Raviart–Thomas or Brezzi–Douglas–Marini elements without any stabilization term, see (1.12). Let be the trace of the matrix and
denote the deviatoric part of . Direct calculation shows that the Oseen equation (1.2) equation is equivalent to the following pseudostress-velocity formulation
(1.4) | ||||
subject to the constraints
Here is the row-wise divergence of the matrix-valued function .
In contrast to extensive numerical results on velocity-pressure formulation of Stokes-related equations, numerical analysis of pseudostress-based methods is restricted to classical mixed methods CaiWangZhang2010a ; Gatica2014 , virtual element methods Caceres2017 ; Caceres2017b , discontinuous Galerkin methods Qian2019 , and adaptive mixed methods CKP2011 ; CGS2013 ; HuYu2018 ; Li2020MCOM for the Stokes or Brinkman equation. There are a few works devoted to the mixed formulation of the Oseen equation (1.4), see, e.g., Park2014 for a lowest order upwinded mixed method on rectangular meshes and BarriosCasconGonzalez2017 ; BarriosCasconGonzalez2020 for least-squares mixed methods. It is the purpose of this paper to shed light on a priori and superconvergence analysis of pseudostress-velocity mixed methods for the Oseen and Navier–Stokes equations.
In this paper, we shall develop a priori and superconvergence error estimates for (1.4). To the best of our knowledge, even a priori error estimates of (1.4) is not available in literature. We emphasize that the presence of lower order terms is a major challenge in error analysis of mixed methods, see, e.g., DouglasRoberts1985 ; Demlow2002 for elliptic equations with lower order terms and ArnoldLi2017 for the perturbed Hodge–Laplace equation. For instance, due to the convection term and variable coefficient , the construction of the discrete inf-sup condition is far from obvious. Hence we shall use the duality argument to derive a priori error estimates, which also yields improved decoupled error estimates. It is noted that mixed methods for the scalar elliptic equation
(1.5) |
have been analyzed in DouglasRoberts1985 ; Demlow2002 , where is a uniformly elliptic matrix-valued coefficient. In contrast, the deviatoric operator in (1.2) is singular, which is a major difficulty in our analysis.
Furthermore, we shall derive superconvergence results for based on postprocessing and a new estimate on for several families of RT elements. Even for the Stokes equation, such estimates are not known in literature. The superconvergence postprocessing procedure for and is element-wise and flexible, see Section 4 and see, e.g., ZZ1992a ; CKP2011 ; BankXu2003a ; ZhangNaga2005 ; HuangLiWu2013 ; BankLi2019 ; Li2021JSC for related postprocessing schemes in the literature. Since the postprocessing scheme is independent of the underlying physical model, we also test the proposed postprocessing in the benchmark problem for steady incompressible Navier–Stokes equation, where apparent superconvergence phenomena in and are observed. As for superconvergence of Stokes-type equations in velocity-pressure form, readers are referred to e.g., WangYe2001 ; Ye2001 ; CuiYe2009 for superconvergence by two-grid -projections, Pan1997 ; Eichel2011 ; LN2008 for superconvergent recovery of lowest-order methods, and CockburnSayas2014 ; FuQiu2019 for superconvergent hybridized discontinuous Galerkin methods.
1.1 Preliminary notation
Given a vector space , let denote the Cartesian product of copies of and the space of matrices whose components are contained in . Let be the usual space. Let
where is the -th row of For scalar-, vector-, or matrix-valued functions, we use and to denote the - and -inner product, respectively. The variational formulation of (1.4) seeks and such that
(1.6) | ||||
where is the outward normal to
Let be a conforming simplicial or cubical partition of . Given an element and denote radii of circumscribed and inscribed spheres of , is the diameter of , and is the mesh size of We assume that the aspect ratio of elements in is uniformly bounded, i.e.,
for some absolute constant . Given an integer let , be suitable finite-dimensional vector spaces defined on and
For instance, when is a simplicial partition, one could take
(1.7) |
where is the space of polynomials of degree at most on , and denotes the position vector. In this case, the corresponding is the classical Raviart–Thomas (RT) RaviartThomas1977 space. Another possible choice is
(1.8) |
which corresponds to the Brezzi–Douglas–Marini (BDM) BrezziDouglasMarini1985 element.
Given a hypercube , let denote the space of polynomials on of degree at most in with . For a cubical mesh , the pair can be the cubical RT element using the shape functions
(1.9) |
Let be the canonical interpolation onto determined by the degrees of freedom of . Let be the -projection onto i.e.,
(1.10) |
Throughout the rest of this paper, we assume the commutativity property
(1.11) |
which is satisfied by at least the aforementioned RT, BDM, and cubical RT elements. Readers are referred to e.g., BrezziDouglasMarini1985 ; BDDF1987 ; BDFM1987 for other cubical or rectangular mixed elements that satisfy (1.11). Let be the matrix version of , i.e.,
Let be the vector-valued broken piecewise polynomial space
The mixed method for (1.4) seeks satisfying
(1.12) | ||||
The outline of this work is as follows. In Section 2, we develop a apriori error estimates of the mixed method (1.12) and supercloseness estimate on . In Section 3, we develop supercloseness estimate on . Section 4 is devoted to superconvergent postprocessing procedures. Numerical results for smooth, singular, convection-dominated, and nonlinear problems are presented in Section 5. Throughout the rest of this paper, we say provided where is a generic constant dependent solely on , , , , . In the error analysis, we assume without loss of generality.
2 A priori error estimates
Let denote the -norm, be the -semi norm, be the -norm, and be the -norm
In this section, we derive a priori error estimates of the mixed method (1.12) in Theorem 2.1. The same analysis implies that (1.12) admits a unique solution provided is sufficiently small.
The operator is singular and satisfies
(2.1) |
In addition, it holds that (see Caiwang2007 ; ArnoldDouglasGupta1984 )
(2.2) |
where The inequality (2.2) is a key ingredient in the analysis of pseudostress-based methods. Define by
(2.3) |
where is applied to each row of By abuse of notation, we may also use to denote the component-wise -projection. It follows from (1.11) that
(2.4) |
For convenience, we introduce the interpolation errors
which can be easily estimated by (see CaiTongVassilevskiWang2010b )
(2.5a) | ||||
(2.5b) | ||||
(2.5c) |
where , , and satisfy the regularity indicated by the right hand sides. For the BDM element (1.8), it additionally holds that
(2.6) |
The essential errors to be estimated are
Subtracting (1.12) from (1.6) (with ), we obtain the error equation
(2.7a) | ||||
(2.7b) |
To estimate , we consider the adjoint problem of (1.6): Find and such that
(2.8a) | ||||
(2.8b) |
In the analysis, it is assumed that (2.8) admits the elliptic regularity
(2.9) |
The next lemma is a supercloseness estimate which is crucial for both a priori and superconvergence error analysis.
Lemma 2.1
It holds that
Proof
Taking in (2.8b), we obtain
(2.10) |
Using the definition (1.10) and the property (2.4), we have
(2.11) | ||||
Combining (2.7a) with implies that
(2.12) | ||||
Using (2.1) and setting in (2.8a), we have
It then follows from the above equation and (2.7b) with that
(2.13) | ||||
As a result of (2.11), (2.12) and (2.13), we obtain
(2.14) | ||||
On the other hand, the second term on the right hand side of (2.10) is
(2.15) | ||||
Finally with (2.14) and (2.15), the error in (2.10) can be written as
(2.16) | ||||
Using (2.16), (2.5), and the Cauchy–Schwarz inequality, we obtain
Combining the above estimate with (2.9) completes the proof. ∎
Lemma 2.1 is a supercloseness estimate, i.e., and are much closer than the distance predicted by standard a priori error estimates. However, a priori error estimates on and are not known at the moment. When deriving a priori error estimates, we need the and negative norm estimates of
Lemma 2.2
It holds that
(2.17a) | ||||
(2.17b) |
Lemme 2.2 is also essential for proving the supercloseness estimate in Theorem 3.1 and the proof is postponed in the end of this section. In this work, we say is sufficiently small provided where is an absolute constant relying on , , , , . Now we are in a position to present the first main result in this paper.
Theorem 2.1
For sufficiently small , it holds that
(2.18a) | ||||
(2.18b) | ||||
(2.18c) |
Proof
Using Lemma 2.1 and the triangle inequality
we obtain
(2.19) |
Plugging (2.17a) into (2.19) and kicking (with sufficiently small ) back to the left hand side yields
(2.20) |
On the other hand, with help of (2.7a) with , we obtain
(2.21) | ||||
It follows from (2.2), (2.21), and a Young’s inequality with that
or equivalently
(2.22) |
where is independent of . Using (2.22), Lemma 2.2, and the triangle inequality, we deduce that
In the above estimate, it suffices to choose sufficiently small and to obtain
(2.23) |
Plugging (2.23) into (2.20) with sufficiently small then leads to
(2.24) |
Therefore we close the loop. As a consequence of (2.23), (2.24), (2.17a), we obtain
(2.25) | ||||
Theorem 2.1 eventually follows from (2.24), (2.25) and a triangle inequality. ∎
For sufficiently smooth , Theorem 2.1 with (2.5) yields
(2.26a) | ||||
(2.26b) |
When is based on the BDM element (1.8), the following improved error estimate follows from (2.18c) and (2.6).
(2.27) |
Corollary 1
For sufficiently small , the mixed method (1.12) has a unique solution.
Proof
To establish the existence and uniqueness of the solution to (1.12), it suffices to show the uniqueness because of linearity. Suppose and are both solutions to (1.12), then we have the error equation
(2.28) | ||||
where , Consider the dual problem
(2.29) | ||||
It then follows from (2.28), (2.29) and the same analysis in Lemma 2.1 that
(2.30) |
provided is sufficiently small. The same argument for proving Lemma 2.2 yields
(2.31) | ||||
Following the proof of (2.23) and using (2.30), (2.31), we obtain
(2.32) |
when is small enough. Finally combining (2.30), (2.32), (2.31) yields
Hence and provided is sufficiently small. ∎
Proof (Proof of Lemma 2.2)
Let . Using (2.4) and (2.7b), we arrive at
(2.33) | ||||
where is the piecewise average of w.r.t. The estimate (2.17a) then follows from (2.33), the Cauchy–Schwarz and triangle inequalities.
To prove (2.17b), let with . It follows from (2.4), (1.10), and (2.7b) that
(2.34) | ||||
Using (2.1) and (2.7a), we can rewrite as
(2.35) | ||||
On the other hand,
(2.36) |
Combining (2.34) with (2.35) and (2.36) and using (2.5), we obtain
(2.37) | ||||
It follows from (2.4) and elementary calculation that
Therefore using the previous estimate and (2.37), we obtain
The proof is complete. ∎
3 Superconvergence on pseudostress
Using Lemma 2.1 and (2.26), we obtain the supercloseness estimate on .
(3.1) |
In this section, we shall prove an improved estimate for . To this end, is endowed with the -inner product
Let and be the orthogonal complement of w.r.t. in . We shall decompose by the discrete Helmholtz decomposition
(3.2) |
which can be analyzed using tools in finite element exterior calculus (FEEC), see, e.g., ArnoldFalkWinther2006 ; ArnoldFalkWinther2010 . In the theory of FEEC, an essential ingredient is the bounded projections that commute with exterior derivatives. In particular, there exist projections and (see, e.g., ArnoldFalkWinther2006 ; ChristiansenWinther2008 ) such that
(3.3) | ||||
where Id is the identity mapping. Starting from one can easily obtain commuting bounded projections onto and . Let
where is applied to each row of . Similarly, can applied to each component of a vector-valued function in . Using the property of in (3.3), we have
(3.4a) | ||||
(3.4b) | ||||
(3.4c) |
where Id is the identity mapping. Then with the help of , , we obtain the following lemma for estimating the decomposition component living in
Lemma 3.1
It holds that
Proof
Remark 3.1
It follows from the discrete abstract Poincaré inequality (see ArnoldFalkWinther2010 , Theorem 3.6) that
Hence Lemma 3.1 is an improved discrete Poincaré inequality. The improvement is achieved by utilizing the special property of the divergence operator.
We emphasize that the improved estimate of is dependent on mesh structure, type of finite elements, and quite technical. For simplicity of presentation, first let be based on the lowest order RT element (1.7) with in although the estimates can be generalized in several ways, see the end of this section. Given a scalar-valued function and a vector-valued function , let
The row-wise rotational gradient or curl is defined as
Introducing the following nodal element spaces
we obtain a two-dimensional discrete sequence
(3.6) |
The inclusion follows from .
The supercloseness estimate of does not hold on general unstructured grids. For elliptic equations discretized by RT elements, the author Y. Li et al. in Li2018SINUM ; BankLi2019 derived several supercloseness estimates on the vector unknown in mixed methods under certain mildly structured grids. Readers are referred to Duran1990 ; EwingLiuWang1999 ; Brandts1994 ; Brandts2000 for similar results on Poisson’s equation under rectangular, -uniform quadrilateral, and uniform triangular grids. To avoid lengthy descriptions of different mesh structures, we focus on the following piecewise uniform grids.

Definition 3.1
We say is a uniform grid provided each pair of adjacent triangles (two triangles sharing a common edge) form an exact parallelogram. Let be a fixed polygonal partition of We say is a piecewise uniform grid provided is aligned with and is a uniform grid for each .
For instance, let be the unit square that is split into the 19 triangles given in Figure 1 (left). After 3 consecutive uniform quad-refinement, we obtain the triangulation in Figure 1 (right), which is a piecewise uniform grid (w.r.t. ). The piecewise uniform mesh structure is only used in the next technical lemma.
Lemma 3.2
Let be a constant matrix. Let be the canonical interpolation onto , the lowest order RT element space. For a piecewise uniform and , it holds that
In Li2018SINUM , one of the author proved Lemma 3.2 on mildly structured grids when . For the general anisotropic , we could not find a complete proof in literature. In the appendix, we give a detailed proof of Lemma 3.2 using the technique in Theorem 3.2 of Brandts1994 and Lemma 3.4 of HuMaMa2021 . Now we present a supercloseness estimate for , the second main result, in the next theorem.
Theorem 3.1
Let be simply-connected and be a piecewise uniform grid. For (1.12) using the lowest order RT element and sufficiently small , it holds that
Proof
When is simply connected, (3.6) is an exact sequence, i.e., It then follows from the exactness and the discrete Helmholtz decomposition (3.2) that
(3.7) |
where Using Lemma 3.1 and , we obtain
(3.8) |
It remains to estimate . Note that
Then using the orthogonality, (2.7a), and (2.1), we have
Recall that denotes the -th row of Let , , and . It follows from the previous equation and direct calculation that
(3.9) | ||||
where
Then using (3.9), Lemma 3.2 and (2.2) with , we have
(3.10) | ||||
Combining (2.2) with (3.8), (3.10), (2.17b), (3.1), we obtain
The proof is complete. ∎
The supercloseness estimate on can be generalized on rectangular meshes. Throughout the rest of this section, let be a rectangular mesh,
and be based on the rectangular RT element (1.9) with . When is simply-connected, we still have the discrete exact sequence (3.6). Similarly to the case of triangular grids, we need the uniform mesh structure.
Definition 3.2
We say is a uniformly rectangular mesh if all the rectangles of are of the same shape and size.
For with , Theorem 5.1 of EwingLiuWang1999 implies
where . The previous estimate is not true when on . As claimed in the remark in Example 6.2 of EwingLiuWang1999 , it holds that
(3.11) |
for some absolute constant independent of . Following the same argument in the proof of Theorem 3.1 and replacing Lemma 3.2 by (3.11), we actually obtain the supercloseness estimate
Similar estimates may hold on -uniform quadrilateral grids described in EwingLiuWang1999 .
4 Postprocessing
We have derived supercloseness estimates in Lemma 2.1 and Theorem 3.1. However, those results can not be directly used because and are not known in practice. To extract superconvergence information from the smallness of and , one may design easy-to-compute postprocessed solutions and . For instance, following the idea of Stenberg1991 , a element-by-element postprocessing procedure for in the pseudostress-velocity formulation of the Stokes equation is proposed in CKP2011 . In particular, let
where is the -inner product. Note that the pressure could be recovered as
For each the postprocessed solution is determined by
(4.1) | ||||
Since the analysis of the mapping is independent of equations, we can combine the analysis in Theorem 4.1 of CKP2011 for the Stokes equation with the supercloseness on in Theorem 2.1 to obtain the following postprocessing superconvergence estimate.
Theorem 4.1
For sufficiently small , it holds that
Proof
Postprocessing technique on the scalar variable in mixed methods for Poisson’s equation can be found in e.g., BrezziDouglasMarini1985 ; BrambleXu1989 ; Stenberg1991 ; LovadinaStenberg2006 .
The postprocessing procedure can be derived from existing postprocessing operator . In particular, is a linear mapping onto the space of suitable piecewise polynomials and satisfies
(4.3a) | ||||
(4.3b) | ||||
(4.3c) |
for some positive constant and sufficiently smooth When is the lowest order RT element space, that satisfies (4.3) is given in e.g., Brandts1994 ; BankLi2019 . The simple nodal or edge averaging ZZ1987 ; Brandts1994 and superconvergent patch recovery ZZ1992a ; XuZhang2004 ; BankLi2019 are also possible choices.
For , let
where is applied to each row of . We have the following super-approximation result of
Lemma 4.1
Assume (4.3) holds. For , we have
Proof
Combining Lemma 4.1 and Theorem 3.1, we obtain the following superconvergence estimate by postprocessing.
Theorem 4.2
Proof
Remark 4.1
One could reconstruct accurate numerical symmetric stress and pressure from the superconvergent pseudostress . In fact, let
We conclude that superconverges to the symmetric stress and superconverges to the pressure from Theorem 4.2 and the elementary inequalities
5 Experiments
In this section, the postprocessing procedure in Theorem 4.2 is based on the polynomial preserving recovery for the lowest order RT element described in BankLi2019 . Roughly speaking, each row of is constructed as a continuous piecewise linear vector-valued polynomial with nodal values determined by least-squares fitted linear local polynomial on vertex patches. For linear Oseen equations, we set the viscosity to be and verify the a priori and superconvergence error estimates. The adaptivity performance of the error estimator base on , is also under investigation. In the end, the proposed postprocessing is tested in the Kovasznay flow from the Navier–Stokes equation.
nt | ||||||
19 | 3.210e-1 | 3.851e-2 | 9.334e-2 | 1.372 | 2.505e-1 | 2.113 |
76 | 1.620e-1 | 1.027e-2 | 2.438e-2 | 6.849e-1 | 7.172e-2 | 6.108e-1 |
304 | 8.121e-2 | 2.621e-3 | 6.176e-3 | 3.418e-1 | 1.957e-2 | 1.724e-1 |
1216 | 4.063e-2 | 6.598e-4 | 1.550e-3 | 1.707e-1 | 5.242e-3 | 4.353e-2 |
4864 | 2.032e-2 | 1.653e-4 | 3.880e-4 | 8.530e-2 | 1.390e-3 | 1.088e-2 |
19456 | 1.016e-2 | 4.136e-5 | 9.703e-5 | 4.270e-2 | 3.659e-4 | 2.719e-3 |
order | 9.990e-1 | 1.990 | 1.994 | 1.001 | 1.904 | 1.961 |
nt | |||||
19 | 3.192e-1 | 1.779e-2 | 6.316e-02 | 4.480e-1 | 4.755e-1 |
76 | 1.618e-1 | 6.026e-3 | 1.645e-02 | 1.249e-1 | 1.180e-1 |
304 | 8.118e-2 | 1.636e-3 | 4.155e-03 | 3.216e-2 | 2.928e-2 |
1216 | 4.062e-2 | 4.181e-4 | 1.042e-03 | 8.104e-3 | 7.288e-3 |
4864 | 2.032e-2 | 1.051e-4 | 2.606e-04 | 2.031e-3 | 1.818e-3 |
19456 | 1.016e-2 | 2.631e-5 | 6.515e-05 | 5.081e-4 | 4.541e-4 |
order | 9.986e-1 | 1.964 | 1.996 | 1.987 | 2.005 |
5.1 A priori convergence
Consider the Oseen equation (1.2) on the unit square with the smooth solutions
We set , , . is computed from and . We start with the initial partition in Figure 1 (left). A sequence of piecewise uniform meshes is obtained by uniform quad-refinement, i.e., dividing each triangle into four similar subtriangles by connecting the midpoints of each edge. Numerical results are presented in Tables 1 and 2, where nt is short for “number of triangles”. The order of convergence is computed from the error quantities in those tables by least squares without using the data in the first rows.
The numerical rates of convergence coincide with a priori error estimates (2.26), (2.27) and the supercloseness estimates in (3.1) and Theorem 3.1. It is noted that for the lowest order BDM element, , which is predicted by a priori error estimates and thus not supersmall. Since the recovery procedure in BankLi2019 provides the super-approximation rate in (4.3c) and Lemma 4.1, the recovery superconvergence estimate for the lowest order RT element predicted by Theorem 4.2 is , numerically confirmed by the last column in Table 1.


5.2 Adaptive mesh refinement for a non-smooth problem
Consider (1.2) on the L-shaped domain with the smooth pressure and singular velocity
where , is the polar coordinate w.r.t. . Set , and . Direct calculation shows that and In this experiment, we use the classical adaptive feedback loop (cf. BabuskaRheinboldt1978 ; Dorfler1996 ; MNS2000 )
to obtain a sequence of adaptively refined grids and numerical solutions . In particular, the algorithm starts from the initial grid presented in Figure 2(left). The module ESTIMATE computes the superconvergent recovery-based error indicator
for each triangle . The module MARK then selects a collection of triangles
(5.1) |
to be refined by local quad-refinement. To remove the newly created hanging nodes, minimal number of neighboring elements of are bisected and the next level triangulation is generated. See Figure 2(right) for an adaptively refined triangulation.
It can be observed from Figure 3 that optimally converges to . In addtion, the errors and are apparently superconvergent to 0. Let
Due to the observed superconvergence phenomena and the triangle inequality
the recovery-based error estimator is asymptotically exact, i.e.,


5.3 Adaptive mesh refinement for dominant convection
Consider the Oseen equation (1.2) on the unit square with , , , . In the end, we use the same adaptive algorithm in Subsection 5.2 to solve this convection-dominated example. The initial grid is given in Figure 4 (left). The marked set in (5.1) is replaced by
Due to the convection coefficient , the exact solution near the axis is rapidly changing to preserve the homogeneous Dirichlet boundary condition. It can be observed from Figures 4 and 5 that the adaptive mixed method is able to capture the boundary layer by adaptively graded grids.
5.4 Incompressible Navier–Stokes equation
Similarly to the linear Oseen equation, (1.3) could be recast into the following pseudostress-velocity form
(5.2) | ||||
Let . The exact solution solutions are taken to be
(5.3) |
where , . In fact (5.3) is a well-known benchmark problem known as the Kovasznay flow (cf. DiPietroErn2012 ; ChenLiCorinaCimbala2020 ). In this experiment, we use the lowest order RT element to discretize (5.2):
The initial triangulation is a uniform partition of the square with 512 right triangles. A sequence of grids is then generated by subdividing each triangles into four congruent subtriangles.
Although our analysis is devoted to the linear Oseen equation, one could observe apparent superconvergence in both pseudostress and velocity of the Navier–Stokes equation from Table 3.
nt | ||||||
512 | 2.767e-1 | 1.717e-1 | 1.984e-1 | 1.572e-1 | 3.317e-2 | 1.311e-1 |
2048 | 1.225e-1 | 5.578e-2 | 6.133e-2 | 6.094e-2 | 8.866e-3 | 3.765e-2 |
8192 | 5.902e-2 | 2.233e-2 | 2.326e-2 | 2.716e-2 | 2.410e-3 | 1.063e-2 |
32768 | 2.920e-2 | 1.030e-2 | 1.043e-2 | 1.303e-2 | 6.509e-4 | 2.960e-3 |
order | 1.079 | 1.350 | 1.415 | 1.194 | 1.889 | 1.823 |
Appendix

Proof (Proof of Lemma 3.2)
Let be a polygonal partition of and be a uniform grid for each . Let , be fixed unit normals to two edges of an arbitrary but fixed triangle in . Let and recall , We have
(5.4) | ||||
For , let and be the set of interior (inside ) and boundary (on ) edges orthogonal to , respectively. Let denote the region which is the union of triangles sharing as an edge. To estimate , let be partitioned into parallelograms with and boundary triangles with , see Figure 6, where , . For any , note that is single-valued across and thus constant on For , let and be the two endpoints of and denote the length of Then
(5.5) | ||||
When is an exact parallelogram, it is shown in Equation (3.15) of Brandts1994 that
(5.6) |
Using (5.6) and the Cauchy-Schwarz inequality, we have
(5.7) | ||||
Let denote the collection of endpoints of edges in ,
and . For instance, in Figure 6. For let , be the two boundary edges sharing and be the union of three triangles having as a vertex. For let denote the unique edge in having as a vertex. Rearranging the summation in , we have
(5.8) | ||||
For , Equation (3.15) in HuMaMa2021 shows that
(5.9) |
Without loss of generality, let Then the discrete Sobolev and Poincaré inequalities yield
(5.10) |
Standard interpolation error estimate yields
(5.11) |
It then follows from (5.8)–(5.11), and the Cauchy–Schwarz inequality that
(5.12) | ||||
We finally conclude the proof from (5.4), (5.7), (5.12), the same analysis for and all pieces in the partition . ∎
Declarations
Funding The authors did not receive support from any organization for this work.
Data Availability Data sharing is not applicable to this article as no datasets were generated or analysed during the current study.
Conflicts of interest The authors have no relevant financial or non-financial interests to disclose.
Code availability The code used in this study is available from the authors upon request.
References
- (1) Antonietti, P.F., Beirão da Veiga, L., Mora, D., Verani, M.: A stream virtual element formulation of the Stokes problem on polygonal meshes. SIAM J. Numer. Anal. 52(1), 386–404 (2014). DOI 10.1137/13091141X
- (2) Arnold, D.N., Douglas Jr., J., Gupta, C.P.: A family of higher order mixed finite element methods for plane elasticity. Numer. Math. 45(1), 1–22 (1984). DOI 10.1007/BF01379659
- (3) Arnold, D.N., Falk, R.S., Winther, R.: Finite element exterior calculus, homological techniques, and applications. Acta Numer. 15, 1–155 (2006). DOI 10.1017/S0962492906210018
- (4) Arnold, D.N., Falk, R.S., Winther, R.: Finite element exterior calculus: from Hodge theory to numerical stability. Bull. Amer. Math. Soc. (N.S.) 47(2), 281–354 (2010). DOI 10.1090/S0273-0979-10-01278-4
- (5) Arnold, D.N., Li, L.: Finite element exterior calculus with lower-order terms. Math. Comp. 86(307), 2193–2212 (2017). DOI 10.1090/mcom/3158
- (6) Babuška, I., Rheinboldt, W.C.: Error estimates for adaptive finite element computations. SIAM J. Numer. Anal. 15(4), 736–754 (1978). DOI 10.1137/0715049
- (7) Bank, R.E., Li, Y.: Superconvergent recovery of Raviart-Thomas mixed finite elements on triangular grids. J. Sci. Comput. 81(3), 1882–1905 (2019). DOI 10.1007/s10915-019-01068-0
- (8) Bank, R.E., Xu, J.: Asymptotically exact a posteriori error estimators. I. Grids with superconvergence. SIAM J. Numer. Anal. 41(6), 2294–2312 (2003). DOI 10.1137/S003614290139874X
- (9) Barrios, T.P., Cascón, J.M., González, M.: Augmented mixed finite element method for the Oseen problem: a priori and a posteriori error analyses. Comput. Methods Appl. Mech. Engrg. 313, 216–238 (2017). DOI 10.1016/j.cma.2016.09.012
- (10) Barrios, T.P., Cascón, J.M., González, M.: On an adaptive stabilized mixed finite element method for the Oseen problem with mixed boundary conditions. Comput. Methods Appl. Mech. Engrg. 365, 113,007, 21 (2020). DOI 10.1016/j.cma.2020.113007
- (11) Boffi, D., Brezzi, F., Fortin, M.: Mixed finite element methods and applications, Springer Series in Computational Mathematics, vol. 44. Springer, Heidelberg (2013). DOI 10.1007/978-3-642-36519-5
- (12) Bramble, J.H., Xu, J.: A local post-processing technique for improving the accuracy in mixed finite-element approximations. SIAM J. Numer. Anal. 26(6), 1267–1275 (1989). DOI 10.1137/0726073
- (13) Brandts, J.H.: Superconvergence and a posteriori error estimation for triangular mixed finite elements. Numer. Math. 68(3), 311–324 (1994). DOI 10.1007/s002110050064
- (14) Brandts, J.H.: Superconvergence for triangular order Raviart-Thomas mixed finite elements and for triangular standard quadratic finite element methods. Appl. Numer. Math. 34(1), 39–58 (2000). DOI 10.1016/S0168-9274(99)00034-3
- (15) Brezzi, F., Douglas Jr., J., Durán, R., Fortin, M.: Mixed finite elements for second order elliptic problems in three variables. Numer. Math. 51(2), 237–250 (1987). DOI 10.1007/BF01396752
- (16) Brezzi, F., Douglas Jr., J., Fortin, M., Marini, L.D.: Efficient rectangular mixed finite elements in two and three space variables. RAIRO Modél. Math. Anal. Numér. 21(4), 581–604 (1987). DOI 10.1051/m2an/1987210405811
- (17) Brezzi, F., Douglas Jr., J., Marini, L.D.: Two families of mixed finite elements for second order elliptic problems. Numer. Math. 2(47), 217–235 (1985)
- (18) Cáceres, E., Gatica, G.N.: A mixed virtual element method for the pseudostress-velocity formulation of the Stokes problem. IMA J. Numer. Anal. 37(1), 296–331 (2017). DOI 10.1093/imanum/drw002
- (19) Cáceres, E., Gatica, G.N., Sequeira, F.A.: A mixed virtual element method for the Brinkman problem. Math. Models Methods Appl. Sci. 27(4), 707–743 (2017). DOI 10.1142/S0218202517500142
- (20) Cai, Z., Tong, C., Vassilevski, P.S., Wang, C.: Mixed finite element methods for incompressible flow: stationary Stokes equations. Numer. Methods Partial Differential Equations 26(4), 957–978 (2010). DOI 10.1002/num.20467
- (21) Cai, Z., Wang, C., Zhang, S.: Mixed finite element methods for incompressible flow: stationary Navier-Stokes equations. SIAM J. Numer. Anal. 48(1), 79–94 (2010). DOI 10.1137/080718413
- (22) Cai, Z., Wang, Y.: A multigrid method for the pseudostress formulation of Stokes problems. SIAM J. Sci. Comput. 29(5), 2078–2095 (2007). DOI 10.1137/060661429
- (23) Carrero, J., Cockburn, B., Schötzau, D.: Hybridized globally divergence-free LDG methods. I. The Stokes problem. Math. Comp. 75(254), 533–563 (2006). DOI 10.1090/S0025-5718-05-01804-1
- (24) Carstensen, C., Gallistl, D., Schedensack, M.: Quasi-optimal adaptive pseudostress approximation of the Stokes equations. SIAM J. Numer. Anal. 51(3), 1715–1734 (2013)
- (25) Carstensen, C., Kim, D., Park, E.J.: A priori and a posteriori pseudostress-velocity mixed finite element error analysis for the Stokes problem. SIAM J. Numer. Anal. 49(6), 2501–2523 (2011)
- (26) Cesmelioglu, A., Cockburn, B., Nguyen, N.C., Peraire, J.: Analysis of HDG methods for Oseen equations. J. Sci. Comput. 55(2), 392–431 (2013). DOI 10.1007/s10915-012-9639-y
- (27) Cesmelioglu, A., Cockburn, B., Qiu, W.: Analysis of a hybridizable discontinuous Galerkin method for the steady-state incompressible Navier-Stokes equations. Math. Comp. 86(306), 1643–1670 (2017). DOI 10.1090/mcom/3195
- (28) Chen, X., Li, Y., Drapaca, C., Cimbala, J.: A unified framework of continuous and discontinuous galerkin methods for solving the incompressible navier-stokes equation. J. Comp. Phys. 422, 109,799 (2020). DOI 10.1016/j.jcp.2020.109799
- (29) Christiansen, S.H., Winther, R.: Smoothed projections in finite element exterior calculus. Math. Comp. 77(262), 813–829 (2008)
- (30) Cockburn, B., Sayas, F.J.: Divergence-conforming HDG methods for Stokes flows. Math. Comp. 83(288), 1571–1598 (2014). DOI 10.1090/S0025-5718-2014-02802-0
- (31) Cui, M., Ye, X.: Superconvergence of finite volume methods for the Stokes equations. Numer. Methods Partial Differential Equations 25(5), 1212–1230 (2009). DOI 10.1002/num.20399
- (32) Demlow, A.: Suboptimal and optimal convergence in mixed finite element methods. SIAM J. Numer. Anal. 39(6), 1938–1953 (2002). DOI 10.1137/S0036142900376900
- (33) Di Pietro, D.A., Ern, A.: Mathematical aspects of discontinuous Galerkin methods, Mathématiques & Applications (Berlin) [Mathematics & Applications], vol. 69. Springer, Heidelberg (2012). DOI 10.1007/978-3-642-22980-0
- (34) Dörfler, W.: A convergent adaptive algorithm for Poisson’s equation. SIAM J. Numer. Anal. 33(3), 1106–1124 (1996). DOI 10.1137/0733054
- (35) Douglas Jr., J., Roberts, J.E.: Global estimates for mixed methods for second order elliptic equations. Math. Comp. 44(169), 39–52 (1985). DOI 10.2307/2007791
- (36) Durán, R.: Superconvergence for rectangular mixed finite elements. Numer. Math. 58(3), 287–298 (1990). DOI 10.1007/BF01385626
- (37) Eichel, H., Tobiska, L., Xie, H.: Supercloseness and superconvergence of stabilized low-order finite element discretizations of the Stokes problem. Math. Comp. 80(274), 697–722 (2011). DOI 10.1090/S0025-5718-2010-02404-4
- (38) Ewing, R.E., Liu, M.M., Wang, J.: Superconvergence of mixed finite element approximations over quadrilaterals. SIAM J. Numer. Anal. 36(3), 772–787 (1999)
- (39) Falk, R.S., Neilan, M.: Stokes complexes and the construction of stable finite elements with pointwise mass conservation. SIAM J. Numer. Anal. 51(2), 1308–1326 (2013). DOI 10.1137/120888132
- (40) Fu, G., Jin, Y., Qiu, W.: Parameter-free superconvergent -conforming HDG methods for the Brinkman equations. IMA J. Numer. Anal. 39(2), 957–982 (2019). DOI 10.1093/imanum/dry001
- (41) Gatica, G.N., Gatica, L.F., Márquez, A.: Analysis of a pseudostress-based mixed finite element method for the Brinkman model of porous media flow. Numer. Math. 126(4), 635–677 (2014). DOI 10.1007/s00211-013-0577-x
- (42) Girault, V., Raviart, P.A.: Finite element methods for Navier-Stokes equations, Springer Series in Computational Mathematics, vol. 5. Springer-Verlag, Berlin (1986). DOI 10.1007/978-3-642-61623-5. Theory and algorithms
- (43) Guzmán, J., Neilan, M.: Conforming and divergence-free Stokes elements on general triangular meshes. Math. Comp. 83(285), 15–36 (2014). DOI 10.1090/S0025-5718-2013-02753-6
- (44) Hu, J., Ma, L., Ma, R.: Optimal superconvergence analysis for the Crouzeix-Raviart and the Morley elements. Advances in Computational Mathematics 47 (2021). DOI 10.1007/s10444-021-09874-7
- (45) Hu, J., Yu, G.: A unified analysis of quasi-optimal convergence for adaptive mixed finite element methods. SIAM J. Numer. Anal. 56(1), 296–316 (2018)
- (46) Huang, Y., Li, J., Wu, C.: Averaging for superconvergence: verification and application of 2d edge elements to maxwell’s equations in metamaterials. Comput. Methods Appl. Mech. Engrg. 255, 121–132 (2013)
- (47) Kundu, P.K., Dowling, D.R., Tryggvason, G., Cohen, I.M.: Fluid mechanics, 6th edn. Academic Press (2015)
- (48) Li, Y.: Quasi-optimal adaptive mixed finite element methods for controlling natural norm errors. Math. Comp. 90, 565–593 (2021). DOI 10.1090/mcom/3590
- (49) Li, Y.: Superconvergent flux recovery of the Rannacher-Turek nonconforming element. J. Sci. Comput. 87(1), Paper No. 32, 19 (2021). DOI 10.1007/s10915-021-01445-8
- (50) Li, Y.W.: Global superconvergence of the lowest-order mixed finite element on mildly structured meshes. SIAM J. Numer. Anal. 56(2), 792–815 (2018). DOI 10.1137/17M112587X
- (51) Liu, H., Yan, N.: Superconvergence analysis of the nonconforming quadrilateral linear-constant scheme for Stokes equations. Adv. Comput. Math. 29(4), 375–392 (2008). DOI 10.1007/s10444-007-9054-3
- (52) Liu, X., Li, J., Chen, Z.: A weak Galerkin finite element method for the Oseen equations. Adv. Comput. Math. 42(6), 1473–1490 (2016). DOI 10.1007/s10444-016-9471-2
- (53) Lovadina, C., Stenberg, R.: Energy norm a posteriori error estimates for mixed finite element methods. Math. Comp. 75(256), 1659–1674 (2006). DOI 10.1090/S0025-5718-06-01872-2
- (54) Morin, P., Nochetto, R.H., Siebert, K.G.: Data oscillation and convergence of adaptive FEM. SIAM J. Numer. Anal. 38(2), 466–488 (2000)
- (55) Mu, L., Wang, J., Ye, X.: A stable numerical algorithm for the Brinkman equations by weak Galerkin finite element methods. J. Comput. Phys. 273, 327–342 (2014). DOI 10.1016/j.jcp.2014.04.017
- (56) Pan, J.: Global superconvergence for the bilinear-constant scheme for the Stokes problem. SIAM J. Numer. Anal. 34(6), 2424–2430 (1997). DOI 10.1137/S0036142995286167
- (57) Park, E.J., Seo, B.: An upstream pseudostress-velocity mixed formulation for the Oseen equations. Bull. Korean Math. Soc. 51(1), 267–285 (2014). DOI 10.4134/BKMS.2014.51.1.267
- (58) Qian, Y., Wu, S., Wang, F.: A mixed discontinuous Galerkin method with symmetric stress for Brinkman problem based on the velocity-pseudostress formulation. arXiv e-prints arXiv:1907.01246 (2019)
- (59) Raviart, P.A., Thomas, J.M.: A mixed finite element method for 2nd order elliptic problems. In: Mathematical aspects of finite element methods, pp. 292–315. Lecture Notes in Math., Vol. 606. (Proc. Conf., Consiglio Naz. delle Ricerche (C.N.R.), Rome (1977)
- (60) Stenberg, R.: Postprocessing schemes for some mixed finite elements. RAIRO Modél. Math. Anal. Numér. 25(1), 151–167 (1991). DOI 10.1051/m2an/1991250101511
- (61) Wang, J., Ye, X.: Superconvergence of finite element approximations for the Stokes problem by projection methods. SIAM J. Numer. Anal. 39(3), 1001–1013 (2001). DOI 10.1137/S003614290037589X
- (62) Wang, J., Ye, X.: A weak Galerkin finite element method for the stokes equations. Adv. Comput. Math. 42(1), 155–174 (2016). DOI 10.1007/s10444-015-9415-2
- (63) Xu, J., Zhang, Z.: Analysis of recovery type a posteriori error estimators for mildly structured grids. Math. Comp. 73(247), 1139–1152 (2004). DOI 10.1090/S0025-5718-03-01600-4
- (64) Ye, X.: Superconvergence of nonconforming finite element method for the Stokes equations. Numer. Methods Partial Differential Equations 18(2), 143–154 (2002). DOI 10.1002/num.1036.abs
- (65) Zhang, Z., Naga, A.: A new finite element gradient recovery method: superconvergence property. SIAM J. Sci. Comput. 26(4), 1192–1213 (2005). DOI 10.1137/S1064827503402837
- (66) Zienkiewicz, O.C., Zhu, J.Z.: A simple error estimator and adaptive procedure for practical engineering analysis. Internat. J. Numer. Methods Engrg. 24(2), 337–357 (1987). DOI 10.1002/nme.1620240206
- (67) Zienkiewicz, O.C., Zhu, J.Z.: The superconvergent patch recovery and a posteriori error estimates. I. The recovery technique. Internat. J. Numer. Methods Engrg. 33(7), 1331–1364 (1992). DOI 10.1002/nme.1620330702