Abstract
Abstract In this paper, we analyse full discretizations of an initial boundary value problem (IBVP) related to reaction-diffusion equations. To avoid possible order reduction, the IBVP is first transformed into an IBVP with homogeneous boundary conditions (IBVPHBC) via a lifting of inhomogeneous Dirichlet, Neumann or mixed Dirichlet–Neumann boundary conditions. The IBVPHBC is discretized in time via the deferred correction method for the implicit midpoint rule and leads to a time-stepping scheme of order 2 p + 2 2p+2 of accuracy at the stage p = 0 , 1 , 2 , … p=0,1,2,\ldots of the correction. Each semi-discretized scheme results in a nonlinear elliptic equation for which the existence of a solution is proven using the Schaefer fixed point theorem. The elliptic equation corresponding to the stage 𝑝 of the correction is discretized by the Galerkin finite element method and gives a full discretization of the IBVPHBC. This fully discretized scheme is unconditionally stable with order 2 p + 2 2p+2 of accuracy in time. The order of accuracy in space is equal to the degree of the finite element used when the family of meshes considered is shape-regular, while an increment of one order is proven for a quasi-uniform family of meshes. Numerical tests with a bistable reaction-diffusion equation having a strong stiffness ratio, a Fisher equation, a linear reaction-diffusion equation addressing order reduction and two linear IBVPs in two dimensions are performed and demonstrate the unconditional convergence of the method. The orders 2, 4, 6, 8 and 10 of accuracy in time are achieved. Except for some linear problems, the accuracy of DC methods is better than that of BDF methods of same order.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.