47 research outputs found

    An adaptive discontinuous Galerkin technique with an orthogonal basis applied to compressible flow problems

    No full text

    Anisotropic adaptive simulation of transient flows using discontinuous Galerkin methods

    No full text
    An anisotropic adaptive analysis procedure based on a discontinuous Galerkin finite element discretization and local mesh modification of simplex elements is presented. The procedure is applied to transient two- and three-dimensional problems governed by Euler's equation. A smoothness indicator is used to isolate jump features where an aligned mesh metric field in specified. The mesh metric field in smooth portions of the domain is controlled by a Hessian matrix constructed using a variational procedure to calculate the second derivatives. The transient examples included demonstrate the ability of the mesh modification procedures to effectively track evolving interacting features of general shape as they move through a domain. Copyright (C) 2004 John Wiley Sons, Ltd

    Parallel algorithm oriented mesh database

    No full text

    Parallel Automated Adaptive Procedures for Unstructured Meshes

    No full text
    Contents 1. Introduction 2. Parallel Control of Evolving Meshes 2.1 Mesh Data Structure to Support Geometry-Based Automated Adaptive Analysis 2.2 Partition Communication and Mesh Migration 2.2.1 Requirements of PMDB and Related Efforts 2.2.2 Distributed Mesh Model and Notation Used 2.2.3 Data Structures 2.2.4 Mesh Migration 2.2.5 Scalability of Mesh Migration and Extensions 2.3 Dynamic Load Balancing of Adaptively Evolving Meshes 2.3.1 Geometry-Based Dynamic Balancing Procedures 2.3.2 Topologically-Based Dynamic Balancing Procedures 3. Parallel Automatic Mesh Generation 3.1 Introduction 3.2 Background and Meshing Approach 3.3 Sequential Region Meshing 3.3.1 Underlying Octree 3.3.2 Template Meshing of Interior Octants 3.3.3 Face Removal 3.4 Parallel Constructs Required 3.4.1 Octree and Mesh Data Structures 3.4.2 Multiple Octant Migration 3.4.3 Dynamic Repartitioning 3.5 Parallel Region Meshing 3.5.1 Underlying Octree 3.5.2 Template Meshing of Interior Octants 3.5.3 Face Remova

    CFD Application to Gun Muzzle Blast -A Validation Case Study

    No full text
    International audienceAccurate modeling of near-field wave propagation is critical to determine blast wave overpressure of large caliber muzzle brakes. Experimental testing to determine blast overpressure is costly, making CFD (Computational Fluid Dynamics) simulations of these flowfields a viable alternative. Techniques and specialized CFD codes are being developed in order to properly model the unsteady, very high-pressure flows of gun muzzle blast. 1-4 Two CFD codes, Fluent 6.1.11 (a prerelease version of Fluent) and the Discontinuous Galerkin Code (DG), developed at Rensselaer Polytechnic Institute were used in a comparison to experimental shadowgraph data from the 7.62 mm NATO rifle G3 using a DM-41 training round for the purpose of developing CFD modeling techniques and validation of the CFD codes. Unsteady grid adaption was used with both solvers in order to reduce solution error near unsteady blast waves and shocks. It is possible to get good results from Fluent with high levels of adaption, however DG, can model blast with courser grid adaption. It was also found that DG required an order of magnitude longer solution time than Fluent for a given number of grid elements. The 7.62 mm NATO G3 CFD precursor flow results matched experimental shadowgraph results well, however, the main propellant flow did not

    Parallel Adaptive Mesh Refinement and Redistribution on Distributed Memory Computers

    No full text
    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..
    corecore