Abstract
A linearized Crank–Nicolson Galerkin finite element method with bilinear element for nonlinear Schrödinger equation is studied. By splitting the error into two parts which are called the temporal error and the spatial error, the unconditional superconvergence result is deduced. On one hand, the regularity for a time-discrete system is presented based on the proof of the temporal error. On the other hand, the classical Ritz projection is applied to get the spatial error with order \(O(h^2)\) in \(L^2\)-norm, which plays an important role in getting rid of the restriction of \(\tau \). Then the superclose estimates of order \(O(h^2+\tau ^2)\) in \(H^1\)-norm is arrived at based on the relationship between the Ritz projection and the interpolated operator. At the same time, global superconvergence property is arrived at by the interpolated postprocessing technique. At last, three numerical examples are provided to confirm the theoretical analysis. Here, h is the subdivision parameter and \(\tau \) is the time step.
Similar content being viewed by others
Avoid common mistakes on your manuscript.
1 Introduction
Consider the following nonlinear Schrödinger equation:
where \(X=(x, y)\), \(0<T<\infty \), and \(\Omega \subset \mathbb {R}^{2}\) is a rectangle with the boundary \(\partial \Omega \). i is the imaginary unit, \(u_0(X)\) is a known complex-valued function. Moreover, f(s) is a real-valued nonlinear function which is twicely continuously differentiable with respective to s.
The NLSE plays an important role in describing physical phenomena, such as optical pulses, plasma physics and water waves and so on. Different numerical methods for the NLSE have been investigated extensively. For example, [1] discussed an iterative modification of the linearized scheme and proved second-order error estimates by use of Newtons method to linearize the equations at each time level. Continuous Galerkin methods were employed in [2] and optimal order error estimates in \(L^{\infty }(L^2)\) and \(L^{\infty }(H^1)\), and the corresponding superconvergence results at the temporal nodes \(t^n\) were obtained. [3] and [4] studied the normal Galerkin method and introduced the semi-discrete scheme and fully-discrete schemes for NLSE, respectively and both derived the superclose and superconvergence results in \(H^1\)-norm. A meshless local boundary integral equation method and two-grid mixed finite element method were proposed to solve the unsteady Schrödinger equation in [5] and [6], respectively. [7] and [8] researched the discontinuous Galerkin method and get optimal order error estimates. Finite difference method were also considered extensively in [9,10,11,12].
In fact, studying a nonlinear physical system often involves the boundedness of \(U_h^n\) in \(L^\infty \)-norm or a stronger norm, where \(U_h^n\) is the numerical solution. The usual technique is employing the inverse inequality to deal with such issue, which will result in some time-step restrictions, such as \(\tau =o(h^{\frac{1}{4}})\) and \(\tau =O(h^2)/\tau =O(h)\) in [1] and [3], respectively. Moreover, such restrictions also arise in the studies on other nonlinear evolution equations, such as nonlinear hyperbolic equations [13, 14], nonlinear parabolic equation [15,16,17,18], nonlinear Sobolev problems [19, 20], Navier–Stokes equations [21, 22], and so on. Therefore, how to get rid of such restriction becomes a hot topic and for this issue, a lot of efforts have been devoted. For instance, a corresponding time-discrete system was introduced in [23] to split the error into two parts, the temporal error and the spatial error, and the spatial error was reduced to the unconditional boundedness of numerical solution in \(L^\infty \)-norm. Then the optimal \(L^2\) error estimate without any time-step restrictions for the NLSE was obtained. Subsequently, this so-called splitting technique was also applied to other equations [24,25,26,27,28,29,30]. Especially, [31] used different technique from the above studies to get the unconditional superclose for Sobolev equation with conforming mixed FEM.
Different from [3] and [23], we discuss the unconditional superconvergence estimate for (1.1) with bilinear element[32]. A time-discrete system with solution \(U^n\) is developed to split the error \(u^n-U_h^n\) into the temporal error \(u^n-U^n\) and the spatial error \(U^n-U_h^n\). On one hand, we obtain the temporal error \(\Vert u^n-U^n\Vert _2=O(\tau ^2)\), which is one order higher than that of [23]. Then the boundedness of \(\tilde{\partial }_{tt}U^n\), which plays an important role in the analysis of the spatial error, is arrived at. As it is shown in our paper, \(H^2\) error estimate of the temporal error is important for getting rid of the restriction of \(\tau \). In the existing literature, there have also been other related works of \(H^2\) error estimate for certain nonlinear PDEs, such as [32, 33]. On the other hand, we introduce the classical Ritz prjection operator \(R_h\) to get the unconditional result of \(\Vert R_hU^n-U_h^n\Vert _0\) with order \(O(h^2)\), which implies the unconditional boundedness of \(\Vert U_h^n\Vert _{0,\infty }\). Consequently, the superclose property of \(\Vert R_hU^n-U_h^n\Vert _1\) with order \(O(h^2+\tau ^2)\) is deduced on the basis of the above achievements. Furthermore, through the relationship between \(R_h\) and the corresponding interpolation operator \(I_h\), we get \(\Vert I_hu^n-U_h^n\Vert _1\) with order \(O(h^2+\tau ^2)\) unconditionally. At the same time, we derive the global superconvergence by using the postprocessing operator in [31]. At last, some numerical results also show the validity of the theoretical analysis.
Throughout this paper, we denote the natural inner product in \(L^{2}(\Omega )\) by \((\cdot ,\cdot )\) and the norm by \(\Vert \cdot \Vert _{0}\), and let \(H_{0}^{1}(\Omega )=\{v\in H^{1}(\Omega ):v|_{\partial \Omega }=0\}\). Further, we use the classical Sobolev spaces \(W^{m,p}(\Omega ), 1\le p\le \infty \), denoted by \(W^{m,p}\), with norm \(\Vert \cdot \Vert _{m,p}\). When \(p=2\), we simply write \(\Vert \cdot \Vert _{m,p}\) as \(\Vert \cdot \Vert _{m}\). Besides, we define the space \(L^p(a,b;Y)\) with the norm \(\Vert f\Vert _{L^p(a,b; Y)}=(\int _a^b\Vert f(\cdot ,t)\Vert _Y^pdt)^{\frac{1}{p}}\), and if \(p=\infty \), the integral is replaced by the essential supremum.
2 A Linearized Galerkin Approximation Scheme
Let \(\Omega \) be a rectangle in (x, y) plane with edges parallel to the coordinate axes, \(\Gamma _{h}\) be a quasiuniform partition of \(\Omega \) into rectangular \(\pi _h\). Denote \(h=\max \limits _{\pi _h\in \Gamma _h}{\mathrm {diam} \pi _h}\) the mesh size, \(V_{h}\) be the usual bilinear FE space, \(V_{h0}=\{v_h\in V_h, v_h|_{\partial \Omega }=0\}\). Let \(R_h: H_0^1\rightarrow V_{h0}\) be the associated Ritz projection operator on \(V_{h0}\) defined by
It follows from [17] that
and
Moreover, for \(u\in H^{3}(\Omega )\), we can found in [34] that
where \(I_h\) be the associated interpolated operator over \(V_{h0}\).
Let \(\{t_n:t_n=n\tau ;0\le n\le N\}\) be a uniform partition of [0, T] with the time step \(\tau =T/N\), \(t_{n-\frac{1}{2}}=\frac{1}{2}(t_n+t_{n-1})\) and \(\sigma ^n=\sigma (X,t_n)\). For a sequence of functions \(\{\sigma ^n\}_{n=0}^{N}\), we remark
With these notations, we develop the linearized Galerkin FEM to problem (1.1): seek \(U_h^n\in V_{h0}\), such that for \(n\ge 2\),
and we will analyze a predictor corrector method to determine \(U_h^1\):
followed by
where \(U_h^0=R_hu_0\). Obviously, only a linear system with certain constant coefficients need to be solved now.
3 Error Estimates for Time-Discrete System
In this section, we introduce the following time-discrete system:
When \(n=1\), we determine \(U^1\) by
and
where \(U^{1,0}|_{\partial \Omega }=0\). The above system can be viewed as a system of linear elliptic equations, and the existence and uniqueness of solution can be proved immediately. In what follows, we will set \(e^n=u^n-U^n (n=0,1,2,\ldots N)\), analyze \(\Vert u^n-U^n\Vert _i (i=0,1,2)\) and give the regularity result of \(U^n\).
Theorem 1
Let u and \(U^m (m=0,1,2,\ldots N)\) be the solutions of (1.1) and (3.1)–(3.3), respectively, \(u\in L^{2}(0,T;H^{3}(\Omega )), u_t\in L^{\infty }(0,T;H^{2}(\Omega )), u_{tt}\in L^{\infty }(0,T;H^{2}(\Omega ))\), then for \(m=1,\ldots , N,\) there exists \(\tau _0\) such that when \(\tau \le \tau _0\), we have
and
Proof
Setting \(K_0\triangleq 1+\max \limits _{1\le m\le N}(\Vert u^m\Vert _{0,\infty }+\Vert \tilde{\partial }_tu^m\Vert _{0,\infty })\). Then we begin to prove (3.4) and (3.5) by mathematical induction. When \(m=1\), we have the error equations by (1.1) and (3.2)–(3.3) as follows:
and
where \(S_1=\frac{u^{1}-u^{0}}{\tau }-u_t^{\frac{1}{2}}, S_2=\frac{\Delta u^{1}+\Delta u^{0}}{2}-\Delta u^{\frac{1}{2}}, S_3=f(|u^0|^2)\frac{u^{1}+u^{0}}{2}-f(|u^{\frac{1}{2}}|^2)u^{\frac{1}{2}}, S_4=f(|\frac{u^{1}+u^0}{2}|^2)\frac{u^{1}+u^{0}}{2}-f(|u^{\frac{1}{2}}|^2)u^{\frac{1}{2}}\) and \(P_1^1=f(|\frac{u^{1}+u^0}{2}|^2)\frac{u^{1}+u^0}{2}-f(|\frac{U^{1,0}+U^0}{2}|^2)\frac{U^{1}+U^0}{2}\). It is easy to see that \(\Vert S_1\Vert _0+\Vert S_2\Vert _0+\Vert S_4\Vert _0\le C\tau ^2,\Vert S_3\Vert _0\le C\tau \).
On one hand, multiplying (3.6) by \(\frac{e^{1,0}}{\tau }\), integrating it over \(\Omega \) and then we get
Taking the imaginary part of (3.8), it is easy to get
Then there exist \(\tau _1, C_1\), such that when \(\tau \le \tau _1\), we have
Again, multiplying (3.6) by \(\frac{\Delta e^{1,0}}{\tau }\) and integrating it over \(\Omega \) to yield
Noting
and
Then by taking the imaginary part and the real part of (3.11), and summing them together, we have
Since \(e^{1,0}\in H^2(\Omega )\cap H_0^1(\Omega )\), there exist \(\tau _2, C_2, C_3\), such that when \(\tau \le \tau _2\), we have
which implies
and
where \(\tau \le \tau _3\le 1/CC_2.\)
On the other hand, multiplying (3.7) by \(\frac{e^{1}}{\tau }\), integrating it over \(\Omega \) and then we get
By the help of (3.10) and (3.15), we get
Taking the imaginary part of (3.16), it is obvious to see that there exist \(\tau _4, C_4\), such that \(\tau \le \tau _4\), it follows that
Once more, multiplying (3.7) by \(\frac{\Delta e^{1}}{\tau }\), integrating it over \(\Omega \) and then we get
Similarly to the estimates of \(e^{1,0}\), we get
and
which implies
It is apparent to see that there exist \(\tau _5, C_5, C_6\), such that when \(\tau \le \tau _5\), we have
which leads to
and
where \(\tau \le \tau _6=1/CC_5\).
By mathematical induction, we assume that (3.4) and (3.5) hold for \(m\le n-1\). Then
where \(\tau \le \tau _7=1/CC_0\).
Now we prove (3.4) and (3.5) also hold for \(m=n\). To estimate \(e^n\), we subtract (3.1) from (1.1) to obtain
where \(R_1^n=i(\tilde{\partial }_tu^{n}-u_t^{n-\frac{1}{2}}), R_2^n=\Delta \tilde{u}^n-\Delta u^{n-\frac{1}{2}}, R_3^n=f(|\hat{u}^{n}|^2)\tilde{u}^n-f(|u^{n-\frac{1}{2}}|^2)u^{n-\frac{1}{2}}\) and \(P_1^n=f(|\hat{u}^{n}|^2)\tilde{u}^n- f(|\hat{U}^{n}|^2)\tilde{U}^n\). By Taylor’s expansion, we have
We multiply (3.24) by \(\tilde{\partial }_t\Delta e^n\) and integrate it over \(\Omega \) to get
Taking the real part, the left hand can be rewritten as
As to the right hand of (3.26), we need to transfer \(\tau \) from one part of the inner product to the other, for there is no term concerning with \(\tilde{\partial }_t\Delta e^n\) on the left hand. Define \(\hat{u}^{1}=\tilde{u}^1, \hat{U}^{1}=\tilde{U}^1\) and \(\hat{e}^{1}=\tilde{e}^1\), rewrite \((P_1^n,\tilde{\partial }_t\Delta e^n)\) by
Indeed, by the assumption of the mathematical induction, we have
Note that
where
We find that
which implies
Moreover
Allocating (3.29)–(3.31), we have
which leads to
Thus
Similar to (3.28), we rewrite \((R_1^n+R_2^n+R_3^n,\tilde{\partial }_t\Delta e^n)\) as
It is not difficult to check that
and
Note that
Therefore,
Allocating all the estimates above to get
Replacing n by i in (3.39), then summing it from 2 to n, it follows that
Since
together with (3.18) and (3.21), we have
In order to estimate \(\Vert \bar{\partial }_te^n\Vert _0\), we take difference between two time levels n and \(n-1\) of (3.24), and multiply it by \(\frac{1}{\tau }\) on both sides, then there holds
On the other hand, multiplying (3.43) by \(\tilde{\partial }_t\tilde{e}^n\), integrating it over \(\Omega \) and then it follows that
Then taking the impartial part of (3.44) and using (3.32), (3.35)–(3.37), it follows that
Replacing n by i in (3.45), then summing it from 2 to n, with the result of \(e^1\), we get
Combining (3.42) and (3.46), we have
Applying the Gronwall’s inequality to (3.47), there exist \(\tau _8, C_7, C_8\), such that when \(\tau \le \tau _8\), there holds
which implies
and
where \(\tau \le \tau _9\le 1/CC_7\). It can be seen that \(C_7\) and \(C_8\) have nothing to do with \(C_0\). Then (3.2) and (3.3) hold for \(m=n\) if we take \(C_0\ge \sum \limits _{i=1}^{8}C_i\) and \(\tau _0\le \min \limits _{1\le i\le 9}\tau _i\). \(\square \)
Remark 1
It can be seen that the result of \(\Vert e^n\Vert _2=O(\tau ^2)\) is one order higher that in [23], which leads to \(\Vert \tilde{\partial }_{tt}U^m\Vert _2\le C_0\). This will play an important role in the foregoing superconvergence analysis.
Remark 2
If we use a fully explicit method for the nonlinear term in (3.1)–(3.3), the unconditional convergence analysis is still valid by an \(H^2\) error estimate for the time semi-discrete. The idea is very similar and the process of proof is much easier.
4 Superconvergence Results for the Fully Discrete System
In this section, we will establish an estimate for \(\Vert R_hU^n-U_h^n\Vert _0=O(h^2)\), which results in the unconditional boundedness of \(\Vert U_h^n\Vert _{0,\infty }\). Then \(\Vert \nabla (R_hU^n-U_h^n)\Vert _0\) with order \(O(h^2+\tau ^2)\) is deduced which will result in the superclose results \(\Vert \nabla (I_hu^n-U_h^n)\Vert _0\) with order \(O(h^2+\tau ^2)\) unconditionally on the basis of the relationship between \(I_h\) and \(R_h\). At last, the global superconvergence is deduced through the interpolated postprocessing technique. A pervading strategy throughout the error analysis in the rest of this paper is splitting the error to a sum of two terms:
Theorem 2
Let u and \(U_h^m\) be the solutions of (1.1) and (2.5)–(2.7) respectively, for \(m=1,2,\ldots , N\), under the conditions in Theorem 1, we have
Proof
Since \(\Vert R_hU^{1,0}\Vert _{0}+\Vert R_hU^{1,0}\Vert _{0,\infty }+\Vert R_hU^m\Vert _{0,\infty }\le C\Vert U^{0}\Vert _{2}+C\Vert U^{1,0}\Vert _{2}+C\Vert U^m\Vert _{2}\le C\), let \(K_0^{'}\triangleq 1+\Vert R_hU^{1,0}\Vert _{0,\infty }+\max \limits _{0\le i\le N}\Vert R_hU^i\Vert _{0,\infty }\). First of all, we obtain the result that there exist \(\tau _0^{'}\) and \(h_0^{'}\), when \(\tau \le \tau _0^{'}\) and \(h\le h_0^{'}\), it follows
which bounds \(\Vert U_h^m\Vert _{0,\infty }\) unconditionally. For \(m=1\), we have \(\Vert U_h^0\Vert _{0,\infty }=\Vert R_hU^0\Vert _{0,\infty }\le K_0^{'}\). Using (2.6) and (3.2), the error equation is deduced by
Substituting \(v_h=\frac{\theta ^{1,0}}{\tau }\) in (4.4), we get
By (2.1) and (2.3), it follows that
Taking the imaginary part and the real part, respectively, summing them together, then we get
Thus there exist \(\tau _1^{'}, C_1^{'}\), such that when \(\tau \le \tau _1^{'}\), we have
which implies
where \(h\le h_1^{'}\le 1/CC_1^{'}\). Making use of (2.7) and (3.3) to deduce the error equation and setting \(v_h=\frac{\theta ^{1}}{\tau }\), then we have
Similar to the proof of \(\theta ^{1,0}\), we get
where the last step is deduced by the help of (4.7). Also, taking the imaginary part and the real part, respectively, summing them together, then we get
Thus there exist \(\tau _2^{'}, C_2^{'}\), such that when \(\tau \le \tau _2^{'}\), we have
which implies
where \(h\le h_2^{'}\le 1/CC_2^{'}\). By mathematical induction, we assume that (4.3) holds for \(m\le n-1\), then we have
where \(h\le h_3^{'}\le 1/CC_0^{'}\).
Then when \(m=n\), setting \(P_2^n=f(|\hat{U}^{n}|^2)\tilde{U}^n-f(|\hat{U}_h^{n}|^2)\tilde{U}_h^n\), we get the error equation from (2.5) and (3.1) as follows:
Choosing \(v_h=\tilde{\theta }^n\) in (4.14), the impartial part results in
We bound \(P_2^n\) as
where \(\mu _6^n=|\hat{U}^{n-1}|^2+\lambda _6^n(|\hat{U}_h^{n-1}|^2-|\hat{U}^{n-1}|^2)\).
Thus,
Summing (4.16) up gives
Applying the Gronwall’s inequality to (4.17), together with (4.11), there exist \(\tau _3^{'}, C_3^{'}\), when \(\tau \le \tau _3^{'}\), we have
which leads to
where \(h\le h_4^{'}\le 1/CC_3^{'}\). Clearly, \(C_3^{'}\) has nothing to do with \(C_0^{'}\). Thus (4.3) holds for \(m=n\), if we take \(C_0^{'}\ge \sum \limits _{i=1}^{3}C_i^{'}\), \(\tau _0^{'}\le \min \limits _{1\le \tau \le 3}\tau _i^{'}\) and \(h_0^{'}\le \min \limits _{1\le \tau \le 4}h_i^{'}\).
Secondly, we will give the result
unconditionally. Because of (4.11), it is apparent to see that (4.20) holds for \(m=1\). When \(m=n, (n\ge 2)\), choosing \(v_h=\tilde{\partial }_t\theta ^n\) in (4.14) and taking the real part result in
Then (4.21) leads to
Summing (4.22) from 2 to n, we obtain
Obviously, to obtain the estimate of \(\Vert \nabla \theta ^n\Vert _0\), we need the boundedness of \(\Vert \tilde{\partial }_t\theta ^i\Vert _0\). Taking difference between two time levels n and \(n-1\) of (4.14), with \(\hat{U}_h^1=\tilde{U}_h^1,\hat{r}^1=\tilde{r}^1,\hat{\theta }^1=\tilde{\theta }^1\) we have
Setting \(v_h=\tilde{\partial }_t\tilde{\theta }^n\) in (4.24), the imaginary part gives
Similar to the estimate of \(\theta ^n\), it is not difficult to check that
Based on the achievements above, it follows that
Note that
where
In fact,
and
Moreover,
Therefore
Recalling (4.26)–(4.28), it follows that
Summing (4.29), together with (4.23), it gives that
Applying the Gronwall’s inequality to (4.30), we have
which results in
At last, by the help of (2.2)–(2.4), it reduces to
\(\square \)
Remark 3
It is worthy to note that Theorem 2 can not be obtained by \(I_h\) alone. In order to keep the order of \(\Vert I_hU^n-U_h^n\Vert _{0}\) and \(\Vert \nabla (I_hU^n-U_h^n)\Vert _{0}\), we should employ \((\nabla (u^n-I_hu^n),\nabla v_h)=O(h^2)\Vert u^n\Vert _3\Vert v_h\Vert _1\) or \((\nabla (u^n-I_hu^n),\nabla v_h)=O(h^2)\Vert u^n\Vert _4\Vert v_h\Vert _0\) as that in [3]. Thus the regularity of \(U^n\) and \(u^n\) should be much stricter. However, we can only bound \(\Vert U^n\Vert _2\) under the assumption that \(\Omega \) is a rectangle. On the other hand, we take different approach to bound \(\Vert \tilde{\partial }_tP_2^n\Vert _0\), comparing with that in [3], then we avoid the appearance of the boundedness about \(\Vert \tilde{\partial }_tU_h^n\Vert _{0,\infty }\). Thus we get our final result unconditionally, which improves the conclusion of [3].
Based on Theorem 2 and interpolated postprocessing operator \(I_{2h}^2\) constructed in [31], we can deduce the following global superconvergence easily.
Theorem 3
Let u and \(U_h^m\) be the solutions of (1.1) and (2.2)–(2.4) respectively, for \(m=1,\ldots , N\), under the conditions of Theorem 1, we have
5 Numerical Results
In this section, we present three numerical examples to confirm our theoretical analysis.
Example 1
Considering the cubic Schrödinger equation [23] with \(\Omega =[0, 1]\times [0, 1]\), we set \(f(s)=s\), \(u=5e^{it}(1+2t^2)(1-x)(1-y)\sin (x)\sin (y)\) and g(X, t) is chosen corresponding to the exact solution. A uniform rectangular partition with \(M+1\) nodes in each direction is used in our computation.
We solve the system by the linearized Galerkin method with bilinear element. To confirm our error estimates in \(H^1\)-norm, we choose \(\tau =h\) and the numerical results with respect to time \(t=0.25, 0.5, 0.75, 1.0\) are listed in the following Tables 1, 2, 3 and 4 respectively. We can see clearly from them that when \(h\rightarrow 0\), \(\Vert u^n-U_h^n\Vert _1\) is convergent at an optimal rate O(h), and \(\Vert U_h^n-I_hu^n\Vert _1\), \(\Vert u^n-I_{2h}^2U_h^n\Vert _1\) are superconvergent at \(O(h^{2})\), which coincide with our theoretical analysis. To show the unconditional stability, we choose \(h=1/128\) and the large time steps \(\tau =h, 4h, 8h, 16h\), respectively. We present the numerical results in Table 5, which suggest that the scheme is stable for large time steps.We also describe the error reduction results at \(t = 0.25, 0.5, 0.75, 1.0\) in Figs. 1, 2, 3 and 4 respectively, where \(E_h^1=\Vert u^n-U^n_h\Vert _1, E_h^2=\Vert U^n_h-I_hu^n\Vert _1, E_h^3=\Vert u^n-I_{2h}^2U_h^n\Vert _1\).
Example 2
We consider the Schrödinger equation with \(\Omega =[0, 1]\times [0, 1]\), \(f(s)=-s^2+s\) and \(u=e^{(i+1)t}x^3 y^3(1-x)(1-y)\). g(X, t) is chosen corresponding to the exact solution. A uniform rectangular partition with \(M+1\) nodes in each direction is used in our computation.
Similar to Example 1, we can see from Tables 6, 7, 8, 9 and 10 and Figs. 5, 6, 7 and 8 that all these results are in good agreement with our theoretical analysis.
Example 3
We consider the example [35] describing the dynamics of Bose-Einstein Condensate at extremely low temperature, reads
where \(V(x,y)=1-\sin ^2x\sin ^2y\) and \(\Omega =[0, 1]\times [0, 1]\). The exact solution for the problem is \(u=e^{-2ti}\sin x\sin y\). A uniform rectangular partition with \(M+1\) nodes in each direction is used in our computation.
Tables 11, 12 and 13 and Figs. 9 and 10 confirm our theoretical analysis.
References
Akrivis, G.D.: Finite difference discretization of the cubic Schrödinger equation. IMA J. Numer. Anal. 13(1), 115–124 (1993)
Karakashian, O., Makridakis, C.: A space-time finite element method for the nonlinear Schrödinger equation: the continuous Galerkin method. SIAM J. Numer. Anal. 36(6), 1779–1807 (1999)
Shi, D.Y., Liao, X., Wang, L.L.: Superconvergence analysis of conforming finite element method for nonlinear Schrödinger equation. Appl. Math. Comput. 289, 298–310 (2016)
Shi, D.Y., Wang, P.L., Zhao, Y.M.: Superconvergence analysis of anisotropic linear triangular finite element for nonlinear Schrödinger equation. Appl. Math. Lett. 38, 129–134 (2014)
Dehghan, M., Mirzaei, D.: Numerical solution to the unsteady two-dimensional Schrödinger equation using meshless local boundary integral equation method. Int. J. Numer. Methods Eng. 76, 501–520 (2008)
Wu, L.: Two-grid mixed finite-element methods for nonlinear Schrödinger equations. Numer. Methods Part. Diff. Equ. 28(1), 63–73 (2012)
Xu, Y., Shu, C.W.: Local discontinuous Galerkin methods for nonlinear Schrödinger equations. J. Comput. Phys. 205, 72–77 (2005)
Karakashian, O., Makridakis, C.: A space-time finite element method for the nonlinear Schrödinger equation: the discontinuous Galerkin method. Math. Comp. 67(222), 479–499 (1998)
Chang, Q.S., Jia, E., Sun, W.: Difference schemes for solving the generalized nonlinear Schrödinger equation. J. Comput. Phys. 148(2), 397–415 (1999)
Dehghan, M., Taleei, A.: A compact split-step finite difference method for solving the nonlinear Schrödinger equations with constant and variable coefficients. Comput. Phys. Comm. 181, 43–51 (2010)
Bao, W.Z., Cai, Y.Y.: Uniform error estimates of finite difference methods for the nonlinear Schrödinger equation with wave operator. SIAM J. Numer. Anal. 50, 492–521 (2012)
Zhang, L.M., Chang, Q.S.: A conservative numerical scheme for a class of nonlinear Schrödinger equation with wave operator. Appl. Math. Comput. 220(1–2), 240–256 (2008)
Lai, X., Yuan, Y.: Galerkin alternating-direction method for a kind of three-dimensional nonlinear hyperbolic problems. Comput. Math. Appl. 57(3), 384–403 (2009)
Chen, Y., Huang, Y.: The full-discrete mixed finite element methods for nonlinear hyperbolic equations. Commun. Nonlinear Sci. Numer. Simul. 3(3), 152–155 (1998)
Rachford Jr., H.H.: Two-level discrete-time Galerkin approximations for second order nonlinear parabolic partial differential equations. SIAM J. Numer. Anal. 10(6), 1010–1026 (1973)
Luskin, M.: A Galerkin method for nonlinear parabolic equations with nonlinear boundary conditions. SIAM J. Numer. Anal. 16(2), 284–299 (1979)
Thomée, V.: Galerkin Finite Element Methods for Parabolic Problems, Springer Series in Computational Mathematics. Springer, Sweden (2000)
Shi, D.Y., Wang, J.J., Yan, F.N.: Superconvergence analysis for nonlinear parabolic equation with \(EQ^{rot}_1\) nonconforming finite element. Comput. Appl. Math. (2016). doi:10.1007/s40314-016-0344-6
Shi, D.Y., Tang, Q.L., Gong, W.: A low order characteristic-nonconforming finite element method for nonlinear Sobolev equation with convection-dominated term. Math. Comput. Simulat. 114, 25–36 (2015)
Gu, H.M.: Characteristic finite element methods for nonlinear Sobolev equations. Appl. Math. Comput. 102(1), 51–62 (1999)
Liu, B.Y.: The analysis of a finite element method with streamline diffusion for the compressible Navier–Stokes equations. SIAM J. Numer. Anal. 38(1), 1–16 (2000)
He, Y.N., Sun, W.W.: Stabilized finite element method based on the Crank–Nicolson extrapolation scheme for the time-dependent Navier-Stokes equations. Math. Comput. 76(257), 115–136 (2006)
Wang, J.L.: A new error analysis of Crank–Nicolson Galerkin FEMs for a generalized nonlinear Schrödinger equation. J. Sci. Comput. 60(2), 390–407 (2014)
Wang, J.L., Si, Z.Y., Sun, W.W.: A new error analysis of characteristics-mixed FEMs for miscible displacement in porous media. SIAM J. Numer. Anal. 52(6), 3000–3020 (2013)
Li, B.Y., Sun, W.W.: Unconditional convergence and optimal error estimates of a Galerkin-mixed FEM for incompressible miscible flow in porous media. SIAM J. Numer. Anal. 51(4), 1959–1977 (2013)
Gao, H.D.: Optimal error analysis of Galerkin FEMs for nonlinear Joule Heating equations. J. Sci. Comput. 58(3), 627–647 (2014)
Li, B.Y., Gao, H.D., Sun, W.W.: Unconditionally optimal error estiamtes of a Crank–Nicolson Galerkin method for the nonlinear thermistor equations. SIAM J. Numer. Anal. 52(2), 933–954 (2014)
Gao, H.D.: Unconditional optimal error estiamtes of BDF-Galerkin FEMs for nonlinear thermistor equations. J. Sci. Comput. 66(2), 504–527 (2016)
Si, Z.Y., Wang, J.L., Sun, W.W.: Unconditional stability and error estimates of modified characteristics FEMs for the Navier-Stokes equations. Numer. Math. 134(1), 139–161 (2016)
Shi, D.Y., Wang, J.J., Yan, F.N.: Unconditional Superconvergence analysis for nonlinear parabolic equation with \(EQ^{rot}_1\) nonconforming finite element. J. Sci. Comput. (2016). doi:10.1007/s10915-016-0243-4
Shi, D.Y., Yan, F.N., Wang, J.J.: Unconditional superconvergence analysis of a new mixed finite element method for nonlinear Sobolev equation. Appl. Math. Comput. 274(1), 182–194 (2016)
Gottlieb, S., Wang, C.: Stability and convergence analysis of fully discrete Fourier collocation spectral method for 3-D viscous Burgers equation. J. Sci. Comput. 53, 102–128 (2012)
Cheng, K., Wang, C.: Long time stability of high order multiStep numerical schemes for two-dimensional incompressible Navier–Stokes equations. SIAM J. Numer. Anal. 54(5), 3123–3144 (2016)
Shi, D.Y., Wang, F.L., Fan, M.Z., Zhao, Y.M.: A new approach of the lowest order anisotropic mixed finite element high accuracy analysis for nonlinear Sine–Gordon equaitons. Math. Numer. Sin. 37(2), 148–161 (2015)
Wang, H.: Numerical studies on the split-step finite difference method for nonlinear Schrödinger equations. Appl. Math. Comput. 170(1), 17–35 (2005)
Acknowledgements
This work was supported by the National Natural Science Foundation of China (No. 11271340).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Shi, D., Wang, J. Unconditional Superconvergence Analysis of a Crank–Nicolson Galerkin FEM for Nonlinear Schrödinger Equation. J Sci Comput 72, 1093–1118 (2017). https://doi.org/10.1007/s10915-017-0390-2
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10915-017-0390-2
Keywords
- Unconditional superconvergence results
- NLSE
- Linearized C–N Galerkin FEM
- Temporal and spatial errors
- Ritz projection and interpolated operators