An Implicit Method for a Reconstructed Discontinuous Galerkin Method on Tetrahedron Grids

Abstract

An implicit method for a reconstructed discontinuous Galerkin (RDG) method is presented to solve compressible flow problems on tetrahedron grids. The idea is to combine the accuracy of the RDG method and the efficiency of implicit methods to obtain a better numerical algorithm in computational fluid dynamics. A least-squares reconstruction method is presented to obtain a quadratic polynomial representation of the underlying linear discontinuous Galerkin solution on each cell via an in-cell reconstruction process. The devised in-cell reconstruction is able to augment the accuracy of the DG method by increasing the order of the underlying polynomial solution. A matrix-free GMRES (generalized minimum residual) algorithm with an LU-SGS (lower-upper symmetric GaussSeidel) preconditioner is presented to solve an approximate system of linear equations arising from the Newton linearization. The implicit method is used to compute a variety of three-dimensional problems on tetrahedron grids to assess its accuracy and robustness. The numerical experiments demonstrate that the implicit reconstructed discontinuous Galerkin method can obtain an overall speedup of more than two orders of magnitude for all test cases compared with multi-stage Runge-Kutta reconstructed DG methods. The numerical results also indicate that this implicit RDG(P 1 P 2 ) method can deliver the desired third-order accuracy, while maintaining advantage in cost over the implicit DG(P 2 ) method. Nomenclatureof the left-hand side matrix A e = total energy per mass F = fluxes of mass, momentum and energy GMRES = generalized minimum residual L = lower part of the left-hand side matrix A LU-SGS = lower-upper symmetric Gauss-Seidel n j = unit outward normal vector to the cell boundary P = preconditioning matrix p = pressure R = residual vector S = entropy t = time U = conservative state vector Ũ = cell-averaged value of conservative state vector U = upper part of the left-hand side matrix A V = mass matrix W = test function vector u i = Cartesian velocity in i direction x, y, z = Cartesian coordinates x c , y c , z c = center coordinates of the cell Ω e = volume of the cell Γ e = boundary of the cell ε = value used in perturbing the solution γ = ratio of the specific heats η = span-wise location ρ = density ∆t = time step

Predictor-Corrector LU-SGS Discontinuous Galerkin Finite Element Method for Conservation Laws

“…Then, Bassi and Rebay showed the efficiency of GMRES method in [14] and used a simple block Jacobi preconditioner for the implicit solution of the compressible Navier-Stokes equations. Xia and Luo [3] presented a matrixfree GMRES algorithm with an LU-SGS preconditioner reconstructed discontinuous Galerkin method on tetrahedron grids for compressible flow problems. Then, they proposed implicit reconstructed discontinuous Galerkin (IRDG) method based on the automatic differentiation technique [4].…”

OpenACC-based GPU Acceleration of a 3-D Unstructured Discontinuous Galerkin Method

“…Two of the most attractive features in OpenACC: 1) multi-platform/compiler support and 2) easy-to-code directives has been employed to partially upgrade a legacy Navier-Stokes DG solver 17,18,26,27,25,28 with the GPU computing capacity without significant extra cost in recoding and maintenance, resuling in a highly portable and extensible GPU codebase. A face renumbering/grouping scheme is proposed in order to solve the "race condition" in face-based flux calculations that occurs on GPU vectorization.…”