变形法移动网格求解双曲型守恒律方程研究

在现有格式的基础上要提高偏微分方程数值解的分辨率,自适应移动网格技术是一种有效而且可行的方法。文中将文献[1]提出的自适应移动网格技术推广到三角形网格,并将该方法用于求解双曲型守恒量方程。用网格自适应技术求解守恒律问题时,当生成新网格之后,需要将旧网格上的函数值更新到新的网格,并保持物理量的守恒性。针对这个问题,文中提出了函数值更新过程中守恒型插值公式的具体形式,并针对二维双曲型守恒律方程进行了仿真实验,取得了满意的结果。     

Solutions of Multi-dimensional Hyperbolic Systems of Conservation Laws by Square Entropy Condition Satisfying Discontinuous Galerkin Method

In this paper, we study formally high-order accurate discontinuous Galerkin methods on general arbitrary grid for multi-dimensional hyperbolic systems of conservation laws [Cockburn, B., and Shu, C.-W. (1989, Math. Comput. 52, 411–435, 1998, J. Comput. Phys. 141, 199–224); Cockburn et al. (1989, J. Comput. Phys. 84, 90–113; 1990, Math. Comput. 54, 545–581). We extend the notion of E-flux [Osher (1985) SIAM J. Numer. Anal. 22, 947–961] from scalar to system, and found that after flux splitting upwind flux [Cockburn et al. (1989) J. Comput. Phys. 84, 90–113] is a Riemann solver free E-flux for systems. Therefore, we are able to show that the discontinuous Galerkin methods satisfy a cell entropy inequality for square entropy (in semidiscrete sense) if the multi-dimensional systems are symmetric. Similar result [Jiang and Shu (1994) Math. Comput. 62, 531–538] was obtained for scalar equations in multi-dimensions. We also developed a second-order finite difference version of the discontinuous Galerkin methods. Numerical experiments have been obtained with excellent results.      

Mesh Redistribution Strategies and Finite Element Schemes for Hyperbolic Conservation Laws

In this work we consider a new class of Relaxation Finite Element schemes for hyperbolic conservation laws, with more stable behavior on the limit area of the relaxation parameter. Combining this scheme with an efficient adapted spatial redistribution process considered also in this work, we form a robust scheme of controllable resolution. The results on a number of test problems show that this scheme can produce entropic-approximations of high resolution, even on the limit of the relaxation parameter where the scheme lacks of the relaxation mechanism. Thus we experimentally conclude that the proposed spatial redistribution process, has by its own interesting stabilization properties for computational solutions of conservation law problems.     

A Discontinuous Galerkin Method for Three-Dimensional Shallow Water Equations

We describe the application of a local discontinuous Galerkin method to the numerical solution of the three-dimensional shallow water equations. The shallow water equations are used to model surface water flows where the hydrostatic pressure assumption is valid. The authors recently developed a DG\linebreak method for the depth-integrated shallow water equations. The method described here is an extension of these ideas to non-depth-integrated models. The method and its implementation are discussed, followed by numerical examples on several test problems.This revised version was published online in July 2005 with corrected volume and issue numbers.     

Element-by-Element Post-Processing of Discontinuous Galerkin Methods for Timoshenko Beams

In this paper, we consider discontinuous Galerkin approximations to the solution of Timoshenko beam problems and show how to post-process them in an element-by-element fashion to obtain a far better approximation. Indeed, we show numerically that, if polynomials of degree p≥1 are used, the post-processed approximation converges with order 2p+1 in the L ^∞-norm throughout the domain. This has to be contrasted with the fact that before post-processing, the approximation converges with order p+1 only. Moreover, we show that this superconvergence property does not deteriorate as the the thickness of the beam becomes extremely small.Supported in part by NSF Grant DMS-0411254 and by the University of Minnesota Supercomputing Institute.     

Unstructured Grid-Based Discontinuous Galerkin Method for Broadband Electromagnetic Simulations

A parallel, unstructured, high-order discontinuous Galerkin method is developed for the time-dependent Maxwell's equations, using simple monomial polynomials for spatial discretization and a fourth-order Runge–Kutta scheme for time marching. Scattering results for a number of validation cases are computed employing polynomials of up to third order. Accurate solutions are obtained on coarse meshes and grid convergence is achieved, demonstrating the capabilities of the scheme for time-domain electromagnetic wave scattering simulations.     

Multirate Timestepping Methods for Hyperbolic Conservation Laws

This paper constructs multirate time discretizations for hyperbolic conservation laws that allow different timesteps to be used in different parts of the spatial domain. The proposed family of discretizations is second order accurate in time and has conservation and linear and nonlinear stability properties under local CFL conditions. Multirate timestepping avoids the necessity to take small global timesteps (restricted by the largest value of the Courant number on the grid) and therefore results in more efficient algorithms. Numerical results obtained for the advection and Burgers’ equations confirm the theoretical findings. This work was supported by the National Science Foundation through award NSF CCF-0515170.     

A Discontinuous Galerkin Method for Linear Symmetric Hyperbolic Systems in Inhomogeneous Media

The Discontinuous Galerkin (DG) method provides a powerful tool for approximating hyperbolic problems. Here we derive a new space-time DG method for linear time dependent hyperbolic problems written as a symmetric system (including the wave equation and Maxwell’s equations). The main features of the scheme are that it can handle inhomogeneous media, and can be time-stepped by solving a sequence of small linear systems resulting from applying the method on small collections of space-time elements. We show that the method is stable provided the space-time grid is appropriately constructed (this corresponds to the usual time-step restriction for explicit methods, but applied locally) and give an error analysis of the scheme. We also provide some simple numerical tests of the algorithm applied to the wave equation in two space dimensions (plus time).This revised version was published online in July 2005 with corrected volume and issue numbers.     

Mixed Discontinuous Galerkin Finite Element Method for the Biharmonic Equation

In this paper, we first split the biharmonic equation Δ² u=f with nonhomogeneous essential boundary conditions into a system of two second order equations by introducing an auxiliary variable v=Δu and then apply an hp-mixed discontinuous Galerkin method to the resulting system. The unknown approximation v _h of v can easily be eliminated to reduce the discrete problem to a Schur complement system in u _h , which is an approximation of u. A direct approximation v _h of v can be obtained from the approximation u _h of u. Using piecewise polynomials of degree p≥3, a priori error estimates of u−u _h in the broken H ¹ norm as well as in L ² norm which are optimal in h and suboptimal in p are derived. Moreover, a priori error bound for v−v _h in L ² norm which is suboptimal in h and p is also discussed. When p=2, the preset method also converges, but with suboptimal convergence rate. Finally, numerical experiments are presented to illustrate the theoretical results. Supported by DST-DAAD (PPP-05) project.     

变形法移动网格求解双曲型守恒律方程研究

在现有格式的基础上要提高偏微分方程数值解的分辨率,自适应移动网格技术是一种有效而且可行的方法。文中将文献[1]提出的自适应移动网格技术推广到三角形网格,并将该方法用于求解双曲型守恒量方程。用网格自适应技术求解守恒律问题时,当生成新网格之后,需要将旧网格上的函数值更新到新的网格,并保持物理量的守恒性。针对这个问题,文中提出了函数值更新过程中守恒型插值公式的具体形式,并针对二维双曲型守恒律方程进行了仿真实验,取得了满意的结果。     

Minimal Stabilization for Discontinuous Galerkin Finite Element Methods for Hyperbolic Problems

We consider a discontinuous Galerkin finite element method for the advection–reaction equation in two space–dimensions. For polynomial approximation spaces of degree greater than or equal to two on triangles we propose a method where stability is obtained by a penalization of only the upper portion of the polynomial spectrum of the jump of the solution over element edges. We prove stability in the standard h-weighted graphnorm and obtain optimal order error estimates with respect to mesh-size. The second author was supported by the Swiss National Science Foundation.     

An Analysis of the Minimal Dissipation Local Discontinuous Galerkin Method for Convection–Diffusion Problems

We analyze the so-called the minimal dissipation local discontinuous Galerkin method (MD-LDG) for convection–diffusion or diffusion problems. The distinctive feature of this method is that the stabilization parameters associated with the numerical trace of the flux are identically equal to zero in the interior of the domain; this is why its dissipation is said to be minimal. We show that the orders of convergence of the approximations for the potential and the flux using polynomials of degree k are the same as those of all known discontinuous Galerkin methods, namely, (k + 1) and k, respectively. Our numerical results verify that these orders of convergence are sharp. The novelty of the analysis is that it bypasses a seemingly indispensable condition, namely, the positivity of the above mentioned stabilization parameters, by using a new, carefully defined projection tailored to the very definition of the numerical traces.     

One-sided Post-processing for the Discontinuous Galerkin Method Using ENO Type Stencil Choosing and the Local Edge Detection Method

In a previous paper by Ryan and Shu [Ryan, J. K., and Shu, C.-W. (2003). \hboxMethods Appl. Anal. 10(2), 295–307], a one-sided post-processing technique for the discontinuous Galerkin method was introduced for reconstructing solutions near computational boundaries and discontinuities in the boundaries, as well as for changes in mesh size. This technique requires prior knowledge of the discontinuity location in order to determine whether to use centered, partially one-sided, or one-sided post-processing. We now present two alternative stencil choosing schemes to automate the choice of post-processing stencil. The first is an ENO type stencil choosing procedure, which is designed to choose centered post-processing in smooth regions and one-sided or partially one-sided post-processing near a discontinuity, and the second method is based on the edge detection method designed by Archibald, Gelb, and Yoon [Archibald, R., Gelb, A., and Yoon, J. (2005). SIAM J. Numeric. Anal. 43, 259–279; Archibald, R., Gelb, A., and Yoon, J. (2006). Appl. Numeric. Math. (submitted)]. We compare these stencil choosing techniques and analyze their respective strengths and weaknesses. Finally, the automated stencil choices are applied in conjunction with the appropriate post-processing procedures and it is determine that the resulting numerical solutions are of the correct order.     

An hp-Analysis of the Local Discontinuous Galerkin Method for Diffusion Problems

We present an hp-error analysis of the local discontinuous Galerkin method for diffusion problems, considering unstructured meshes with hanging nodes and two- and three-dimensional domains. Our estimates are optimal in the meshsize h and slightly suboptimal in the polynomial approximation order p. Optimality in p is achieved for matching grids and polynomial boundary conditions.     

An A Posteriori Error Estimate for the Local Discontinuous Galerkin Method Applied to Linear and Nonlinear Diffusion Problems

In this paper we present a new residual-based reliable a posteriori error estimator for the local discontinuous Galerkin approximations of linear and nonlinear diffusion problems in polygonal regions of R ². Our analysis, which applies to convex and nonconvex domains, is based on Helmholtz decompositions of the error and a suitable auxiliary polynomial function interpolating the Dirichlet datum. Several examples confirming the reliability of the estimator and providing numerical evidences for its efficiency are given. Furthermore, the associated adaptive method, which considers meshes with and without hanging nodes, is shown to be much more efficient than a uniform refinement to compute the discrete solutions. In particular, the experiments illustrate the ability of the adaptive algorithm to localize the singularities of each problem.Mathematics Subject Classifications (1991). 65N30This revised version was published online in July 2005 with corrected volume and issue numbers.     

A Discontinuous Spectral Element Method for the Level Set Equation

Level set methodology is crucially pertinent to tracking moving singular surfaces or thin fronts with steep gradients in the numerical solutions of partial differential equations governing complex flow fields. This methodology must be consistent with the basic solution technique for the partial differential equations. To this end, a discontinuous spectral element approach is developed for level set advection and reinitialization as these methods are becoming increasingly popular for the solution of the fluid dynamic problems. Example computations are provided, which demonstrate the high order accuracy of the method.     

Discontinuous Galerkin Method for Linear Free-Surface Gravity Waves

In this paper, we discuss a discontinuous Galerkin finite (DG) element method for linear free surface gravity waves. We prove that the algorithm is unconditionally stable and does not require additional smoothing or artificial viscosity terms in the free surface boundary condition to prevent numerical instabilities on a non-uniform mesh. A detailed error analysis of the full time-dependent algorithm is given, showing that the error in the wave height and velocity potential in the L²-norm is in both cases of optimal order and proportional to O(Δt²+h^p+1), without the need for a separate velocity reconstruction, with p the polynomial order, h the mesh size and Δt the time step. The error analysis is confirmed with numerical simulations. In addition, a Fourier analysis of the fully discrete scheme is conducted which shows the dependence of the frequency error and wave dissipation on the time step and mesh size. The algebraic equations for the DG discretization are derived in a way suitable for an unstructured mesh and result in a symmetric positive definite linear system. The algorithm is demonstrated on a number of model problems, including a wave maker, for discretizations with accuracy ranging from second to fourth order.This revised version was published online in July 2005 with corrected volume and issue numbers.     

Discontinuous Galerkin Methods Applied to Shock and Blast Problems

We describe procedures to model transient shock interaction problems using discontinuous Galerkin methods to solve the compressible Euler equations. The problems are motivated by blast flows surrounding cannons with perforated muzzle brakes. The goal is to predict shock strengths and blast over pressure. This application illustrates several computational difficulties. The software must handle complex geometries. The problems feature strong interacting shocks, with pressure ratios on the order of 1000 as well as weaker precursor shocks traveling rearward that also must be accurately captured. These aspects are addressed using anisotropic mesh adaptation. A shock detector is used to control the adaptation and limiting. We also describe procedures to track projectile motion in the flow by a level-set procedure.This revised version was published online in July 2005 with corrected volume and issue numbers.     

H-adaptive Mesh Method with Double Tolerance Adaptive Strategy for Hyperbolic Conservation Laws

The numerical method used to solve hyperbolic conservation laws is often an explicit scheme. As a commonly used technique to improve the quality of numerical simulation, the $h$ -adaptive mesh method is adopted to resolve sharp structures in the solution. Since the computational costs of altering the mesh and solving the PDEs are comparable, too often the mesh adaption triggered may bring down the overall efficiency of solving hyperbolic conservation laws using $h$ -adaptive mesh method. In this paper, we propose a so-called double tolerance adaptive strategy to optimize the overall numerical efficiency by reducing the number of mesh adaptions, as well as preserving the quality of the numerical solution. Numerical results are presented to demonstrate the robustness and effectiveness of our $h$ -adaptive algorithm using the double tolerance adaptive strategy.