307 research outputs found
Efficient high order semi-implicit time discretization and local discontinuous Galerkin methods for highly nonlinear PDEs
International audienceIn this paper, we develop a high order semi-implicit time discretization method for highly nonlinear PDEs, which consist of the surface diffusion and Willmore flow of graphs, the Cahn-Hilliard equation and the Allen-Cahn/Cahn-Hilliard system. These PDEs are high order in spatial derivatives, which motivates us to develop implicit or semi-implicit time marching methods to relax the severe time step restriction for stability of explicit methods. In addition, these PDEs are also highly nonlinear, fully implicit method will incredibly increase the difficulty of implementation. In particular, we can not well separate the stiff and non-stiff components for these problems, which leads to the traditional implicit-explicit methods nearly meaningless. In this paper, a high order semi-implicit time marching method and the local discontinuous Galerkin spatial method are coupled together to achieve high order accuracy in both space and time, and to enhance the efficiency of the proposed approaches, the resulting linear or nonlinear algebraic systems are solved by multigrid solver. Numerical simulation results in one and two dimensions are presented to illustrate that the combination of the local discontinuous Galerkin method for spatial approximation, semi-implicit temporal integration with the multigrid solver provides a practical and efficient approach when solving this family of problems
Discontinuous Galerkin approximation of linear parabolic problems with dynamic boundary conditions
In this paper we propose and analyze a Discontinuous Galerkin method for a
linear parabolic problem with dynamic boundary conditions. We present the
formulation and prove stability and optimal a priori error estimates for the
fully discrete scheme. More precisely, using polynomials of degree on
meshes with granularity along with a backward Euler time-stepping scheme
with time-step , we prove that the fully-discrete solution is bounded
by the data and it converges, in a suitable (mesh-dependent) energy norm, to
the exact solution with optimal order . The sharpness of the
theoretical estimates are verified through several numerical experiments
- …