An Implicit Algorithm for High-Order DG/FV Schemes for Compressible Flows on 2D Arbitrary Grids

An Implicit Algorithm for High-Order DG/FV Schemes for Compressible Flows on 2D Arbitrary Grids

Year:    2015

Communications in Computational Physics, Vol. 17 (2015), Iss. 1 : pp. 287–316

Abstract

A Newton/LU-SGS (lower-upper symmetric Gauss-Seidel) iteration implicit method was developed to solve two-dimensional Euler and Navier-Stokes equations by the DG/FV hybrid schemes on arbitrary grids. The Newton iteration was employed to solve the nonlinear system, while the linear system was solved with LU-SGS iteration. The effect of several parameters in the implicit scheme, such as the CFL number, the Newton sub-iteration steps, and the update frequency of Jacobian matrix, was investigated to evaluate the performance of convergence history. Several typical test cases were simulated, and compared with the traditional explicit Runge-Kutta (RK) scheme. Firstly the Couette flow was tested to validate the order of accuracy of the present DG/FV hybrid schemes. Then a subsonic inviscid flow over a bump in a channel was simulated and the effect of parameters was also investigated. Finally, the implicit algorithm was applied to simulate a subsonic inviscid flow over a circular cylinder and the viscous flow in a square cavity. The numerical results demonstrated that the present implicit scheme can accelerate the convergence history efficiently. Choosing proper parameters would improve the efficiency of the implicit scheme. Moreover, in the same framework, the DG/FV hybrid schemes are more efficient than the same order DG schemes.

You do not have full access to this article.

Already a Subscriber? Sign in as an individual or via your institution

Journal Article Details

Publisher Name:    Global Science Press

Language:    English

DOI:    https://doi.org/10.4208/cicp.091113.280714a

Communications in Computational Physics, Vol. 17 (2015), Iss. 1 : pp. 287–316

Published online:    2015-01

AMS Subject Headings:    Global Science Press

Copyright:    COPYRIGHT: © Global Science Press

Pages:    30

Keywords: