基于间断有限元方法的并列圆柱层流流动特性

基于高阶的间断有限元方法, 数值模拟低马赫数下并列圆柱的可压缩层流流动, 捕捉并列圆柱流场中的漩涡结构, 以便分析并列圆柱尾流的流动特性. 针对二维圆柱的边界形式, 采用曲边三角形单元构造二维圆柱的曲面边界, 以适应高阶离散格式的精度. 在验证方法合理性的基础上, 分析圆柱间距及雷诺数对漩涡脱落及受力特性的影响规律. 研究结果表明: 并列圆柱的间距是影响流场流动特性的一个主要因素, 它会改变圆柱漩涡脱落的形式. 随着圆柱间距的增加, 上下圆柱的平均阻力系数及平均升力系数的绝对值随之显著下降. 雷诺数对于平均阻力系数的影响相对较小. 但随着雷诺数的增加, 上下圆柱的平均升力系数会随之降低, 而漩涡的脱落频率会随之增大.     

On the use of the discontinuous Galerkin method for numerical simulation of two-dimensional compressible turbulence with shocks

In this paper, the discontinuous Galerkin (DG) method combined with localized artificial diffusivity is investigated in the context of numerical simulation of broadband compressible turbulent flows with shocks for under-resolved cases. Firstly, the spectral property of the DG method is analyzed using the approximate dispersion relation (ADR) method and compared with typical finite difference methods, which reveals quantitatively that significantly less grid points can be used with DG for comparable numerical error. Then several typical test cases relevant to problems of compressible turbulence are simulated, including one-dimensional shock/entropy wave interaction, two-dimensional decaying isotropic turbulence, and two-dimensional temporal mixing layers. Numerical results indicate that higher numerical accuracy can be achieved on the same number of degrees of freedom with DG than high order finite difference schemes. Furthermore, shocks are also well captured using the localized artificial diffusivity method. The results in this work can provide useful guidance for further applications of DG to direct and large eddy simulation of compressible turbulent flows.     

Modified Burgers equation by local discontinuous Galerkin method

In this paper, we present the local discontinuous Galerkin method for solving Burgers’ equation and the modified Burgers’ equation. We describe the algorithm formulation and practical implementation of the local discontinuous Galerkin method in detail. The method is applied to the solution of the one-dimensional viscous Burgers’ equation and two forms of the modified Burgers’ equation. The numerical results indicate that the method is very accurate and efficient.     

Modified Burgers’ equation by the local discontinuous Galerkin method

In this paper,we present the local discontinuous Galerkin method for solving Burgers’ equation and the modified Burgers’ equation.We describe the algorithm formulation and practical implementation of the local discontinuous Galerkin method in detail.The method is applied to the solution of the one-dimensional viscous Burgers’ equation and two forms of the modified Burgers’ equation.The numerical results indicate that the method is very accurate and efficient.     

Local derivative post-processing for the discontinuous Galerkin method

Obtaining accurate approximations for derivatives is important for many scientific applications in such areas as fluid mechanics and chemistry as well as in visualization applications. In this paper we discuss techniques for computing accurate approximations of high-order derivatives for discontinuous Galerkin solutions to hyperbolic equations related to these areas. In previous work, improvement in the accuracy of the numerical solution using discontinuous Galerkin methods was obtained through post-processing by convolution with a suitably defined kernel. This post-processing technique was able to improve the order of accuracy of the approximation to the solution of time-dependent symmetric linear hyperbolic partial differential equations from order k+1$k+1$ to order 2k+1$2k+1$ over a uniform mesh; this was extended to include one-sided post-processing as well as post-processing over non-uniform meshes. In this paper, we address the issue of improving the accuracy of approximations to derivatives of the solution by using the method introduced by Thomée [19]. It consists in simply taking the α$\alpha$th-derivative of the convolution of the solution with a sufficiently smooth kernel. The order of convergence of the approximation is then independent   of the order of the derivative, |α|$|\alpha |$. We also discuss an efficient way of computing the approximation which does not involve differentiation but the application of simple finite differencing. Our results show that the above-mentioned approximations to the α$\alpha$th-derivative of the exact solution of linear, multidimensional symmetric hyperbolic systems obtained by the discontinuous Galerkin method with polynomials of degree k$k$ converge with order 2k+1$2k+1$ regardless of the order |α|$|\alpha |$ of the derivative.     

Positivity-preserving high order discontinuous Galerkin schemes for compressible Euler equations with source terms

In [16], [17], we constructed uniformly high order accurate discontinuous Galerkin (DG) schemes which preserve positivity of density and pressure for the Euler equations of compressible gas dynamics with the ideal gas equation of state. The technique also applies to high order accurate finite volume schemes. For the Euler equations with various source terms (e.g., gravity and chemical reactions), it is more difficult to design high order schemes which do not produce negative density or pressure. In this paper, we first show that our framework to construct positivity-preserving high order schemes in [16], [17] can also be applied to Euler equations with a general equation of state. Then we discuss an extension to Euler equations with source terms. Numerical tests of the third order Runge–Kutta DG (RKDG) method for Euler equations with different types of source terms are reported.     

Direct discontinuous Galerkin method for the generalized Burgers—Fisher equation

In this study, we use the direct discontinuous Galerkin method to solve the generalized Burgers-Fisher equation. The method is based on the direct weak formulation of the Burgers-Fisher equation. The two adjacent cells are jointed by a numerical flux that includes the convection numerical flux and the diffusion numerical flux. We solve the ordinary differential equations arising in the direct Galerkin method by using the strong stability preserving Runge-Kutta method. Numerical results are compared with the exact solution and the other results to show the accuracy and reliability of the method.     

Stable Galerkin reduced order models for linearized compressible flow

The Galerkin projection procedure for construction of reduced order models of compressible flow is examined as an alternative discretization of the governing differential equations. The numerical stability of Galerkin models is shown to depend on the choice of inner product for the projection. For the linearized Euler equations, a symmetry transformation leads to a stable formulation for the inner product. Boundary conditions for compressible flow that preserve stability of the reduced order model are constructed. Preservation of stability for the discrete implementation of the Galerkin projection is made possible using a piecewise-smooth finite element basis. Stability of the reduced order model using this approach is demonstrated on several model problems, where a suitable approximation basis is generated using proper orthogonal decomposition of a transient computational fluid dynamics simulation.     

Multigrid algorithms for high-order discontinuous Galerkin discretizations of the compressible Navier–Stokes equations

Multigrid algorithms are developed for systems arising from high-order discontinuous Galerkin discretizations of the compressible Navier–Stokes equations on unstructured meshes. The algorithms are based on coupling both p- and h-multigrid (ph-multigrid) methods which are used in nonlinear or linear forms, and either directly as solvers or as preconditioners to a Newton–Krylov method.The performance of the algorithms are examined in solving the laminar flow over an airfoil configuration. It is shown that the choice of the cycling strategy is crucial in achieving efficient and scalable solvers. For the multigrid solvers, while the order-independent convergence rate is obtained with a proper cycle type, the mesh-independent performance is achieved only if the coarsest problem is solved to a sufficient accuracy. On the other hand, the multigrid preconditioned Newton–GMRES solver appears to be insensitive to this condition and mesh-independent convergence is achieved under the desirable condition that the coarsest problem is solved using a fixed number of multigrid cycles regardless of the size of the problem.It is concluded that the Newton–GMRES solver with the multigrid preconditioning yields the most efficient and robust algorithm among those studied.     

A consistent and stabilized continuous/discontinuous Galerkin method for fourth-order incompressible flow problems

This paper presents a new consistent and stabilized finite-element formulation for fourth-order incompressible flow problems. The formulation is based on the C⁰-interior penalty method, the Galerkin least-square (GLS) scheme, which assures that the formulation is weakly coercive for spaces that fail to satisfy the inf-sup condition, and considers discontinuous pressure interpolations. A stability analysis through a lemma establishes that the proposed formulation satisfies the inf-sup condition, thus confirming the robustness of the method. This lemma indicates that, at the element level, there exists an optimal or quasi-optimal GLS stability parameter that depends on the polynomial degree used to interpolate the velocity and pressure fields, the geometry of the finite element, and the fluid viscosity term. Numerical experiments are carried out to illustrate the ability of the formulation to deal with arbitrary interpolations for velocity and pressure, and to stabilize large pressure gradients.     

h-Multigrid for space-time discontinuous Galerkin discretizations of the compressible Navier–Stokes equations

Being implicit in time, the space-time discontinuous Galerkin discretization of the compressible Navier–Stokes equations requires the solution of a non-linear system of algebraic equations at each time-step. The overall performance, therefore, highly depends on the efficiency of the solver. In this article, we solve the system of algebraic equations with a h-multigrid method using explicit Runge–Kutta relaxation. Two-level Fourier analysis of this method for the scalar advection–diffusion equation shows convergence factors between 0.5 and 0.75. This motivates its application to the 3D compressible Navier–Stokes equations where numerical experiments show that the computational effort is significantly reduced, up to a factor 10 w.r.t. single-grid iterations.     

On positivity-preserving high order discontinuous Galerkin schemes for compressible Euler equations on rectangular meshes

We construct uniformly high order accurate discontinuous Galerkin (DG) schemes which preserve positivity of density and pressure for Euler equations of compressible gas dynamics. The same framework also applies to high order accurate finite volume (e.g. essentially non-oscillatory (ENO) or weighted ENO (WENO)) schemes. Motivated by Perthame and Shu (1996) [20] and Zhang and Shu (2010) [26], a general framework, for arbitrary order of accuracy, is established to construct a positivity preserving limiter for the finite volume and DG methods with first order Euler forward time discretization solving one-dimensional compressible Euler equations. The limiter can be proven to maintain high order accuracy and is easy to implement. Strong stability preserving (SSP) high order time discretizations will keep the positivity property. Following the idea in Zhang and Shu (2010) [26], we extend this framework to higher dimensions on rectangular meshes in a straightforward way. Numerical tests for the third order DG method are reported to demonstrate the effectiveness of the methods.     

Locally implicit discontinuous Galerkin method for time domain electromagnetics

In the recent years, there has been an increasing interest in discontinuous Galerkin time domain (DGTD) methods for the solution of the unsteady Maxwell equations modeling electromagnetic wave propagation. One of the main features of DGTD methods is their ability to deal with unstructured meshes which are particularly well suited to the discretization of the geometrical details and heterogeneous media that characterize realistic propagation problems. Such DGTD methods most often rely on explicit time integration schemes and lead to block diagonal mass matrices. However, explicit DGTD methods are also constrained by a stability condition that can be very restrictive on highly refined meshes and when the local approximation relies on high order polynomial interpolation. An implicit time integration scheme is a natural way to obtain a time domain method which is unconditionally stable but at the expense of the inversion of a global linear system at each time step. A more viable approach consists of applying an implicit time integration scheme locally in the refined regions of the mesh while preserving an explicit time scheme in the complementary part, resulting in an hybrid explicit–implicit (or locally implicit) time integration strategy. In this paper, we report on our recent efforts towards the development of such a hybrid explicit–implicit DGTD method for solving the time domain Maxwell equations on unstructured simplicial meshes. Numerical experiments for 3D propagation problems in homogeneous and heterogeneous media illustrate the possibilities of the method for simulations involving locally refined meshes.     

电磁场2.5维时域间断有限元方法

介质沿空间固定方向均匀分布的结构在电磁导波器件中有十分广泛的应用,对这类器件的分析通常被称为2.5D电磁问题。利用器件在固定方向介质分布均匀的特点,将电磁场量沿该方向进行空间傅里叶变换,可以把对三维问题的分析转化为两维问题求解,从而极大地减小计算开销。针对传统基于差分的2.5D电磁场算法在弯曲形状逼近上有阶梯误差的缺陷,本文提出了基于三角形网格的2.5D时域间断有限元方法（DGTD）,并用它模拟了电偶极子与光纤的耦合效率和光子晶体光纤的色散特性。与基于规则网格的2.5D差分方法进行对比。结果表明,文中建立的2.5D DGTD方法对弯曲形状的模拟更加逼真,计算内存占用最大减少10.4%,计算精度最大相差0.011%,计算时间缩短74.9%,计算效率提高。     

基于广义交替数值通量的局部间断Galerkin方法求解二维波动方程

波的传播往往在复杂的地质结构中进行,如何有效地求解非均匀介质中的波动方程一直是研究的热点.本文将局部间断Galekin(local discontinuous Galerkin, LDG)方法引入到数值求解波动方程中.首先引入辅助变量,将二阶波动方程写成一阶偏微分方程组,然后对相应的线性化波动方程和伴随方程构造间断Galerkin格式;为了保证离散格式满足能量守恒,在单元边界上选取广义交替数值通量,理论证明该方法满足能量守恒性.在时间离散上,采用指数积分因子方法,为了提高计算效率,应用Krylov子空间方法近似指数矩阵与向量的乘积.数值实验中给出了带有精确解的算例,验证了LDG方法的数值精度和能量守恒性;此外,也考虑了非均匀介质和复杂计算区域的计算,结果表明LDG方法适合模拟具有复杂结构和多尺度结构介质中的传播.     

A discontinuous Galerkin method for inviscid low Mach number flows

In this work we extend the high-order discontinuous Galerkin (DG) finite element method to inviscid low Mach number flows. The method here presented is designed to improve the accuracy and efficiency of the solution at low Mach numbers using both explicit and implicit schemes for the temporal discretization of the compressible Euler equations. The algorithm is based on a classical preconditioning technique that in general entails modifying both the instationary term of the governing equations and the dissipative term of the numerical flux function (full preconditioning approach). In the paper we show that full preconditioning is beneficial for explicit time integration while the implicit scheme turns out to be efficient and accurate using just the modified numerical flux function. Thus the implicit scheme could also be used for time accurate computations. The performance of the method is demonstrated by solving an inviscid flow past a NACA0012 airfoil at different low Mach numbers using various degrees of polynomial approximations. Computations with and without preconditioning are performed on different grid topologies to analyze the influence of the spatial discretization on the accuracy of the DG solutions at low Mach numbers.     

A leap-frog discontinuous Galerkin time-domain method of analyzing electromagnetic scattering problems

Several major challenges need to be faced for efficient transient multiscale electromagnetic simulations, such as flexible and robust geometric modeling schemes, efficient and stable time-stepping algorithms, etc. Fortunately, because of the versatile choices of spatial discretization and temporal integration, a discontinuous Galerkin time-domain(DGTD) method can be a very promising method of solving transient multiscale electromagnetic problems. In this paper, we present the application of a leap-frog DGTD method to the analyzing of the multiscale electromagnetic scattering problems. The uniaxial perfect matching layer(UPML) truncation of the computational domain is discussed and formulated in the leap-frog DGTD context. Numerical validations are performed in the challenging test cases demonstrating the accuracy and effectiveness of the method in solving transient multiscale electromagnetic problems compared with those of other numerical methods.     

A spectral-element discontinuous Galerkin lattice Boltzmann method for nearly incompressible flows

We present a spectral-element discontinuous Galerkin lattice Boltzmann method for solving nearly incompressible flows. Decoupling the collision step from the streaming step offers numerical stability at high Reynolds numbers. In the streaming step, we employ high-order spectral-element discontinuous Galerkin discretizations using a tensor product basis of one-dimensional Lagrange interpolation polynomials based on Gauss–Lobatto–Legendre grids. Our scheme is cost-effective with a fully diagonal mass matrix, advancing time integration with the fourth-order Runge–Kutta method. We present a consistent treatment for imposing boundary conditions with a numerical flux in the discontinuous Galerkin approach. We show convergence studies for Couette flows and demonstrate two benchmark cases with lid-driven cavity flows for Re = 400–5000 and flows around an impulsively started cylinder for Re = 550–9500. Computational results are compared with those of other theoretical and computational work that used a multigrid method, a vortex method, and a spectral element model.     

A domain decomposition method for solving the three-dimensional time-harmonic Maxwell equations discretized by discontinuous Galerkin methods

We present here a domain decomposition method for solving the three-dimensional time-harmonic Maxwell equations discretized by a discontinuous Galerkin method. In order to allow the treatment of irregularly shaped geometries, the discontinuous Galerkin method is formulated on unstructured tetrahedral meshes. The domain decomposition strategy takes the form of a Schwarz-type algorithm where a continuity condition on the incoming characteristic variables is imposed at the interfaces between neighboring subdomains. A multifrontal sparse direct solver is used at the subdomain level. The resulting domain decomposition strategy can be viewed as a hybrid iterative/direct solution method for the large, sparse and complex coefficients algebraic system resulting from the discretization of the time-harmonic Maxwell equations by a discontinuous Galerkin method.