Next Article in Journal
Revisiting a Classic Identity That Implies the Rogers–Ramanujan Identities III
Previous Article in Journal
Quasi-Periodic and Periodic Vibration Responses of an Axially Moving Beam under Multiple-Frequency Excitation
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Robust a Posteriori Error Estimates of Time-Dependent Poisson–Nernst–Planck Equations

1
School of Mathematical Sciences, East China Normal University, Shanghai 200241, China
2
Hua Lookeng Honors College, Changzhou University, Changzhou 213164, China
*
Author to whom correspondence should be addressed.
Mathematics 2024, 12(17), 2610; https://doi.org/10.3390/math12172610
Submission received: 11 July 2024 / Revised: 18 August 2024 / Accepted: 21 August 2024 / Published: 23 August 2024

Abstract

:
The paper considers the a posteriori error estimates for fully discrete approximations of time-dependent Poisson–Nernst–Planck (PNP) equations, which provide tools that allow for optimizing the choice of each time step when working with adaptive meshes. The equations are discretized by the Backward Euler scheme in time and conforming finite elements in space. Overcoming the coupling of time and the space with a full discrete solution and dealing with nonlinearity by taking G-derivatives of the nonlinear system, the computable, robust, effective, and reliable space–time a posteriori error estimation is obtained. The adaptive algorithm constructed based on the estimates realizes the parallel adaptations of time steps and mesh refinements, which are verified by numerical experiments with the time singular point and adaptive mesh refinement with boundary layer effects.

1. Introduction

In this work, we focus on the Poisson–Nernst–Planck (PNP) equations, which are among the models for charge transport. The system serves as the basis for modeling many devices, such as semiconductor studies, electrodiffusion problems, and the dynamics of ion transport in biological membrane channels [1,2,3]. The system and its modifications have been studied with the existence, uniqueness, and stability of a solution [4,5,6].
A variety of numerical methods have been used extensively for solving PNP equations [7,8,9]. In the application of time-dependent PNP equations, the boundary layer effect due to the thin Debye layer will arbitrarily change their positions in space with the flow of time, which causes the computational cost of the solving process being very large, and the methods in [7,8,9] lose effectiveness. Therefore, solving time-dependent PNP equations with boundary layers is valuable and challenging.
The adaptive finite element method can reduce the computational complexity through nonuniform mesh distributions, which is a good method to solve time-dependent PNP equations with boundary layers. For time-dependent problem, the solving process with the parallel adaptations of time steps and mesh refinements will make the calculation more efficient. The aim of this paper is to propose an adaptive finite element method for fully discrete time-dependent PNP equations, more precisely, to provide tools that allow for optimizing the choice of each time step when working with adaptive meshes.
The a posteriori error analysis plays an important role in adaptivity techniques, which can measure the actual discrete errors without knowledge of the exact solution. With the nonlinearity and strong coupling properties of PNP equations, the a posteriori estimates and associated adaptive algorithms for time-dependent PNP equations are challenging, both for theory and computations. Such issues are, for instance, the way to analyze the a posterior error estimation of fully discrete approximations, robust estimates for strongly coupled nonlinear parabolic problems, and the algorithms for both the time step and the spatial mesh adaptivity. Then, we will explore methods to solve the difficulties through a literature review.
There have been considerable efforts devoted to overcoming the coupling of time and space for a posteriori error estimates of fully discrete approximations. Picasso [10], Verfürth [11], Chen and Jia [12], and Chami and Sayah [13] have managed to bound the error by the spatial estimators at each time step based on the error equation. Bergam, Bernardi and Mghazli [14] established an approach, and the main idea consists of uncoupling time and space errors as much as possible. According to the idea of [14], Bernardi and Verfürth [15] and Bernardi and Sayah [16,17] derived estimates of time-dependent Stokes problem, time-dependent Stokes equations with mixed boundary conditions, and time-dependent Navier–Stokes equations with mixed boundary conditions, respectively. The main estimate tool in Lakkis and Makridakis [18] is the elliptic reconstruction technique introduced by Makridakis and Nochetto [19] for the model problem of semi-discrete finite element approximation. The elliptic reconstruction leads to an appropriate pointwise representation of the error equation. Akrivis [20], and Makridakis and Nochetto [21] have applied the reconstruction technique into Crank–Nicolson and Runge–Kutta schemes. Bnsch, Karakatsani and Makridakis [22] devoted their work to an a posteriori error analysis of fully discrete finite element approximations to the time-dependent Stokes system, where estimates are based on the methodology developed in [18,19] for space discrete and in [20,21] for time discrete schemes.
For nonlinear time-dependent problem, the construction of a posteriori error estimators for fully discrete approximations is a challenge. The pioneering work of Moore [23] and Eriksso and Johnsone [24] discussed a class of nonlinear scalar problem. Verfürth [25] showed that estimates for fully discrete approximations of certain quasilinear parabolic paroblems and estimators are not computable. Moreover, ref. [25] used the framework in [26]. Babuška, Feistauer and Šolín [27] converted a parabolic or hyperbolic problem to a system of ordinary differential equations, and gave a posteriori error estimates for a general nonlinear parabolic problem with a strongly monotonic elliptic operator. Bernardi and Sayah in [17] used the theory of Pousin and Rappaz [28] to handle the nonlinear term of time-dependent Navier–Stokes equations. It is worth noting that the techniques dealing with the nonlinearity in [28] are similar to those in [26]. The situation for fully discrete nonlinear time-dependent problems, however, has not yet been as thoroughly explored.
It is worth noting that a small positive perturbation parameter ϵ leading to the solutions of PNP equations typically contains layers. We expect to have a robust a posteriori analysis of PNP equations with respect to the singular perturbation parameter. For the boundary layer effect, there are many studies on the a posterior estimation of stationary linear singular perturbation problems [29,30,31] and the nonstationary convection dominated convection–diffusion equation [27,32]. Time-dependent PNP equations have received less attention, and coupling and nonlinearity properties make the problem more difficult.
In this paper, we consider the time-dependent PNP equations which are discretized by the Backward Euler scheme in time and conforming finite elements in space. For PNP equations, the way to construct the error equation [10,11,12,13] and build elliptic reconstruction [18,19,20,21,22] by the properties of linear equations is not a good choice due to the nonlinearity and strong coupling properties of the system. Instead of using the time semi-discrete solution to decouple the error [14,15,16,17], our method consists of associating with a full discrete solution. With the full discrete solution, we can obtain a posteriori estimates through the solution existence and uniqueness of linearized equations derived by taking G-derivatives of the nonlinear system. Meanwhile, the efficient and reliable a posteriori error estimators are proved, referring to the techniques in [17,26]. The robustness of the estimator is demonstrated with an improved energy norm in view of the coupling properties of PNP equations. Based on the adaptive algorithm in [10,12], numerical experiments are conducted. Numerical results show the phenomenon of adaptive time step adjustment due to the time singular point and adaptive mesh refinement with boundary layer effects.
The paper is organized as follows. We begin in Section 2 by defining the PNP equations, its variational form, and the finite element spaces to be used. In Section 3, we verify the solution existence and uniqueness of linearized equations with details presented in Appendix A, and further develop the a poteriori error estimate with time and space. The computable, robust, effective and reliable space–time a posteriori error estimations are derived. We introduce the adaptive algorithm in Section 4, and numerical experiments are reported with showing the adaptive phenomenon in time and space, respectively. Conclusion remarks and future work are finally given in Section 5.

2. The Poisson–Nernst–Planck Equations and Their Discretization

In this work, we consider the time-dependent Poisson–Nernst–Planck (PNP) equations [9]:
C i t · D i ( C i + β z i e C i ψ ) = 0 , i = 1 , , K , · ( ε r ε 0 ψ ) i = 1 K z i e C i = F f ,
which describe the nonlinear coupling of the electric potential ψ and the ionic concentration C i of the i-th species, where the number of ion species is K. The first equation is called the Nernst–Planck equation for species i, and the second one is named Poisson’s equation. Here, D i and z i are the diffusivity and valence, respectively. β = 1 / ( k B T a b s ) , where  k B is the Boltzmann constant and T a b s is the absolute temperature. e is the elementary charge, ε r and ε 0 are the relative and vacuum dielectric permittivities, and  F f is generally the fixed charges.
The boundary conditions are a critical component of the PNP model and determine important qualitative behavior of the solution. Let Ω be a bounded domain with Lipschitz boundary Ω . Homogeneous no-flux conditions are considered for each charged species, i.e.,
( C i + z i C i ψ ) · n = 0 , x Ω , i = 1 , , K ,
where n is the outward unit normal vector on the boundary Ω .
The external electrostatic potential ψ is influenced by applied potential, which can be modeled by prescribing a Dirichlet boundary condition, i.e.,
ψ = 0 , Ω × ( 0 , T ] .
For nonhomogeneous Dirichlet boundary conditions such as ψ | Ω = g , they can be transformed into homogeneous Dirichlet boundary conditions. Since the PNP equations is assumed to satisfy the no-flux boundary condition for the charge carrier concentrations, it is known that the charge carrier concentrations satisfy the conservation of mass [33].
For convenience, assuming
K = 2 ; D i = 1 , i = 1 , 2 ; β = e = 1 ; ϵ : = ϵ r · ϵ o ,
ϵ is a constant in system (1). Let ( C 1 0 , C 2 0 , ψ 0 ) be the initial ionic concentrations and electric potential. We use standard notations for Sobolev spaces W 1 , 2 ( Ω ) = H 1 ( Ω ) , and the associated norms and semi-norms. Here, H 0 1 ( Ω ) = { v H 1 ( Ω ) : v | Ω = 0 } and H 1 ( Ω ) = ( H 0 1 ( Ω ) ) * , which means the dual space of H 0 1 ( Ω ) . The variational form of system (1) is as follows.
To find C i L 2 ( 0 , T ; H 1 ( Ω ) ) , i = 1 , 2 , ψ L 2 ( 0 , T ; H 0 1 ( Ω ) ) such that
( C i t , v i ) + ( C i , v i ) + ( z i C i ψ , v i ) = 0 , v i H 1 ( Ω ) , i = 1 , 2 , ( ϵ ψ , v 3 ) i = 1 2 ( z i C i , v 3 ) = ( F f , v 3 ) , v 3 H 0 1 ( Ω ) ,
where z i is the valence of C i , i = 1 , 2 , the scalar product ( . , . ) is the standard L 2 -scalar product, and ( C 1 0 , C 2 0 , ψ 0 ) is the initial value. When F f L ( 0 , T ; R d ) , there is a unique solution to the variational problem [4]. For simplicity, in the following, we choose z 1 = 1 and z 2 = 1 .
Let the quasi-uniform mesh of Ω be T h with mesh size 0 < h < 1 [34] and the corresponding finite element space be
V h = { v H 1 ( Ω ) : v | τ P 1 ( τ ) , τ T h } ,
and
V h , 0 = { v H 0 1 ( Ω ) : v | τ P 1 ( τ ) , τ T h } ,
where V h H 1 ( Ω ) and V h , 0 H 0 1 ( Ω ) .
For the time discretization, define a partition of the time domain,
0 = t 0 < t 1 < < t m = T ,
where t n = j = 1 m τ i and τ j : = t j t j 1 .
Y : = H 1 ( Ω ) × H 1 ( Ω ) × H 0 1 ( Ω ) , Y h : = V h × V h × V h , 0 . For all u L 2 ( 0 , T ; H 1 ( Ω ) ) , u n : = u ( x , t n ) , u h ( t ) : = u h ( · , t ) , t 0 , and  u h n : = u h ( x , t n ) . Define the following scheme:
u n t = u n u n 1 τ n ,
and using the Backward Euler scheme, the fully discrete form of the variational problem is as follows.
For n = 1 , 2 , , N , find u h n = ( C 1 , h n , C 2 , h n , ψ h n ) Y h such that
C i , h n C i , h n 1 τ n , v i , h + ( C i , h n , v i , h ) + ( z i C i , h n ψ h n , v i , h ) = 0 , v i , h V h , i = 1 , 2 , ( ϵ ψ h n , v 3 , h ) i = 1 2 ( z i C i , h n , v 3 , h ) = ( F f , n , v 3 , h ) , v 3 , h V h , 0 .
The initial value ( C 1 , h 0 , C 2 , h 0 , ψ h 0 ) is the interpolation of ( C 1 0 , C 2 0 , ψ 0 ) in Y h . Ref. [35] proved the existence and uniqueness of solutions to the above problems. By setting the test functions ( v 1 , h , v 2 , h , v 3 , h ) = ( 1 , 1 , 0 ) , we have Ω C i , h n d x = Ω C i , h 0 d x , i = 1 , 2 , that is, the global mass conservation property is satisfied.
Assuming u = ( C 1 , C 2 , ψ ) is the weak solution of system (3), where u L 2 ( 0 , T ; Y ) if and only if v Y , t [ 0 , T ] , u satisfies
( F ( u ) , v ) : = Ω ( i = 1 2 C i t v i + C i · v i + z i C i ψ · v i + ϵ ψ · v 3 i = 1 2 z i C i v 3 F f v 3 ) d x = 0 .
Hence, the weak problem of the system (3) is to find u = ( C 1 , C 2 , ψ ) L 2 ( 0 , T ; Y ) such that
( F ( u ) , v ) = 0 , v Y ,
where F is a nonlinear operator from L 2 ( 0 , T ; Y ) to Y * .
Similarly, the finite element approximation of system (4) indicates that the full discrete approximation of problem (6) is to find u h n Y h satisfying,
( F ( u h n ) , v h ) = 0 , v h = ( v h , 1 , v h , 2 , v h , 3 ) Y h ,
where
( F ( u h n ) , v h ) = Ω ( i = 1 2 ( C i , h n C i , h n 1 τ n v i , h + C i , h n · v i , h + z i C i , h n ψ h n v i , h ) + ϵ ψ h n · v 3 , h i = 1 2 z i C i , h n v 3 , h F f v 3 , h ) d x .
The error in this work is measured in following the norm, i.e., ϕ H 1 ( Ω ) ,
| | ϕ | | ϵ , Ω : = ϕ L 2 ( Ω ) 2 + ϵ | ϕ | 1 , Ω 2 1 / 2 ,
| | ϕ | | * , Ω : = | | ϕ | | ϵ , Ω + sup v H 1 ( Ω ) 0 ( ϕ , v ) v ϵ , Ω ,
and
| | u | | ϵ , Ω : = C 1 1 , Ω 2 + C 2 1 , Ω 2 + ψ ϵ , Ω 2 1 / 2 ,
| | u | | * , Ω : = C 1 1 , Ω 2 + C 2 1 , Ω 2 + ψ * , Ω 2 1 / 2 ,
where 0 < ϵ 1 .
And f H 1 ( Ω ) , we define
| | f | | ϵ , Ω : = sup v H 0 1 ( Ω ) | ( f , v ) | v ϵ , Ω ,
and F Y * where Y * is the dual space of Y ,
| | F | | ϵ , Ω : = sup v Y | ( F , v ) | v ϵ , Ω ,
u L 2 ( 0 , T ; X ) ,
u L 2 ( 0 , T ; X ) : = ( 0 T u X 2 d s ) 1 2 ,
where u X = ( i = 1 3 u i X 2 ) 1 2 .
For brevity, we introduce the space
V ( a , b ) = κ = ( κ 1 , κ 2 , κ 3 ) L 2 ( a , b ; Y ) : t κ 1 , t κ 2 L 2 ( a , b ; H 1 ( Ω ) ) ,
which is a Banach space [36] with respect to the norm defined by
κ V ( a , b ) = a b ( κ 1 1 , Ω 2 + κ 2 1 , Ω 2 + κ 3 * , Ω 2 ) d s + i = 1 2 a b t κ i ϵ , Ω 2 d s 1 2 .
A similar definition can be found in [11,37].
For the system (3), we have C 1 t , C 2 t L 2 ( 0 , T ; H 1 ( Ω ) ) with L 2 ( Ω ) H 1 ( Ω ) , and  u V ( 0 , T ) .

3. The a Posteriori Error Estimates

In this section, we present a posteriori error estimates for PNP equations. In Section 3.1, we bound the error by the computable error estimator η . And the lower bound of the local error in space and time is proved, respectively, in Section 3.2.

3.1. Upper Bound of Errors

For the a posteriori error studies, we use the piecewise affine function u h , τ , which takes the values in the interval [ t n 1 , t n ] as follows:
u h , τ | [ t n 1 , t n ] = t t n 1 τ n ( ( C 1 , h n C 1 , h n 1 ) , ( C 2 , h n C 2 , h n 1 ) , ( ψ h n ψ h n 1 ) ) + ( C 1 , h n 1 , C 2 , h n 1 , ψ h n 1 ) = t t n 1 τ n ( u h n u h n 1 ) + u h n 1 .
And we consider the a posteriori error estimate for the error u u h , τ ϵ , Ω .
Our method consists of associating with u h n such that
e : = u u h , τ
can be split as
ρ : = ρ 1 ρ 2 ,
and
ρ 1 : = u u h n , ρ 2 : = u h n u h , τ .
Furthermore, for a posterior error estimates of ρ , it can be observed that ρ 2 can only be reduced by changing the time step at a fixed time, then we treat the estimates of ρ 2 as the time a posterior error estimates. Meanwhile, the remaining part ρ 1 is handled as a posterior error estimates of the space. In the following discussion, we will deal with the estimates of ρ 1 firstly.
For the estimate about ρ 1 , we deal with the nonlinearity through the property of the linearized equations derived by taking G derivatives of the nonlinear system. The definition of DF ( · ) at u is as follows [38]:
( DF ( u ) ϕ , w ) = lim ε ˜ 0 ( F ( u + ε ˜ ϕ ) F ( u ) , w ) ε ˜ , ϕ L 2 ( 0 , T ; [ H 0 1 ( Ω ) ] 3 ) , w Y ,
which leads to the following linear problem:
R L 2 ( 0 , T ; [ L 2 ( Ω ) ] 3 ) L 2 ( 0 , T ; [ H 1 ( Ω ) ] 3 ) , to find ϕ = ( ϕ 1 , ϕ 2 , ϕ 3 ) L 2 ( 0 , T ; [ H 0 1 ( Ω ) ] 3 ) , such that
( DF ( u ) ϕ , v ) = ( R , v ) , v Y ,
where u = ( C 1 , C 2 , ψ ) satisfies Equation (6), ϕ 1 ( x , 0 ) = ϕ 2 ( x , 0 ) = 0 and
( DF ( u ) ϕ , v ) = i = 1 2 ( ( ϕ i t , v i ) + ( ϕ i , v i ) + z i ( C i ϕ 3 , v i ) + z i ( ϕ i ψ , v i ) ) + ( ϵ ϕ 3 , v 3 ) i = 1 2 z i ( ϕ i , v 3 ) .
Meanwhile, v i H 1 ( Ω ) L 2 ( Ω ) , ϕ i t L 2 ( Ω ) H 1 ( Ω ) , i = 1 , 2 , that is ϕ V ( 0 , T ) .
For the estimate about ρ 1 , Lemma 2 is proved firstly. One of the important tools used in the proof of Lemma 2 is the solution existence and uniqueness of the linear problem (10), which is verified in Lemma 1. In all proofs, a b means a C b , where C is a constant independent of ϵ .
Lemma 1.
If C 1 , C 2 L ( Ω ) and ψ W 1 , ( Ω ) , there exists a unique solution of Equation (10) in V ( 0 , T ) .
Proof. 
The proof of the lemma is referred to in [4]; see Appendix A for details. □
Lemma 2.
If C 1 , C 2 , and ψ satisfy the condition in Lemma 1, we have the regularity conclusion for Equation (10) that R L 2 ( 0 , T ; [ L 2 ( Ω ) ] 3 ) :
ϕ V ( 0 , T ) M 1 ( 0 T R ϵ , Ω 2 d s ) 1 / 2 ,
where constant M 1 is independent of u , ϕ , R , and ϵ.
Proof. 
Due to the variational form of Equation (10) as Equation (11), we have v Y ,
| ( DF ( u ) ϕ , v ) | | ϕ 1 | 1 , Ω | v 1 | 1 , Ω + | ϕ 3 | 1 , Ω | v 1 | 1 , Ω + ϕ 1 L 2 ( Ω ) | v 1 | 1 , Ω + | ϕ 2 | 1 , Ω | v 2 | 1 , Ω + | ϕ 3 | 1 , Ω | v 2 | 1 , Ω + ϕ 2 L 2 ( Ω ) | v 2 | L 2 ( Ω ) + ϵ | ϕ 3 | 1 , Ω | v 3 | 1 , Ω + ϕ 1 L 2 ( Ω ) v 3 L 2 ( Ω ) + ϕ 2 L 2 ( Ω ) v 3 L 2 ( Ω ) + ϕ 1 t ϵ , Ω v 1 1 , Ω + ϕ 2 t ϵ , Ω v 2 1 , Ω ϕ * , Ω v ϵ , Ω .
Due to Lemma 1, we have the one-to-one mapping DF ( u ) : V [ 0 , T ] L 2 ( 0 , T ; Y * ) . By the bounded inverse theorem, there exists an inverse DF ( u ) 1 : L 2 ( 0 , T ; Y * ) V [ 0 , T ] and R L 2 ( 0 , T ; [ L 2 ( Ω ) ] 3 ) L 2 ( 0 , T ; Y * ) ,
ϕ V ( 0 , T ) = G R V ( 0 , T ) M 2 R L 2 ( 0 , T ; Y * ) ,
with R Y * = sup v Y ( R , v ) v * , Ω and v ϵ , Ω v * , Ω , v [ H 0 1 ( Ω ) ] 3 , we have
ϕ V ( 0 , T ) M 2 ( 0 T R ϵ , Ω 2 d s ) 1 / 2 ,
and Equation (12) is proved with M 1 independent of u , ϕ , ϵ , and R . □
Theorem 1.
If C 1 , C 2 , and ψ satisfy the condition in Lemma 1, and max i = 1 , 2 { z i e i L ( Ω ) } ϵ / ( 2 2 M 2 ) , then
u u h n V ( 0 , T ) 2 M 1 ( 0 T F ( u h n ) ϵ , Ω 2 d s ) 1 2 ,
where M 1 are constants in Equation (12) in taking ϕ = u u h n .
Proof. 
Denote ρ 1 = u u h n : = ( e 1 , e 2 , e 3 ) . The definition of the G derivative [38] indicates that w Y ,
0 1 ( DF ( u l ρ 1 ) ρ 1 , w ) d l = ( F ( u h n ) , w ) ( F ( u ) , w ) .
With Equation (6), we have
( F ( u h n ) , w ) = 0 1 ( DF ( u l ρ 1 ) ρ 1 , w ) d l ,
and thus
( DF ( u ) ρ 1 , w ) = 0 1 ( DF ( u ) ρ 1 DF ( u l ρ 1 ) ρ 1 , w ) d l + ( F ( u h n ) , w ) .
Then, we define ( DF ( u ) ρ 1 , w ) = ( R ˜ , w ) . The integral part in Equation (15) is estimated, i.e.,
| ( DF ( u ) ρ 1 DF ( u l ρ 1 ) ρ 1 , w ) | 2 l Ω i = 1 2 z i e i e 3 · w i d x 2 2 l e 3 L ( Ω ) ( | | e 1 | | L 2 ( Ω ) | | w 1 | | L 2 ( Ω ) + | | e 1 | | L 2 ( Ω ) | | w 2 | | L 2 ( Ω ) ) 2 2 l e 3 L ( Ω ) ρ ϵ , Ω w ϵ , Ω ,
and
sup w W ; w ϵ , Ω = 1 0 1 ( DF ( u ) ρ 1 DF ( u l ρ 1 ) ρ 1 , w ) d l + | ( F ( u h n ) , w ) | sup w W ; w ϵ , Ω = 1 ( 2 max { e 3 L ( Ω ) } | | ρ 1 | | ϵ , Ω | | w | | ϵ , Ω ) + | | F ( u h n ) | | ϵ , Ω = 2 max { e 3 L ( Ω ) } | | ρ 1 | | ϵ , Ω + | | F ( u h ) | | ϵ , Ω .
The second inequality of (12) in Lemma 2 leads to ρ 1 V ( 0 , T ) M 1 ( 0 T R ˜ ϵ , Ω 2 d s ) 1 2 as taking ϕ = ρ 1 . Hence,
ρ 1 V ( 0 , T ) 2 M 1 max { e 3 L ( Ω ) } ρ 1 V ( 0 , T ) + M 1 ( 0 T | | F ( u h n ) | | ϵ , Ω 2 d s ) 1 2 .
Notably, we shall have ρ 1 V ( 0 , T ) ( 0 T F ( u h n ) ϵ , Ω 2 d s ) 1 2 if max i = 1 , 2 { z i e i L ( Ω ) } < ( ϵ / 2 M 1 ) ; however, we restrict the condition as max i = 1 , 2 { z i e i L ( Ω ) } ϵ / ( 2 2 M 1 ) , for simplicity, and have
ρ 1 V ( 0 , T ) 2 M 1 ( 0 T F ( u h n ) ϵ , Ω 2 d s ) 1 2 .
This proves the inequality (13).  □
For the sake of discussion, let us define some symbols. For a regular triangle subdivision T h of Ω , N h represents the set of all vertices divided, E h represents all edges contained in T h , and  I h : = E h Ω contains the inner edges of T h . We set w ˜ K : = K K K , w E : = E K K , and w ˜ E : = K w E K K K . h B : = diam ( B ) denotes the diameter of any set B. Let E be the shared edge of K and K ˜ , i.e.,  E = K K ˜ , and  n E represent the outward normal vector of E in K. We define the jump across the edge by
[ v · n E ] : = v · n E | K v · n E | K ˜ , v H 0 1 ( Ω ) ,
and E Ω ; we set [ v · n E ] = 0 for convenience.
The a posteriori estimates of the space can be derived from the right end of Theorem 1 by quite standard arguments [26] with C l e ´ m e n t interpolation and the bubble functions.
Lemma 3
(The estimation of C l e ´ m e n t interpolation [39]). Let R h be the C l e ´ m e n t interpolation operator for a regular partition, then, v H 0 1 ( Ω ) ,
v R h v L 2 ( K ) M ˜ 1 h K v 1 , w ˜ K , K T h , v R h v L 2 ( E ) M ˜ 2 h E 1 / 2 v 1 , w ˜ E , E E h , v R h v L 2 ( K ) M ˜ 3 α K v ϵ , w ˜ K , K T h , v R h v L 2 ( E ) M ˜ 4 ϵ 1 / 4 α E 1 / 2 v ϵ , w ˜ E , E E h ,
where α S = min { 1 , h S ϵ 1 / 2 } and S represent the edge E or element K. Constants M ˜ 1 , ..., M ˜ 4 only depend on the reference element and regular partition.
Let λ K , i ( i = 1 , 2 , 3 ) be the area coordinates on the reference element K. We define the bubble functions b K and b E as follows:
b K ( x ) = 27 λ K , 1 λ K , 2 λ K , 3 , x K , 0 , x Ω K , b E ( x ) = 4 λ K 1 , j λ K 1 , k , x K 1 , 4 λ K 2 , l λ K 2 , m , x K 2 , 0 , x Ω w E ,
where j and k are the indices of E’s two vertexes associated with K 1 while l and m are that with K 2 , and  w E = K 1 K 2 . The space of vector bubble functions is then denoted by Y ˜ h : = ( Y ˜ h 0 ) 3 with Y ˜ h 0 = s p a n { b K u , b E P w : u P k ( K ) , w P k ( E ) , K T h , E I h } . Here, P k ( K ) and P k ( E ) are spaces of linear polynomials on K and E, respectively, and  P : L ( E ) L ( K ) is a continuation operator.
Lemma 4
(Bubble function space [40]). u P 1 ( K ) and w P 1 ( E ) , where K T h and E I h ,
C ˜ 1 u L 2 ( K ) b K u L 2 ( K ) u L 2 ( K ) ,
C ˜ 2 u L 2 ( K ) sup v P 1 ( K ) K u b K v d x v L 2 ( K ) u L 2 ( K ) ,
C ˜ 3 w L 2 ( E ) sup τ P 1 ( E ) E w b E P τ d s τ L 2 ( E ) w L 2 ( E ) ,
C ˜ 4 h K 1 u L 2 ( K ) ( b K u ) L 2 ( K ) C ˜ 5 h K 1 u L 2 ( K ) ,
C ˜ 6 h K 1 b E P w L 2 ( K ) ( b E P w ) L 2 ( K ) C ˜ 7 h K 1 b E P w L 2 ( K ) ,
( b K u ) L 2 ( K ) C ˜ 8 h K 1 u L 2 ( K ) ,
b E P w L 2 ( K ) C ˜ 9 h K 1 / 2 w L 2 ( E ) ,
C ˜ 10 u L 2 ( K ) b K 1 / 2 u L 2 ( K ) u L 2 ( K ) ,
C ˜ 11 u L 2 ( E ) b E 1 / 2 P u L 2 ( K ) u L 2 ( E ) ,
where constants C ˜ 1 , , C ˜ 11 depend on the reference element and regular partition only.
Theorem 2.
There exists a constant M 2 independent of u h , f and ϵ such that
0 T F ( u h n ) ϵ , Ω 2 d s 1 2 M 2 n = 1 N ( τ n ( η s p a c e n ) 2 + ε 2 ) 1 / 2 ,
where η s p a c e n : = K T h η K 2 + E I h η E 2 1 / 2 , and the oscillation term ε : = K T h t n 1 t n ε K 2 d s 1 / 2 , with  F K f , n = K F f , n d x / | K | , F f , n = F f ( x , t n ) , and 
η K 2 : = h K 2 i = 1 2 | | C i , h n C i , h n 1 τ n Δ C i , h n + z i · ( C i , h n ψ n ) | | L 2 ( K ) 2 + α K 2 | | i = 1 2 z i C i , h n F T f , n | | L 2 ( K ) 2 , η E 2 : = h E i = 1 2 | | [ C i , h n · n E ] + z i [ C i , h n ψ h n · n E ] | | L 2 ( K ) 2 + ϵ 1 / 2 α E | | α [ ψ h n · n E ] | | L 2 ( E ) 2 , ε K 2 : = α K 2 F f F K f , n L 2 ( K ) 2 .
Here, | K | denotes the area of K.
Proof. 
With Equation (5), v Y ,
( F ( u h n ) , v ) = Ω ( i = 1 2 ( C i , h n C i , h n 1 τ n v i + C i , h n · v i + z i C i , h n ψ h n · v i ) + ϵ ψ h n · v 3 i = 1 2 z i C i , h n v 3 F f v 3 ) d x .
We denote R h ϕ : = ( R h ϕ 1 , R h ϕ 2 , R h ϕ 3 ) , ϕ Y with R h a C l e ´ m e n t interpolation and have R h L ( Y , Y h ) . We denote by Y h * and ( Id Y R h ) * the dual space of Y h and the dual operator of ( Id Y R h ) , respectively. L ( Y , Y h ) is the Banach space of continuous linear maps of Y in Y h .
For Equation (7) with v h = R h v , ( F ( u h n ) , R h v ) = 0 , then
( F ( u h n ) , v ) = ( F ( u h n ) , v R h v ) = ( F ˜ ( u h n ) , v R h v ) ( F , v R h v ) ,
where ( F , v ) = ( ( F f F T f , n ) , v 3 ) , and 
( F ˜ ( u h n ) , v ) = K T h K ( i = 1 2 ( C i , h n C i , h n 1 τ n v i + C i , h n · v i + z i C i , h n ψ h n · v i ) + ϵ ψ h n · v 3 i = 1 2 z i C i , h n v 3 F K f , n v 3 ) d x .
Then,
F ( u h n ) ϵ , Ω ( Id Y R h ) * ( F ˜ ( u h n ) ) ϵ , Ω + ( I d Y R h ) * ( F ) ϵ , Ω .
The two terms on the right-hand side (RHS) of the above inequality are considered one by one as shown below. The first term is
( Id Y R h ) * ( F ˜ ( u h n ) ) ϵ , Ω = sup ϕ Y , ϕ ϵ , Ω = 1 | K T h { K [ i = 1 2 ( C i , h n C i , h n 1 τ n Δ C i , h n + z i · ( C i , h n ψ h n ) ) ( ϕ i R h ϕ i ) + ( ϵ Δ ψ h n i = 1 2 z i C i , h n F K f , n ) ( ϕ 3 R h ϕ 3 ) ] d x + E I h K E [ i = 1 2 ( [ C i , h n · n E ] + z i [ C i , h n ψ h n · n E ] ) ( ϕ i R h ϕ i ) + ϵ [ ψ h n · n E ] ( ϕ 3 R h ϕ 3 ) ] d s } | sup ϕ Y , ϕ ϵ , Ω = 1 { K T h ( h K i = 1 2 C i , h n C i , h n 1 τ n Δ C i , h n + z i · ( C i , h n ψ h n ) L 2 ( K ) ϕ i 1 , w ˜ K + α K ϵ Δ ψ h n i = 1 2 z i C i , h n F K f , n L 2 ( K ) ϕ 3 1 , w ˜ K ) + E I h ( h E 1 / 2 i = 1 2 [ C i , h n · n E ] + z i [ C i , h n ψ h n · n E ] L 2 ( E ) ϕ i 1 , w ˜ E + ϵ 1 / 4 α E 1 / 2 ϵ [ ψ h n · n E ] L 2 ( E ) ϕ 3 1 , w ˜ E ) } sup ϕ Y , ϕ ϵ , Ω = 1 { K T h η K ϕ 1 ϵ , w ˜ K 2 + ϕ 2 ϵ , w ˜ K 2 + ϕ 3 ϵ , w ˜ K 2 1 / 2 + E I h η E ϕ 1 ϵ , w ˜ E 2 + ϕ 2 ϵ , w ˜ E 2 + ϕ 3 ϵ , w ˜ E 2 1 / 2 } η .
In the second term of the RHS of (28),
( Id Y R h ) * F ϵ , Ω = sup ϕ Y , ϕ ϵ , Ω = 1 | K T h K [ ( F f F K f , n ) ( ϕ 3 R h ϕ 3 ) ] d x | sup ϕ Y , ϕ ϵ , Ω = 1 K T h α K F f F K f , n L 2 ( K ) ϕ 3 ϵ , w ˜ K K T h ε K .
Therefore, according to the above analysis and Equation (26),
( 0 T F ( u h n ) ϵ , Ω 2 d s ) 1 2 n = 1 N t n 1 t n ( η s p a c e n 2 + K T h ε K 2 ) d s 1 / 2 M 2 n = 1 N ( τ n ( η s p a c e n ) 2 + ε 2 ) 1 / 2 .
 □
Theorem 3.
If C 1 , C 2 , ψ and e satisfy the conditions in Theorem 1, there exists a constant M 3 independent of u h , f and ϵ such that
0 T u u h , τ ϵ , Ω 2 d s 1 2 M 3 n = 1 N ( τ n ( η s p a c e n ) 2 + τ n ( η t i m e n ) 2 + ε 2 ) 1 / 2 ,
where η t i m e n : = 1 3 u h n u h n 1 Y 2 1 / 2 .
Proof. 
Equation (8) gives for t [ t n 1 , t n ]
u h n u h , τ = t n t τ n ( u h n u h n 1 ) .
Then, we have
u h n u h , τ L 2 ( 0 , T ; Y ) = t n t τ n ( u h n u h n 1 ) L 2 ( 0 , T ; Y ) 2 1 2 = n = 1 N 1 3 τ n ( u h n u h n 1 ) Y 2 1 2 .
According to Theorem 1,
0 T u u h n ϵ , Ω 2 d s 1 2 u u h n V ( 0 , T ) 2 2 M 2 0 T F ( u h n ) ϵ , Ω 2 d s 1 2 .
Therefore, with Theorem 2, we have
0 T u u h , τ ϵ , Ω 2 d s 1 2 0 T u u h n ϵ , Ω 2 d s 1 2 + 0 T u h n u h , τ ϵ , Ω 2 d s 1 2 0 T u u h n ϵ , Ω 2 d s 1 2 + 0 T u h n u h , τ Y 2 d s 1 2 n = 1 N ( τ n ( η s p a c e n ) 2 + ε 2 ) 1 / 2 + n = 1 N 1 3 τ n u h n u h n 1 Y 2 1 / 2 n = 1 N ( τ n ( η s p a c e n ) 2 + ε 2 + 1 3 τ n u h n u h n 1 Y 2 ) 1 / 2 M 3 n = 1 N ( τ n ( η s p a c e n ) 2 + τ n ( η t i m e n ) 2 + ε 2 ) 1 / 2 ,
with M 3 independent of u h , f and ϵ . □
Remark 1.
For the oscillation term ϵ in inequality (30), ϵ = O ( h 1 + s ) when f i is piecewise H s ( K ) ( 0 < s 1 ) , K T h [41]. Specially, f i f K , i L 2 ( K ) h f i 1 , K , f i H 1 ( K ) and f i f K , i L 2 ( K ) = 0 when f i is a piecewise constant function on T h .

3.2. Upper Bounds of the Estimators

In this subsection, we prove the upper bounds of the space and time estimators, respectively. We now begin with the space estimator. The special bubble function [42] is defined before discussions.
Given any number μ ( 0 , 1 ] , we denote the transformation F μ : R 2 R 2 , which meets
F μ ( ( x , y ) ) = B μ ( x , y ) τ , ( x , y ) R 2 ,
where B μ : = d i a g ( μ , 1 ) . K T h , we set invertible affine map [43] on reference element K ^ that
F K ( x ^ , y ^ ) = B K ( x ^ , y ^ ) τ + b = ( x , y ) τ K , ( x ^ , y ^ ) K ^ .
Set K ^ μ : = F μ ( K ^ ) for the edge bubble function on E ^ , E ^ K ^ ,
b E ^ , μ : = b E ^ F μ 1 ( μ x ^ , y ^ ) ,
and we call b E ^ , μ the special edge bubble function on K ^ μ . We set b E ^ , μ = 0 on K ^ K ^ μ for simplicity defining the function on w E = K 1 K 2 with w H 1 ( E ) as follows:
b E , μ w ( x ) = b E , μ 1 P w , x K 1 , b E , μ 2 P w , x K 2 ,
and b E , μ 1 | E = b E , μ 2 | E = b E | E .
Lemma 5
(Special bubble function [42]). T is the element and E is one of its edge, then w P 1 ( E ) ,
b E , μ P w L 2 ( T ) M ˜ 5 h E 1 / 2 μ 1 / 2 w E , ( b E , μ P w ) L 2 ( T ) M ˜ 6 h E 1 / 2 μ 1 / 2 w E ,
where constants M ˜ 5 and M ˜ 6 only depend on the reference element and regular partition.
The weak problem of the system (3) at t n can be represented so as to find u n = ( C 1 n , C 2 n , ψ n ) Y such that
( F ( u n ) , v ) = 0 , v Y .
Corresponding to problem (31), we obtain the following linear problem at t n by the G derivative: R [ L 2 ( Ω ) ] 3 , to find φ = ( φ 1 , φ 2 , φ 3 ) [ H 0 1 ( Ω ) ] 3 , such that
( DF ( u n ) φ , v ) = ( R , v ) ,
where u n = ( C 1 n , C 2 n , ψ n ) satisfies Equation (31) and
( DF ( u n ) φ , v ) : = ( DF ( u ( x , t n ) ) φ , v ) = Ω ( i = 1 2 ( φ i · v i + z i C i n φ 3 · v i + z i φ i ψ n · v i ) + ϵ φ 3 · v 3 i = 1 2 z i φ i v 3 ) d x .
To build the relationship between u n u h n ϵ , Ω and η s p a c e , we discuss the relationship between F ( u h n ) ϵ , Ω and u n u h n ϵ , Ω at first.
Theorem 4.
Denoting e n = u n u h n . If  C 1 n , C 2 n L ( Ω ) , ψ n W 1 , ( Ω ) , and max i = 1 , 2 { z i e i n L ( Ω ) } ϵ / 2 2 M 1 , we have
u n u h n * , Ω M 4 sup v Y ˜ h , v * , K = 1 | ( F ( u h n ) , v ) | ,
where constant M 4 is independent of u , ϕ and ϵ.
Proof. 
Due to the variational form of Equation (10) as Equation (32), v Y ,
| ( DF ( u n ) φ , v ) | φ * , Ω v * , Ω .
The definition of the G derivative [38] indicates that, v Y ,
0 1 ( DF ( u n l e n ) e n , v ) d l = ( F ( u h n ) , v ) ( F ( u n ) , v ) .
By means of the fact that ( F ( u n ) , v ) = 0 , v Y (Equation (6)), we have
( F ( u h n ) , v ) = 0 1 ( DF ( u n l e n ) e n , v ) d l ,
and thus
( F ( u h n ) , v ) = ( DF ( u n ) e n , v ) 0 1 ( DF ( u n ) e n DF ( u n l e n ) e n , v ) d l .
Then, with inequality (33) and (16) choosing φ = e n and ρ 1 = e n , respectively, we have
sup v Y h , v * , K = 1 | ( F ( u h n ) , v ) | sup v Y ˜ h , v * , K = 1 | ( DF ( u n ) e n , v ) | + 2 max { e 3 L ( Ω ) } e n ϵ , Ω e n * , Ω ,
where the second inequality is provided by using the first inequality in (12).
Consequently,
e n * , Ω M 4 sup v Y h , v * , K = 1 | ( F ˜ ( u h n ) , v ) | ,
and M 4 independent of u , ϕ , and ϵ . □
Theorem 5.
If C 1 , C 2 , ψ and e satisfy the conditions in Theorem 4, there exist constants M 5 , M 6 independent of u h , f , and ϵ such that
η K M 5 ( u n u h n * , K + ε K + ρ K ) ,
and
η E M 6 ( u n u h n * , w ˜ E + ε w E + ρ w E ) ,
where ε w E : = K w E ε K 2 1 / 2 , ρ K : = h K | | F f F K f , n | | L 2 ( K ) and ρ w E : = h K | w E | | F f F K f , n | | L 2 ( w E ) .
Proof. 
For F ˜ h ( u h n ) defined in Equation (27), the relationship between F ˜ h ( u h n ) and each term of η s p a c e n is considered. Then, we have
h K C i , h n C i , h n 1 τ n Δ C i , h n + z i · ( C i , h n ψ n ) L 2 ( K ) h K sup ϕ P 1 ( K ) { 0 } | ( C i , h n C i , h n 1 τ n Δ C i , h + z i · ( C i , h ψ h ) , b K ϕ ) K | · ϕ L 2 ( K ) 1 sup ϕ P 1 ( K ) { 0 } | ( C i , h n C i , h n 1 τ n Δ C i , h + z i · ( C i , h ψ h ) , b K ϕ ) K | · | b K ϕ | 1 , K 1 sup ϕ P 1 ( K ) { 0 } , b K ϕ 1 , K = 1 | ( F ˜ ( u h n ) , ( b K ϕ , 0 , 0 ) ) K | sup v Y ˜ h , v * , K = 1 | ( F ˜ ( u h n ) , v ) K | ,
where inequality (18) is applied for having the first inequality, and inequalities (17) and (20) are used for obtaining the second inequality.
Let w : = b K ( i = 1 2 z i C i , h n + F K f , n ) , then
K ( i = 1 2 z i C i , h n + F K f , n ) w d x = K ( i = 1 2 z i C i , h n + F f , n ) w d x K ( F f , n F K f , n ) w d x = K ( i = 1 2 z i ( C i , h n C i n ) + ϵ ψ n · w ) d x K ( F f , n F K f , n ) w d x = K ( i = 1 2 z i ( C i , h n C i n ) + ϵ ( ψ n ψ h n ) · w ) d x + K ( F f , n F K f , n ) w d x i = 1 2 C i , h n C i n L 2 ( K ) w L 2 ( K ) + ϵ ( ψ h n ψ n ) L 2 ( K ) w L 2 ( K ) + F f , n F K f , n L 2 ( K ) w L 2 ( K ) ( i = 1 2 C i , h n C i n L 2 ( K ) + F f , n F K f , n L 2 ( K ) ) i = 1 2 z i C i , h n + F K f , n L 2 ( K ) + ϵ h K 1 ( ψ h n ψ n ) L 2 ( K ) i = 1 2 z i C i , h n + F K f , n L 2 ( K ) ,
where the last inequality is obtained by inequalities (17) and (22).
With the left side of inequality (24) and α K ϵ h K 1 = ϵ ϵ 1 / 2 min { 1 , ϵ 1 / 2 h K 1 } ϵ 1 / 2 , we have
α K n h p h f K , 3 L 2 ( K ) u n u h n ϵ , K + ε K .
On the side of η E , we have
h E 1 / 2 | | [ C i , h · n E ] + [ C i , h ψ h · n E ] | | L 2 ( E ) h E 1 / 2 sup δ P 1 ( E ) { 0 } | | δ | | L 2 ( E ) 1 | E ( [ C i , h · n E ] + [ C i , h ψ h · n E ] ) b E P δ d s | h E 1 / 2 h K 1 / 2 sup δ P 1 ( E ) { 0 } | | b E P δ | | L 2 ( K ) 1 | E ( [ C i , h · n E ] + [ C i , h ψ h · n E ] ) b E P δ d s | h K sup δ P 1 ( E ) { 0 } | | b E P δ | | L 2 ( K ) 1 | ( F ˜ ( u h n ) , ( b E P δ , 0 , 0 ) ) w ˜ E . w ˜ E ( C i , h n C i , h n 1 τ n Δ C i , h n + z i · ( C i , h n ψ n ) ) b E P δ d x | sup v Y ˜ h , v 1 , Ω = 1 | ( F ˜ ( u h n ) , v ) | + h K | w ˜ E | | C i , h n C i , h n 1 τ n Δ C i , h n + z i · ( C i , h n ψ n ) | | L 2 ( w ˜ E ) sup v Y ˜ h , v * , K = 1 | ( F ˜ ( u h n ) , v ) | ,
where h K | w ˜ E represents the maximal diameter of K in w ˜ E . Inequalities (19) and (23) are applied for showing the first and second inequalities, respectively. Inequality (21) is used to obtain the fourth inequality.
Denote r = b E , μ ϵ [ ψ h n · n E ] , with the constant μ to be determined later. Based on the Green formulation and Lemma 5, then
E ( ϵ [ ψ h n · n E ] ) r d s = w ˜ E ϵ ψ h n · r d x = w ˜ E ϵ ψ h n · r d x K w ˜ E K ( i = 1 2 z i C i , h n + F f , n ) r d x + K w ˜ E K ( i = 1 2 z i C i , h n + F f , n ) r d x ) = w ˜ E ϵ ψ h n · r d x K w ˜ E K ( i = 1 2 z i C i , h n + F f , n ) r d x + K w ˜ E K ( i = 1 2 z i C i , h n + F f , n ) r d x + w ˜ E i = 1 2 z i C i n d x + w ˜ E F f , n r d x w ˜ E ϵ ψ n · r d x = w ˜ E ϵ ( ψ h n ψ n ) · r d x + w ˜ E i = 1 2 z i ( C i n C i , h n ) r d x K w ˜ E K ( i = 1 2 z i C i , h n + F f , n ) r d x ϵ 1 / 2 ( ψ h n ψ n ) L 2 ( w ˜ E ) ϵ 1 / 2 r L 2 ( w ˜ E ) + ( i = 1 2 | z i | C i n C i , h n L 2 ( w ˜ E ) + K w ˜ E i = 1 2 z i C i , h n + F f , n L 2 ( K ) ) r L 2 ( w ˜ E ) i = 1 2 ( ϵ 1 / 2 ( ψ h n ψ n ) L 2 ( w ˜ E ) ϵ 1 / 2 μ i 1 / 2 h E 1 / 2 ϵ [ ψ h n · n E ] L 2 ( E ) + ( i = 1 2 | z i | C i n C i , h n L 2 ( w ˜ E ) + K w ˜ E i = 1 2 z i C i , h n + F f , n L 2 ( K ) μ i 1 / 2 h E 1 / 2 ϵ [ ψ h n · n E ] L 2 ( E ) ) .
Choosing μ i = ϵ 1 / 2 h E 1 α E < 1 , it reads
ϵ 1 / 4 α E 1 / 2 ϵ [ ψ h n · n E ] L 2 ( E ) u n u h n ϵ , w ˜ E + ε K .
In summary,
η T sup v Y ˜ h , v * , K = 1 | ( F ˜ ( u h n ) , v ) | + u n u h n ϵ , K + ε K ,
and
η E sup v Y ˜ h , v * , w ˜ E = 1 | ( F ˜ ( u h n ) , v ) | + u n u h n ϵ , w ˜ E + ε w ˜ E .
For the first term on the right side of inequalities (39) and (40),
sup v Y ˜ h | K , v * , K = 1 | ( F ˜ ( u h n ) , v ) K | sup v Y ˜ h | K , v * , K = 1 | ( F ( u h n ) , v ) K | + sup v Y ˜ h | K , v * , K = 1 | ( F ( u h n ) F ˜ ( u h n ) , v ) K | ,
with Theorem 4 and
sup v Y ˜ h | K , v * , K = 1 | ( F ( u h n ) F ˜ ( u h n ) , v ) | = sup v Y ˜ h | K , v * , K = 1 | K ( F f F K f , n ) v 3 d x | sup v Y ˜ h | K , v * , K = 1 h K ( F f F K f , n L 2 ( K ) v 3 1 , K ) ρ K ,
we have
η K M 5 ( u n u h n * , K + ε K + ρ K ) .
Analogously, we can obtain inequality (36). □
Remark 2.
According to Theorem 3, Remark 1, and the numerical integration formula, at a fixed time t n , we can have the conclusion that
u n u h n ϵ , Ω ( η s p a c e n + η t i m e n ) ,
and
u n u h n * , Ω ( η s p a c e n + η t i m e n ) .
Recalling that robust means that the estimators yield upper and lower bounds on the error such that the ratio of the upper and lower bounds is bounded from below and from above by constants which depend neither on any mesh size nor on the perturbation parameter [42], and combined with the conclusion in Theorem 5, we verify that our work ensures the robustness for the a posteriori estimates of space under the improved energy norm.
To finish the proof of the upper bound, we have to estimate the term η t i m e n . In our a posteriori error estimates, for fixed time-step τ n , we control the error between u h n and u n . A mature analytical method is presented in [17], and here, we give a brief proof.
Theorem 6.
Each η t i m e n defined in Lemma 2 satisfies the following upper bound
η t i m e n 6 ( u u h n L 2 ( t n 1 , t n ; Y ) + u u h , τ L 2 ( t n 1 , t n ; Y ) ) .
Proof. 
Equation (8) gives for t [ t n 1 , t n ] ,
u h n u h , τ = t n t τ n ( u h n u h n 1 ) .
Then, we have
| t n t τ n | | u h n u h n 1 | 1 , Ω | u u h n | 1 , Ω + | u u h , τ | 1 , Ω .
Furthermore, we obtain the bound
| t n t τ n | 2 u h n u h n 1 Y 2 2 ( u u h n Y 2 + | u u h , τ | Y 2 ) .
We integrate between t n 1 and t n , and obtain
( η t i m e n ) 2 6 ( u u h n L 2 ( t n 1 , t n ; Y ) 2 + u u h , τ L 2 ( t n 1 , t n ; Y ) 2 ) 6 ( u u h n L 2 ( t n 1 , t n ; Y ) + u u h , τ L 2 ( t n 1 , t n ; Y ) ) 2 ,
and thus, Theorem 5 is proved. □

4. Adaptive Algorithm and Numerical Experiments

In this section, we provide one possible implementation of the adaptive algorithm for PNP equations and give numerical experiments to validate the algorithm.
Considering the algorithm for time-step size control, the time discretization error is equally distributed to each time interval ( t n 1 , t n ) , n = 1 , , N . Let T o l t i m e be the total tolerance to the time discretization, then
n = 1 N ( τ n ( η t i m e n ) 2 + τ n ε 2 ) T o l t i m e .
With T o l t i m e = n = 1 N τ n T o l t i m e T , a natural way to achieve inequality (41) is to adjust the time step size τ n such that the following relations are satisfied
( η t i m e n ) 2 T o l t i m e 2 T and ε 2 T o l t i m e 2 T .
Let T o l s p a c e be the tolerance allowed for the space discretization. The usual stopping criterion for the mesh adaption is to satisfy
n = 1 N ( τ n ( η s p a c e n ) 2 ) T o l s p a c e .
With T o l s p a c e = n = 1 N τ n T o l s p a c e T , the relation in inequality (43) converts into
( η s p a c e n ) 2 T o l s p a c e T .
A natural way to achieve adaptive algorithm for time-dependent PNP equations is to adjust the time step size and T h , satisfying Equations (42) and (44). The method also appears in [12].
At each time step, the well-known cycle of the adaptive method for the space is “SOLVEESTIMATEMARKREFINE”. The difficulty in solving time-dependent PNP equations lies in how to deal with the nonlinear term. We choose Picard’s linearization in [44] for the nonlinear term in system (3). It is important to mention that the equations with ϵ < 1 lead to systems that are potentially convection dominated, which leads to potential algorithmic difficulties in solving the system. Here, we use the edge-averaged finite element (EAFE) scheme in [45]. The method has been discussed in [33,46] for PNP equations. Algorithm 1 provides one possible implementation of time and space adaptivity for the time-dependent PNP equations at each time step referred to in [10,12,31].
Some numerical experiments are presented to verify the viability and efficiency of the a posteriori estimations. For these experiments, we use the following model to verify our theory.
To find C i L 2 ( 0 , T ; H 0 1 ( Ω ) ) , i = 1 , 2 ; ψ L 2 ( 0 , T ; H 0 1 ( Ω ) ) such that
( C i t , v i ) + ( C i , v i ) + ( z i C i ψ , v i ) = ( f i , v ) , v i H 0 1 ( Ω ) , i = 1 , 2 ( ϵ ψ , v 3 ) i = 1 2 ( q i C i , v 3 ) = ( f 3 , v 3 ) , v 3 H 0 1 ( Ω )
where z 1 = 1 and z 2 = 1 .
Compared with the previous system (3), the system (45) has the right end term f i , i = 1 , 2 and the boundary condition becomes a homogeneous Dirichlet condition. Because the homogeneous Dirichlet condition is a special case of the boundary condition (2), the analysis in our previous sections can be adapted to the system (45). According to the analysis of Theorem 2, the forms of ε K and η K change as
ε K 2 : = h K 2 i = 1 2 | | f i f K , i | | L 2 ( K ) 2 + α K 2 | | f 3 f K , 3 | | L 2 ( K ) 2 ,
where f K , i n = K f i ( x , t n ) d x / | K | and
η K 2 : = h K 2 i = 1 2 C i , h n C i , h n 1 τ n Δ C i , h n + z i · ( C i , h n ψ n ) f K , i n L 2 ( K ) 2 + α K 2 i = 1 2 z i C i , h n f K , 3 n L 2 ( K ) 2 .
The first experiment presented here is designed to verify the adaptive effect in the time step adjustment due to the time singular point, and the time and space parallel adaptive adjustment with the flow structure changing caused by time. The second numerical experiment verifies the problem with the boundary layer effect. All experiments are in two dimensions, and simulations are performed with the software MATLAB 7.0 based on an integrated finite element method package iFEM.
Algorithm 1 Time and space adaptive algorithm.
  • Prescribe deadline T, tolerances T o l t i m e and T o l s p a c e , maximum number of space division cycles M a x I t , maximum number of mesh points in space division M a x N , cycles parameters δ 1 > 1 , δ 2 ( 0 , 1 ) , δ 3 ( 0 , 1 ) and θ t i m e ( 0 , 1 ) . Let u h n 1 be computed from the previous time step at time t n 1 with the mesh T h n 1 and the time-step size τ .
  • Step 1: Initialization
  •      T h n : = T h n 1 , τ n : = τ , t n : = t n 1 + τ n ,
  •      Solve u h n with the mesh T h n where let ( C 1 , h n , 0 , C 2 , h n , 0 , ϕ h n , 0 ) = u h n 1 , and compute time error estimator.
  • Step 2: The current time step is too small
  •      While  max ( ( η t i m e n ) 2 , ε 2 ) θ t i m e T o l t i m e / ( 2 T )  do
  •         τ n : = δ 1 τ n ;
  •         t n : = t n 1 + τ n ;
  •         Solve u h n similar with Step 1 and compute time error estimator;
  •      End while.
  • Step 3: Time iteration with smaller time step
  •      While  ( η t i m e n ) 2 < T o l t i m e / ( 2 T ) or ε 2 < T o l t i m e / ( 2 T )  do
  •         If  τ n = τ , which means the iteration dose not go through Step2,
  •             τ n : = δ 2 τ n ;
  •         Else
  •             τ n : = δ 3 τ n ;
  •         End If
  •             t n : = t n 1 + τ n ;
  •             Solve u h n similar with Step 1 and compute time error estimator;
  •      End while.
  • Step 4: Adaptive method for the space
  •      While  ( η s p a c e n ) 2 T o l s p a c e T and the number of space division cycles ≤ M a x I t  do
  •         MARK: The maximum marking strategy [47] is utilized to remark the grid.
  •         REFINE: The latest vertex bisection method [48] is used to refine the marked grid.
  •                    Simultaneously, the new grid T h n is created.
  •         SOLVE: Solve u h n , u h n 1 with the mesh T h n .
  •         ESTIMATE: Compute the a posterior error estimator ( η s p a c e n ) 2 .
  •         If  ( I N O F > M a x N ) , where I N O F is the number of mesh points.
  •             break;
  •         End if,
  •      End while.
  • Step 5: Time marching
  •      Stop if t n = T , otherwise, set n + 1 n and go to Step 1.
Example 1
([12]). Considering the case with ϵ = 1 in system (45), we take
β ( t ) = 0.03 ( 1 e ( 10000 ( t 0.5 ) 2 ) ) ,
and
C 1 = β ( t ) e ( ( ( x t + 0.5 ) 2 + ( y t + 0.5 ) 2 ) / 0.1 ) , C 2 = β ( t ) e ( ( ( x t + 0.5 ) 2 + ( y t + 0.5 ) 2 ) / 0.4 ) , ψ = β ( t ) e ( ( ( x t + 0.5 ) 2 + ( y t + 0.5 ) 2 ) / 0.6 ) ,
as an exact solution of system (45) in the domain Ω = ( 1 , 1 ) × ( 1 , 1 ) with homogeneous Dirichlet boundary conditions. Consequently, functions f 1 , f 2 and f 3 on the RHS are determined by the exact solution.
For Algorithm 1, we choose T = 1 , δ 1 = 2 , δ 2 = 0.5 , δ 3 = 0.75 , θ t i m e = 0.5 in Example 1 and give some specific cases of time-step adaptation. Firstly, we constrain the time step to be extended only once when the time step is too small at each time step. Figure 1 shows the number of nodes and the time step size at each time step n with τ = 0.0025 , 0.01 , respectively, when T o l s p a c e = 0.0025 and T o l t i m e = 0.01 . We note that the time step size drops in a small time interval around t = 0.5 and is constant in the rest of the interval. It is not a surprise, as β ( t ) changes exponentially from 0.03 to 0 and then from 0 to 0.03 around t = 0.5 . The ratio of the maximum time step size to the minimum is 0.02 / 0.00125 = 16 when τ = 0.01 . That means the efficiency of the adaptation can increase by an order of magnitude. Then, Figure 2 shows the number of nodes of T h n at each time step when T o l s p a c e = 0.0025 , T o l t i m e = 0.01 , M a x I t = 15 and τ = 0.0025 without the constrains on the number of time extensions.
In Figure 3, the surface plots of discrete solutions C 1 and the corresponding meshes at t = 0.0825 , 0.5169 , 0.9369 are displayed. It clearly indicates the ability of Algorithm 1 to capture the singularity of the solutions by locally refining and coarsening the meshes, and to realize the adaptive adjustments of time steps and mesh sizes simultaneously.
In summary, Figure 1 shows the adaptive effect in time step adjustment due to the time singular point. The time and space parallel adaptive adjustments with the flow structure are verified in Figure 2 and Figure 3. The numerical results mean Algorithm 1 can realize adaptive adjustments of the time steps and mesh sizes simultaneously.
Example 2
([31]). Considering the boundary layer changing with time, we take
C 1 = C 2 = e x t / ε + e y t / ε , ψ = e 3 x t / ε + e 3 y t / ε ,
to be the exact solution to system (45) on Ω = ( 0 , 1 ) × ( 0 , 1 ) . Correspondingly, the right-hand side functions f 1 , f 2 , and f 3 are determined by the above exact solution.
Here, we focus on the adaptivity in the space and choose uniform time refined with τ n = 0.01 , T = 1 in Example 2, and Figure 4 shows that the boundary layer is perfectly captured, and the mesh adaptation is realized. The first two lines in Figure 4 show the surface plots of discrete solutions ψ (right) and the corresponding meshes (left) at t = 0.16 , 0.96 (from top to bottom) for ϵ = 10 4 . As time goes on, we observe more grids near the original point than other parts of the boundary when degrees of freedom are close to each other. Furthermore, in order to observe the boundary layer with the decrease of ϵ at the same time, we give the surface plots of discrete solutions ψ (top right) and the corresponding meshes (top left) at t = 0.96 for ϵ = 10 1 in the third line of Figure 4. The adaptivity can be demonstrated as more condensed grids near the boundaries as ϵ decreases. For the case with t = 0.96 , ϵ = 10 4 , the mesh refinements are well observed in the boundary, i.e., x = 0 and y = 0 , as the number of meshes is increased to be large enough. The corresponding surface plots of discrete solutions ψ (bottom right) and the corresponding meshes (bottom left) are shown in the last line of Figure 4.

5. Conclusions

In this paper, the a posteriori error estimation is adopted for the adaptive analysis of time-dependent PNP equations, where the nonlinearity and strong coupling are focused. During the theoretical study of the a posteriori error estimation, we establish two types of computable error estimators which bound the time and space error, respectively. The estimates for the upper bounds of the time and space estimator are derived, respectively, so as to demonstrate the efficiency and reliability of the error estimator. In particular, the a posterior error estimate in space is robust under the improved energy norm. The adaptive algorithm is constructed based on the estimates and realizes the parallel adaptivity of time steps and mesh refinements. Numerical experiments show the phenomenon of adaptive time step and mesh size adjustments due to the time singular point and the flow structure with time, and successfully capture boundary layers arbitrarily changing with the flow of time. Although our work can solve the boundary layer problem well, it is still valuable to find a method with lower computational complexity. In the future, we plan to explore various a posterior error estimation methods and seek more effective methods to solve such problems through comparative analysis. We will use different control algorithms to achieve adaptive time steps, and extend the theoretical analysis to anisotropic meshes, which are more efficient for real physical problems.

Author Contributions

Conceptualization, K.F. and T.H.; methodology, K.F. and T.H.; software, K.F. and T.H.; validation, K.F. and T.H.; formal analysis, K.F. and T.H.; investigation, K.F. and T.H.; resources, T.H.; data curation, K.F. and T.H.; writing—original draft preparation, K.F. and T.H.; writing—review and editing, K.F. and T.H.; project administration, T.H.; funding acquisition, T.H. All authors have read and agreed to the published version of the manuscript.

Funding

This work was funded by the National Natural Science Foundation of China (No. 12301467), and Applied Basic Research Project of Changzhou Science and Technology Bureau (No. CJ20235027).

Data Availability Statement

The data presented in this study are available on request from the corresponding author.

Conflicts of Interest

The authors declare no conflicts of interest.

Appendix A. Proof of Solution Existence and Uniqueness

To find ϕ = ( ϕ 1 , ϕ 2 , ϕ 3 ) L 2 ( 0 , T ; [ H 0 1 ( Ω ) ] 3 ) , R = ( R 1 , R 2 , R 3 ) L 2 ( 0 , T ; [ L 2 ( Ω ) ] 3 ) , such that v Y ,
i = 1 2 ( ( ϕ i t , v i ) + ( ϕ i , v i ) + z i ( C i ϕ 3 , v i ) + z i ( ϕ i ψ , v i ) ) = i = 1 2 ( R i , v i ) ( ϵ ϕ 3 , v 3 ) i = 1 2 z i ( ϕ i , v 3 ) = ( R 3 , v 3 )
where u = ( C 1 , C 2 , ψ ) satisfies Equation (6)
Proof. 
Solution Uniqueness:
Let u u = ( ϕ 1 , ϕ 2 ) L 2 ( 0 , T ; [ H 0 1 ( Ω ) ] 2 ) be fixed. Then, there exists a unique ϕ 3 L 2 ( 0 , T ; H 0 1 ( Ω ) ) such that
( ϵ ϕ 3 , v 3 ) i = 1 2 z i ( ϕ i , v 3 ) = ( R 3 , v 3 ) .
(This follows from the standard results on elliptic equations, e.g., see [43])
We define A u u : L 2 ( 0 , T ; [ H 0 1 ( Ω ) ] 2 ) L 2 ( 0 , T ; [ L 2 ( Ω ) ] 2 ) by h [ H 1 ( Ω ) ] 2 ,
( A u u w , h ) : = i = 1 2 ( ( w i , h i ) + z i ( C i ϕ 3 , h i ) + z i ( ϕ i ψ , h i ) ) ,
where w = ( w 1 , w 2 ) .
For the initial value problem,
i = 1 2 ( w i t , h i ) + ( A u u w , h ) = i = 1 2 ( R i , h i ) , h [ H 1 ( Ω ) ] 2 ,
where w ( 0 ) = ( ϕ 1 ( x , 0 ) , ϕ 2 ( x , 0 ) ) , w L 2 ( 0 , T ; [ H 0 1 ( Ω ) ] 2 ) . It is uniquely solvable (this follows from the standard results on evolution equations; see [36]). The mapping from L 2 ( 0 , T ; [ H 0 1 ( Ω ) ] 2 ) into itself assigning to u u and w will be denoted by Q. We shall prove that Q has a fixed point. From (A3), it follows by means of the test function w ,
i = 1 2 ( 1 2 d d t w i L 2 ( Ω ) 2 + | w i | 1 , Ω 2 ) i = 1 2 ( 1 2 ( R i L 2 ( Ω ) 2 + w i L 2 ( Ω ) 2 ) + 1 2 | w i | 1 , Ω 2 + z i C i ϕ 3 L 2 ( Ω ) 2 + z i ϕ i ψ L 2 ( Ω ) 2 ) i = 1 2 ( 1 2 ( R i L 2 ( Ω ) 2 + w i L 2 ( Ω ) 2 ) + 1 2 | w i | 1 , Ω 2 + C ¯ 1 ϕ 3 L 2 ( Ω ) 2 + C ¯ 2 ϕ i L 2 ( Ω ) 2 ) i = 1 2 ( 1 2 ( R i L 2 ( Ω ) 2 + w i L 2 ( Ω ) 2 ) + 1 2 | w i | 1 , Ω 2 + C ¯ 3 ( i = 1 2 ϕ i L 2 ( Ω ) 2 + R 3 L 2 ( Ω ) 2 ) + C ¯ 2 ϕ i L 2 ( Ω ) 2 ) ,
then,
i = 1 2 ( 1 2 d d t w i L 2 ( Ω ) 2 + 1 2 | w i | 1 , Ω 2 ) i = 1 2 ( 1 2 ( R i L 2 ( Ω ) 2 + w i L 2 ( Ω ) 2 ) + C ¯ 3 ( i = 1 2 ϕ i L 2 ( Ω ) 2 + R 3 L 2 ( Ω ) 2 ) + C ¯ 2 ϕ i L 2 ( Ω ) 2 ) i = 1 2 C ¯ 4 ( 1 + w i L 2 ( Ω ) 2 + ϕ i L 2 ( Ω ) 2 ) ,
and m > 0 ,
i = 1 2 ( w i L 2 ( Ω ) 2 ) i = 1 2 ( C ¯ 4 0 t ( 1 + w i L 2 ( Ω ) 2 + ϕ i L 2 ( Ω ) 2 ) d s + ϕ i ( x , 0 ) L 2 ( Ω ) 2 ) i = 1 2 C ¯ 5 ( 1 + t + 0 t ( w i L 2 ( Ω ) 2 + ϕ i L 2 ( Ω ) 2 ) d s ) ) i = 1 2 C ¯ 5 ( e t + 0 t ( w i L 2 ( Ω ) 2 + ϕ i L 2 ( Ω ) 2 ) d s ) ) i = 1 2 C ¯ 5 ( e t + sup s [ 0 , T ] { ( w i ( s ) L 2 ( Ω ) 2 + ϕ i ( s ) L 2 ( Ω ) 2 ) e m t } 1 m ( e m t 1 ) ) ,
and thus,
i = 1 2 ( e m t w i L 2 ( Ω ) 2 ) i = 1 2 C ¯ 6 ( e ( 1 m ) t + sup s [ 0 , T ] { ( ϕ i ( s ) L 2 ( Ω ) 2 ) e m t } 1 m ( 1 e m t ) ) .
When choosing m max { 1 , 6 C ¯ 6 } , we have
i = 1 2 ( e m t w i L 2 ( Ω ) 2 ) i = 1 2 ( 6 C ¯ 6 2 + 1 2 sup s [ 0 , T ] { ( ϕ i ( s ) L 2 ( Ω ) 2 ) e m t } .
This proves that Q ( B ) B , if
B : = θ L 2 ( 0 , T ; [ H 0 1 ( Ω ) ] 2 ) : sup s [ 0 , T ] { e m t θ i ( s ) L 2 ( Ω ) 2 } 6 C ¯ 6 , i = 1 , 2 .
The preceding estimates along with (A3) show that
sup w B Q ( u u ) L 2 ( 0 , T ; H 0 1 ( Ω ) ) + d d t Q ( u u ) L 2 ( 0 , T ; L 2 ( Ω ) ) <
Consequently, Q maps a bounded set in L 2 ( 0 , T ; [ H 0 1 ( Ω ) ] 2 ) into a bounded set in L 2 ( 0 , T ; [ H 0 1 ( Ω ) ] 2 ) which is compactly embedded in L 2 ( 0 , T ; [ L 2 ( Ω ) ] 2 ) .
Using similar arguments to those used before,
i = 1 2 ( δ w i L 2 ( Ω ) 2 ) i = 1 2 C ¯ 7 sup s [ 0 , T ] { ( δ ϕ i ( s ) L 2 ( Ω ) 2 ) e m s } ,
where δ ϕ i : = ϕ ^ i ϕ ˜ i represents the difference between any two elements ϕ ^ i , ϕ ˜ i in B, and δ w i = Q ( ϕ ^ i ) Q ( ϕ ˜ i ) .
Therefore, Schauder’s Fixed Point Theorem yields the existence of a fixed point of Q.
Solution Uniqueness:
Assuming both ϕ = ( ϕ 1 , ϕ 2 , ϕ 3 ) and ϕ = ( ϕ 1 , ϕ 2 , ϕ 3 ) satisfy (A1), we prove ϕ 1 ϕ 1 and ϕ 2 ϕ 2 as following, and thus ϕ 3 ϕ 3 . We define Φ 1 = ϕ 1 ϕ 1 , Φ 2 = ϕ 2 ϕ 2 , Φ 3 = ϕ 3 ϕ 3 , then have
( Φ 1 t , Φ 1 ) + ( Φ 2 t , Φ 2 ) + ( Φ 1 , Φ 1 ) + ( Φ 2 , Φ 2 ) = ( q 1 ( Φ 1 ψ , Φ 1 ) + q 2 ( Φ 2 ψ , Φ 2 ) + ( Φ 3 , q 1 C 1 Φ 1 + q 2 C 2 Φ 2 ) ) . i = 1 2 | z i | | Φ i | 1 , Ω 2 + C 8 | Φ 3 | 1 , Ω 2 + C 9 ( Φ 1 L 2 ( Ω ) 2 + Φ 2 L 2 ( Ω ) 2 ) . i = 1 2 | z i | | Φ i | 1 , Ω 2 + C 10 ( Φ 1 L 2 ( Ω ) 2 + Φ 2 L 2 ( Ω ) 2 ) ,
where C 10 are related to C i , i = 1 , 2 and ψ .
When max { z i , i = 1 , 2 } 1 ,
Φ 1 L 2 ( Ω ) 2 + Φ 2 L 2 ( Ω ) 2 2 C 10 0 t ( Φ 1 L 2 ( Ω ) 2 + Φ 2 L 2 ( Ω ) 2 ) d s ,
Gronwall’s Lemma completes the proof (when u ( t ) α + a t β ( s ) u ( s ) d s , then u ( t ) α e x p ( a t β ( s ) d s ) , t I ). □

References

  1. Liu, X.; Zhang, L.; Zhang, M. Studies on Ionic flows via Poisson–Nernst–Planck systems with Bikerman’s local Hard-Sphere potentials under relaxed neutral boundary conditions. Mathematics 2024, 12, 1182. [Google Scholar] [CrossRef]
  2. Zhang, Q.; Wang, Q.; Zhang, L.; Lu, B. A class of finite element methods with averaging techniques for solving the three-dimensional drift-diffusion model in semiconductor device simulations. J. Comput. Phys. 2022, 458, 111086. [Google Scholar] [CrossRef]
  3. Jasielec, J.J. Electrodiffusion phenomena in neuroscience and the Nernst–Planck–Poisson equations. Electrochem 2021, 2, 197–215. [Google Scholar] [CrossRef]
  4. Gajewski, H.; Groger, K. On the basic equations for carrier transport in semiconductors. J. Math. Anal. Appl. 1986, 113, 12–35. [Google Scholar] [CrossRef]
  5. Jerome, J.W. Consistency of semiconductor modeling: An existence/stability analysis for the stationary van Roosbroeck system. SIAM J. Appl. Math. 1985, 45, 565–590. [Google Scholar] [CrossRef]
  6. Biler, P.; Hebisch, W.; Nadzieja, T. The Debye system: Existence and large time behavior of solutions. Nonlinear Anal. Theory Methods Appl. 1994, 23, 1189–1209. [Google Scholar] [CrossRef]
  7. Jerome, J.W.; Kerkhoven, T. A finite element approximation theory for the drift diffusion semiconductor model. SIAM J. Numer. Anal. 1991, 28, 403–422. [Google Scholar] [CrossRef]
  8. Mathur, S.R.; Murthy, J.Y. A multigrid method for the Poisson Nernst Planck equations. Int. J. Heat Mass Transf. 2009, 52, 4031–4039. [Google Scholar] [CrossRef]
  9. Gao, H.; Sun, P. A linearized local conservative mixed finite element method for Poisson Nernst Planck equations. J. Sci. Comput. 2018, 77, 793–817. [Google Scholar] [CrossRef]
  10. Picasso, M. Adaptive finite elements for a linear parabolic problem. Comput. Methods Appl. Mech. Eng. 1998, 167, 223–237. [Google Scholar] [CrossRef]
  11. Verfürth, R. A posteriori error estimates for finite element discretizations of the heat equation. Calcolo 2003, 40, 195–212. [Google Scholar] [CrossRef]
  12. Chen, Z.; Feng, J. An adaptive finite element algorithm with reliable and efficient error control for linear parabolic problems. Math. Comput. 2004, 73, 1167–1193. [Google Scholar] [CrossRef]
  13. Chami, F.E.; Sayah, T. A posteriori error estimators for the fully discrete time dependent Stokes problem with some different boundary conditions. Calcolo 2010, 47, 169–192. [Google Scholar] [CrossRef]
  14. Bergam, A.; Bernardi, C.; Mghazli, Z. A posteriori analysis of the finite element discretization of some parabolic equations. Math. Comput. 2005, 74, 1117–1138. [Google Scholar] [CrossRef]
  15. Bernardi, C.; Verfürth, R. A posteriori error analysis of the fully discretized time-dependent Stokes equations. ESIAM Math. Model. Numer. Anal. 2004, 38, 437–455. [Google Scholar] [CrossRef]
  16. Bernardi, C.; Sayah, T. A posteriori error analysis of the time dependent Stokes equations with mixed boundary conditions. IMA J. Numer. Anal. 2014, 35, 179–198. [Google Scholar] [CrossRef]
  17. Bernardi, C.; Sayah, T. A posteriori error analysis of the time dependent Navier-Stokes equations with mixed boundary conditions. Sema J. 2015, 69, 1–23. [Google Scholar] [CrossRef]
  18. Lakkis, O.; Makridakis, C. Elliptic reconstruction and a posteriori error estimates for fully discrete linear parabolic problems. Math. Comput. 2006, 75, 1627–1658. [Google Scholar] [CrossRef]
  19. Makridakis, C.; Nochetto, R.H. Elliptic reconstruction and a posteriori error estimates for parabolic problems. SIAM J. Numer. Anal. 2003, 41, 1585–1594. [Google Scholar] [CrossRef]
  20. Akrivis, G.; Makridakis, C.; Nochetto, R.H. A posteriori error estimates for the Crank-Nicolson method for parabolic equations. Math. Comput. 2006, 75, 511–531. [Google Scholar] [CrossRef]
  21. Akrivis, G.; Makridakis, C.; Nochetto, R.H. Optimal order a posteriori error estimates for a class of Runge-Kutta and Galerkin methods. Numer. Math. 2009, 114, 133–160. [Google Scholar] [CrossRef]
  22. Bnsch, E.; Karakatsani, F.; Makridakis, C.G. A posteriori error estimates for fully discrete schemes for the time dependent Stokes problem. Calcolo 2018, 55, 19. [Google Scholar] [CrossRef]
  23. Moore, P.K. A posteriori error estimation with finite element semi- and fully discrete methods for nonlinear parabolic equations in one space dimension. SIAM J. Numer. Anal. 1994, 31, 149–169. [Google Scholar] [CrossRef]
  24. Eriksson, K.; Johnson, C. Adaptive finite element methods for parabolic problems IV: Nonlinear problems. SIAM J. Numer. Anal. 1995, 32, 1729–1749. [Google Scholar] [CrossRef]
  25. Verfürth, R. A posteriori error estimates for nonlinear problems: Lr (O, T; W1,ρ (Ω) -error estimates for finite element discretizations of parabolic equations. Math. Comput. 1998, 67, 1335–1360. [Google Scholar] [CrossRef]
  26. Verfürth, R. A posteriori error estimates for nonlinear problems: Finite element discretizations of elliptic equations. Math. Comput. 1994, 62, 445. [Google Scholar] [CrossRef]
  27. Babuška, I.; Feistauer, M.; Śolin, P. On one approach to a posteriori error estimates for evolution problems solved by the method of lines. Numer. Math. 2001, 89, 225–256. [Google Scholar] [CrossRef]
  28. Pousin, J.; Rappaz, J. Consistency, stability, a priori and a posteriori errors for Petrov-Galerkin methods applied to nonlinear problems. Numer. Math. 1994, 69, 213–231. [Google Scholar] [CrossRef]
  29. Ainsworth, M.; Babuška, I. Reliable and robust a posteriori error estimation for singularly perturbed reaction-diffusion problems. SIAM J. Numer. Anal. 1999, 36, 331–353. [Google Scholar] [CrossRef]
  30. Zhang, B.; Chen, S.; Zhao, J. Guaranteed a posteriori error estimates for nonconforming finite element approximations to a singularly perturbed reaction-diffusion problem. Appl. Numer. Math. 2015, 94, 1–15. [Google Scholar] [CrossRef]
  31. Hao, T.; Ma, M.; Xu, X. Adaptive finite element approximation for steady-state Poisson-Nernst-Planck equations. Adv. Comput. Math. 2022, 48, 49. [Google Scholar] [CrossRef]
  32. Verfürth, R. Robust a posteriori error estimates for nonstationary convection-diffusion equations. SIAM J. Numer. Anal. 2005, 43, 1783–1802. [Google Scholar] [CrossRef]
  33. Metti, M.S.; Xu, J.; Liu, C. Energetically stable discretizations for charge transport and electrokinetic models. J. Comput. Phys. 2016, 306, 1–18. [Google Scholar] [CrossRef]
  34. Brenner, S.C.; Scott, L.R. The Mathematical Theory of Finite Element Methods; Springer: Berlin/Heidelberg, Germany, 1998. [Google Scholar]
  35. Prohl, A.; Schmuck, M. Convergent discretizations for the Nernst-Planck-Poisson system. Numer. Math. 2009, 111, 591–630. [Google Scholar] [CrossRef]
  36. Evans, L.C. Partial Differential Equations, 2nd ed.; American Mathematical Society: Providence, RI, USA, 2010. [Google Scholar]
  37. Verfürth, R. A posteriori error analysis of space-time finite element discretizations of the time-dependent Stokes equations. Calcolo 2010, 47, 149–167. [Google Scholar] [CrossRef]
  38. Zeidler, E. Nonlinear Functional Analysis and Its Applications; Springer: Berlin/Heidelberg, Germany, 1988. [Google Scholar]
  39. Ciarlet, P. The Finite Element Method for Elliptic Problems; North-Holland Publishing Company: Amsterdam, The Netherlands, 1978. [Google Scholar]
  40. Ainsworth, M.; Oden, J.T. A Posteriori Error Estimation in Finite Element Analysis; John Wiley & Sons: New York, NY, USA, 2000. [Google Scholar]
  41. Morin, P.; Nochetto, R.H.; Siebert, K.G. Data oscillation and convergence of adaptive FEM. SIAM J. Numer. Anal. 2001, 38, 466–488. [Google Scholar] [CrossRef]
  42. Verfürth, R. Robust a posteriori error estimators for a singularly perturbed reaction-diffusion equation. Numer. Math. 1998, 78, 479–493. [Google Scholar] [CrossRef]
  43. Ciarlet, P.G. Basic error estimates for elliptic problems. Handb. Numer. Anal. 1991, 2, 17–351. [Google Scholar]
  44. Sun, Y.; Sun, P.; Zheng, B.; Lin, G. Error analysis of finite element method for Poisson Nernst Planck equations. J. Comput. Appl. Math. 2016, 301, 28–43. [Google Scholar] [CrossRef]
  45. Xu, J.; Zikatanov, L. A monotone finite element scheme for convection-diffusion equations. Math. Comput. 1999, 68, 1429–1446. [Google Scholar] [CrossRef]
  46. Bousquet, A.; Hu, X.; Metti, M.S.; Xu, J. Newton solvers for drift-diffusion and electrokinetic equations. SIAM J. Sci. Comput. 2018, 40, B982–B1006. [Google Scholar] [CrossRef]
  47. Bubuka, I.; Vogelius, M. Feedback and adaptive finite element solution of one-dimensional boundary value problems. Numer. Math. 1984, 44, 75–102. [Google Scholar] [CrossRef]
  48. Binev, P.; Dahmen, W.; Devore, R. Adaptive finite element methods with convergence rates. Numer. Math. 2004, 97, 219–268. [Google Scholar] [CrossRef]
Figure 1. The time step size τ n at each time step n with different initial step size τ 0 when T o l t i m e = 0.0002 and T o l s p a c e = 0.01 . The total numbers of the calculation time are N t i m e = 213 and N t i m e = 69 , respectively.
Figure 1. The time step size τ n at each time step n with different initial step size τ 0 when T o l t i m e = 0.0002 and T o l s p a c e = 0.01 . The total numbers of the calculation time are N t i m e = 213 and N t i m e = 69 , respectively.
Mathematics 12 02610 g001
Figure 2. The number of nodes of T h n at each time step when T o l s p a c e = 0.0025 , T o l t i m e = 0.01 , M a x I t = 15 and initial time step τ 0 = 0.0025 .
Figure 2. The number of nodes of T h n at each time step when T o l s p a c e = 0.0025 , T o l t i m e = 0.01 , M a x I t = 15 and initial time step τ 0 = 0.0025 .
Mathematics 12 02610 g002
Figure 3. Surface plots of discrete solutions C 1 (right) and the corresponding meshes (left) at t = 0.0825 , 0.5169 , 0.9369 (from top to bottom). The numbers of nodes of the meshes are 298 , 206 , 359 for t = 0.0825 , 0.5169 , 0.9369 , respectively.
Figure 3. Surface plots of discrete solutions C 1 (right) and the corresponding meshes (left) at t = 0.0825 , 0.5169 , 0.9369 (from top to bottom). The numbers of nodes of the meshes are 298 , 206 , 359 for t = 0.0825 , 0.5169 , 0.9369 , respectively.
Mathematics 12 02610 g003
Figure 4. For the first two lines, surface plots of discrete solutions ψ (right) and the corresponding meshes (left) at t = 0.16, 0.96 (from top to bottom) for ϵ = 10 4 . The numbers of the mesh nodes are 579, 568 for t = 0.16, 0.96, respectively. For the last two lines, the surface plots of discrete solutions ψ (right) and the corresponding meshes (left) at t = 0.96 for ϵ = 10 1 , 10 4 (from top to bottom). The numbers of the meshes nodes are 573, 11,398 for ϵ = 10 1 , 10 4 , respectively.
Figure 4. For the first two lines, surface plots of discrete solutions ψ (right) and the corresponding meshes (left) at t = 0.16, 0.96 (from top to bottom) for ϵ = 10 4 . The numbers of the mesh nodes are 579, 568 for t = 0.16, 0.96, respectively. For the last two lines, the surface plots of discrete solutions ψ (right) and the corresponding meshes (left) at t = 0.96 for ϵ = 10 1 , 10 4 (from top to bottom). The numbers of the meshes nodes are 573, 11,398 for ϵ = 10 1 , 10 4 , respectively.
Mathematics 12 02610 g004
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Fu, K.; Hao, T. Robust a Posteriori Error Estimates of Time-Dependent Poisson–Nernst–Planck Equations. Mathematics 2024, 12, 2610. https://doi.org/10.3390/math12172610

AMA Style

Fu K, Hao T. Robust a Posteriori Error Estimates of Time-Dependent Poisson–Nernst–Planck Equations. Mathematics. 2024; 12(17):2610. https://doi.org/10.3390/math12172610

Chicago/Turabian Style

Fu, Keli, and Tingting Hao. 2024. "Robust a Posteriori Error Estimates of Time-Dependent Poisson–Nernst–Planck Equations" Mathematics 12, no. 17: 2610. https://doi.org/10.3390/math12172610

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop