Krylov implicit integration factor discontinuous Galerkin methods on sparse grids for high dimensional reaction-diffusion equations

Computational costs of numerically solving multidimensional partial differential equations (PDEs) increase significantly when the spatial dimensions of the PDEs are high, due to large number of spatial grid points. For multidimensional reaction-diffusion equations, stiffness of the system provides additional challenges for achieving efficient numerical simulations. In this paper, we propose a class of Krylov implicit integration factor (IIF) discontinuous Galerkin (DG) methods on sparse grids to solve reaction-diffusion equations on high spatial dimensions. The key ingredient of spatial DG discretization is the multiwavelet bases on nested sparse grids, which can significantly reduce the numbers of degrees of freedom. To deal with the stiffness of the DG spatial operator in discretizing reaction-diffusion equations, we apply the efficient IIF time discretization methods, which are a class of exponential integrators. Krylov subspace approximations are used to evaluate the large size matrix exponentials resulting from IIF schemes for solving PDEs on high spatial dimensions. Stability and error analysis for the semi-discrete scheme are performed. Numerical examples of both scalar equations and systems in two and three spatial dimensions are provided to demonstrate the accuracy and efficiency of the methods. The stiffness of the reaction-diffusion equations is resolved well and large time step size computations are obtained

Application of implicit-explicit high order Runge-Kutta methods to discontinuous-Galerkin schemes

Despite the popularity of high-order explicit Runge-Kutta (ERK) methods for integrating semi-discrete systems of equations, ERK methods suffer from severe stability-based time step restrictions for very stiff problems. We implement a discontinuous Galerkin finite element method (DGFEM) along with recently introduced high-order implicit-explicit Runge-Kutta (IMEX-RK) schemes to overcome geometry-induced stiffness in fluid-flow problems. The IMEX algorithms solve the non-stiff portions of the domain using explicit methods, and isolate and solve the more expensive stiff portions using an L-stable, stiffly-accurate explicit, singly diagonally implicit Runge-Kutta method (ESDIRK). Furthermore, we apply adaptive time-step controllers based on the embedded temporal error predictors. We demonstrate in a number of numerical test problems that IMEX methods in conjunction with efficient preconditioning become more efficient than explicit methods for systems exhibiting high levels of grid-induced stiffness. (c) 2007 Elsevier Inc. All rights reserved

A Continuous/Discontinuous FE Method for the 3D Incompressible Flow Equations

A projection scheme for the numerical solution of the incompressible Navier-Strokes equation is presented. Finite element discontinuous Galerkin (dG) discretization for the velocity in the momentum equations is employed. The incompressibility constraint is enforced by numerically solving the Poisson equation for pressure using a continuous Galerkin (cG) discretization. The main advantage of the method is that is does not require the velocity and pressure approximation spaces to satisfy the usual inf-sup condition, thus equal order finite element approximations for both velocity and pressure can be used. Furthermore, by using cG discretization for the Poisson equation, no auxiliary equations are needed as it is required for dG approximations of second order derivatives. In order to enable large time steps for time marching to steady-state and time evolving problems, implicit scheme is used in connection with high order implicit RK methods. Numerical tests demonstrate that the overall scheme is accurate and computationally efficient

Efficient Solvers for Space-Time Discontinuous Galerkin Spectral Element Methods

In this thesis we study efficient solvers for space-time discontinuous Galerkin spectral element methods (DG-SEM). These discretizations result in fully implicit schemes of variable order in both spatial and temporal directions. The popularity of space-time DG methods has increased in recent years and entropy stable space-time DG-SEM have been constructed for conservation laws, making them interesting for these applications. The size of the nonlinear system resulting from differential equations discretized with space-time DG-SEM is dependent on the order of the method, and the corresponding Jacobian is of block form with dense blocks. Thus, the problem arises to efficiently solve these huge nonlinear systems with regards to CPU time as well as memory consumption. The lack of good solvers for three-dimensional DG applications has been identified as one of the major obstacles before high order methods can be adapted for industrial applications.It has been proven that DG-SEM in time and Lobatto IIIC Runge-Kutta methods are equivalent, in that both methods lead to the same discrete solution. This allows to implement space-time DG-SEM in two ways: Either as a full space-time system or by decoupling the temporal elements and using implicit time-stepping with Lobatto IIIC methods. We compare theoretical properties and discuss practical aspects of the respective implementations.When considering the full space-time system, multigrid can be used as solver. We analyze this solver with the local Fourier analysis, which gives more insight into the efficiency of the space-time multigrid method. The other option is to decouple the temporal elements and use implicit Runge-Kutta time-stepping methods. We suggest to use Jacobian-free Newton-Krylov (JFNK) solvers since they are advantageous memory-wise. An efficient preconditioner for the Krylov sub-solver is needed to improve the convergence speed. However, we want to avoid constructing or storing the Jacobian, otherwise the favorable memory consumption of the JFNK approach would be obsolete. We present a preconditioner based on an auxiliary first order finite volume replacement operator. Based on the replacement operator we construct an agglomeration multigrid preconditioner with efficient smoothers using pseudo time integrators. Then only the Jacobian of the replacement operator needs to be constructed and the DG method is still Jacobian-free. Numerical experiments for hyperbolic test problems as the advection, advection-diffusion and Euler equations in several dimensions demonstrate the potential of the new approach

Recent Developments in the Numerics of Nonlinear Hyperbolic Conservation Laws

The development of reliable numerical methods for the simulation of real life problems requires both a fundamental knowledge in the field of numerical analysis and a proper experience in practical applications as well as their mathematical modeling. Thus, the purpose of the workshop was to bring together experts not only from the field of applied mathematics but also from civil and mechanical engineering working in the area of modern high order methods for the solution of partial differential equations or even approximation theory necessary to improve the accuracy as well as robustness of numerical algorithms

Schnelle Löser für Partielle Differentialgleichungen

This workshop was well attended by 52 participants with broad geographic representation from 11 countries and 3 continents. It was a nice blend of researchers with various backgrounds