this paper, we study the Local Discontinuous Galerkin methods for nonlinear, time-dependent convection-diffusion systems. These methods are an extension of the Runge-Kutta Discontinuous Galerkin methods for purely hyperbolic systems to convection-diffusion systems and share with those methods their high parallelizability, their high-order formal accuracy, and their easy handling of complicated geometries, for convection dominated problems. It is proven that for scalar equations, the Local Discontinuous Galerkin methods are L

In this paper, we present an overview of the evolution of the discontinuous Galerkin methods since their introduction in 1973 by Reed and Hill, in the framework of neutron transport, until their most recent developments. We show how these methods made their way into the main stream of computational fluid dynamics and how they are quickly finding use in a wide variety of applications. We review the theoretical and algorithmic aspects of these methods as well as their applications to equations including nonlinear conservation laws, the compressible Navier-Stokes equations, and Hamilton-Jacobi-like equations.

Conservation laws ae solved by a local Gaerkin finite element procedure with adapfive space-time mesh refinement ad explicit time integration. The Courat stability condition is used to select smaller time steps on smaller elements of the mesh, thereby greatly increasing efficiency relative to methods having a single global time step. Processor load imbalaces, introduced at adaptive enrichment steps, are corrected by using traversals of an octtee representing a spatial decomposition of the domain. To accommodate the variable time steps, octtee partitioning is extended to use weights derived from element size. Partition boundary smoothing reduces the communications volume of partitioning procedures for a modest cost. Computational results comparing parallel octtee ad inertial partitioning procedures ae presented for the three-dimensional Euler equations of compressible flow solved on an IBM SP2 computer.

. In this paper, we present a discontinuous Galerkin finite element method for solving the nonlinear Hamilton-Jacobi equations. This method is based on the Runge-Kutta discontinuous Galerkin finite element method for solving conservation laws. The method has the flexibility of treating complicated geometry by using arbitrary triangulation, can achieve high order accuracy with a local, compact stencil, and are suited for efficient parallel implementation. One and two dimensional numerical examples are given to illustrate the capability of the method. At least k- th order of accuracy is observed for smooth problems when k-th degree polynomials are used, and derivative singularities are resolved well without oscillations even without limiters. Key words. Hamilton-Jacobi Equations, discontinuous Galerkin, high order accuracy. AMS subject classifications. 65M60, 70H20 1. Introduction. In this paper we consider the numerical solutions of HamiltonJacobi (HJ) equations ' t + H(' x1 ; :::; ...

this paper, we have focused on describing and comparing several load balancing schemes. Comparisons by timing are difficult, since times vary between runs having the same parameters. The high-speed switch of the IBM SP2 computer is a shared resource that affects run times. More subtle effects can result from differences in the order in which messages used for migration are processed. Changes in the order in which those messages are received and integrated into the local MDB result in different traversal orders of the mesh entities. These differences cause small changes in load balancings and coarsenings. While such differences in meshes and partitionings do not affect the solution accuracy, they can cause sufficient changes in efficiency to make precise timings difficult. Qualitatively, PSIRB produced the best partitions (measured as a function of total analysis time). Octree-generated partitions were comparable but resulted in slightly longer solution times. In both cases, one or two iterations of partition boundary smoothing led to a quality improvement. ITB by itself resulted in poorer partition quality, but is useful when mesh changes are small between computational stages. Predictive enrichment provided su21 perior performance to our current enrichment process with transient problems where there are frequent enrichment and balancing steps. Enhancements to the existing load balancing procedures and the implementation of new ones are under investigation. Improvements in the slice-by-slice technique used by ITB for migration are necessary. Experiments with geometrical methods that use the spatial location of elements relative to the centroids of sending and receiving processors showed promise at reducing the number of processor interconnections. Vidwans et al. [39] pr...

Introduction Computational methods for aeroacoustics must possess accuracy properties that exceed those of conventional second-order computational fluid dynamics (CFD) methods. At the same time, many problems of interest involve complex geometries that are not easily treated by common high-order methods that usually require a smooth, structured grid. In addition to the geometrically complex problem, we are particularly interested in strongly nonlinear flows that contain shock waves as a major source of sound generation, such as in the case of jet noise. In an effort to satisfy these requirements, the relatively untried discontinuous Galerkin (DG) method is being tested for hyperbolic problems. Some advantages of this approach include the ease with which the method can be applied to both structured and unstructured grids and its suitability for parallel computer architectures. The approach also has several useful mathematical properties. Johnson and Pitkarata 1 proved

Introduction The finite element method (FEM) has become a standard analysis tool for solving partial differential equations (PDEs). Computationally demanding threedimensional problems make adaptive methods and parallel computation essential. Adaptive FEMs provide reliability, robustness, and time and space efficiency. In such a method, the computational domain is discretized into a mesh. During the adaptive solution process, portions of the mesh may be refined or coarsened (h-refinement) or moved to follow evolving phenomena (r-refinement). The method order may also be varied (p-refinement). Each adaptive process concentrates the computational effort in areas where the solution resolution would otherwise be inadequate [7]. Conventional array-based data representations, which work well for fixed-mesh solutions, are not wellsuited to solutions involving mesh adaptivity [1]. Traversal of the data must be efficient in all cases, but w

We describe an adaptive hp-refinement local finite element procedure for the parallel solution of hyperbolic systems of conservation laws on rectangular domains. The local finite element procedure utilizes spaces of piecewise-continuous polynomials of arbitrary degree and coordinated explicit Runge-Kutta temporal integration. A solution limiting procedure produces monotonic solutions near discontinuities while maintaining high-order accuracy near smooth extrema. A modified tiling procedure maintains processor load balance on parallel, distributed-memory MIMD computers by migrating finite elements between processors in overlapping neighborhoods to produce locally balanced computations. Grids are stored in tree data structures, with finer grids being offspring of coarser ones. Within each grid, AVL trees simplify the transfer of information between neighboring processors and the insertion and deletion of elements as they migrate between processors. Computations involving Burger...

A procedure to support parallel refinement and redistribution of two dimensional unstructured finite element meshes on distributed memory computers is presented. The procedure uses the mesh topological entity hierarchy as the underlying data structures to easily support the required adjacency information. Mesh refinement is done by employing links back to the geometric representation to place new nodes on the boundary of the domain directly on the curved geometry. The refined mesh is then redistributed by an iterative heuristic based on the Leiss/Reddy [9] load balancing criteria. A fast parallel tree edge-coloring algorithm is used to pair processors having adjacent partitions and forming a tree structure as a result of Leiss/Reddy load request criteria. Excess elements are iteratively migrated from heavily loaded to less loaded processors until load balancing is achieved. The system is implemented on a massively parallel MasPar MP-2 system with a SIMD style of computation and uses me...

This paper describes a parallel algorithm based on discontinuous hp-finite element approximations of linear, scalar, hyperbolic conservation laws. The paper focuses on the development of an effective parallel adaptive strategy for such problems. Numerical experiments suggest that these techniques are highly parallelizable and exponentially convergent, thereby yielding efficiency many times superior to conventional schemes for hyperbolic problems. 1