Vortex-dominated conical-flow computations using unstructured adaptively-refined meshes
Explore the source record for details and available documents.
Batina, John T.↗
SEARCH · Engineering Papers
Results for “Unstructured mesh”
Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.
Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.
Load Balancing Sequences of Unstructured Adaptive Grids
Mesh adaption is a powerful tool for efficient unstructured grid computations but causes load imbalance on multiprocessor systems. To address this problem, we have developed PLUM, an automatic portable framework for performing adaptive large-scale numerical computations in a message-passing environment. This paper makes several important additions to our previous work. First, a new remapping cost model is presented and empirically validated on an SP2. Next, our load balancing strategy is applied to sequences of dynamically adapted unstructured grids. Results indicate that our framework is effective on many processors for both steady and unsteady problems with several levels of adaption. Additionally, we demonstrate that a coarse starting mesh produces high quality load balancing, at a fraction of the cost required for a fine initial mesh. Finally, we show that the data remapping overhead can be significantly reduced by applying our heuristic processor reassignment algorithm.
Biswas, Rupak↗
Wavelet-based local mesh refinement for rainfall–runoff simulations
A wavelet-based local mesh refinement (wLMR) strategy is designed to generate multiresolution and unstructured triangular meshes from real digital elevation model (DEM) data for efficient hydrological simulations at the catchment scale. The wLMR strategy is studied considering slope- and curvature-based refinement criteria to analyze DEM inputs: the slope-based criterion uses bed elevation data as input to the wLMR strategy, whereas the curvature-based criterion feeds the bed slope data into it. The performance of the wLMR meshes generated by these two criteria is compared for hydrological simulations; first, using three analytical tests with the systematic variation in topography types and then by reproducing laboratory- and real-scale case studies. The bed elevation on the wLMR meshes and their simulation results are compared relative to those achieved on the finest uniform mesh. Repeated analytical tests show that the slope- and curvature-based criteria are equally effective with the wLMR strategy, and that it is easier to decide which criterion to take in relation to the (regular) shape of the topography. For the realistic case studies: (i) slope analysis provides a better metric to assess the correlation of a wLMR mesh to the fine uniform mesh and (ii) both criteria predict outlet hydrographs with a close predictive accuracy to that on the uniform mesh, but the curvature-based criterion is found to slightly better capture the channeling patterns of real DEM data.
54 ENVIRONMENTAL SCIENCES↗
Enhance BISON Metal Fuel Transient Models and Enable Assessment Based on Out-of-Pile Transient Experiments
In this report, the activities and achievements made by Argonne National Laboratory for the Nuclear Energy Advanced Modeling and Simulation (NEAMS) BISON code metallic fuel validation and verification (V&V) project in FY2023, with a focus on the capability development and assessment case development for the out-of-pile transient experiments, are summarized. The liquid cladding penetration model was improved based on a comprehensive set of fuel behavior test apparatus (FBTA) test results. The new model was implemented into BISON along with a simple model to account for fuel melting effects. The metallic fuel meshing capability was also upgraded to allow local refinement using unstructured triangular mesh. Based on the previous success in developing the BISON-FIPD integration powered BISON assessment case, this database enabled BISON evaluation and V&V capability was expanded to the out-of-pile transient experiments by introducing BISON-OPTD integration. A series of initial out-of-pile transient assessment cases were implemented into BISON to provide powerful platforms to evaluate current BISON’s capabilities in simulating metallic fuel performance during out-of-pile transients. The established capabilities will also benefit the calibration and V&V of future advanced mechanistic models.
11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
Parallel Implementation of an Adaptive Scheme for 3D Unstructured Grids on the SP2
Dynamic mesh adaption on unstructured grids is a powerful tool for computing unsteady flows that require local grid modifications to efficiently resolve solution features. For this work, we consider an edge-based adaption scheme that has shown good single-processor performance on the C90. We report on our experience parallelizing this code for the SP2. Results show a 47.OX speedup on 64 processors when 10% of the mesh is randomly refined. Performance deteriorates to 7.7X when the same number of edges are refined in a highly-localized region. This is because almost all mesh adaption is confined to a single processor. However, this problem can be remedied by repartitioning the mesh immediately after targeting edges for refinement but before the actual adaption takes place. With this change, the speedup improves dramatically to 43.6X.
Oliker, Leonid↗
Parallel implementation of an adaptive scheme for 3D unstructured grids on the SP2
Dynamic mesh adaption on unstructured grids is a powerful tool for computing unsteady flows that require local grid modifications to efficiently resolve solution features. For this work, we consider an edge-based adaption scheme that has shown good single-processor performance on the C90. We report on our experience parallelizing this code for the SP2. Results show a 47.0X speedup on 64 processors when 10 percent of the mesh is randomly refined. Performance deteriorates to 7.7X when the same number of edges are refined in a highly-localized region. This is because almost all the mesh adaption is confined to a single processor. However, this problem can be remedied by repartitioning the mesh immediately after targeting edges for refinement but before the actual adaption takes place. With this change, the speedup improves dramatically to 43.6X.
Strawn, Roger C.↗
Parallel implicit unstructured grid Euler solvers
A mesh-vertex finite volume scheme for solving the Euler equations on triangular unstructured meshes is implemented on an MIMD (multiple instruction/multiple data stream) parallel computer. An explicit four-stage Runge-Kutta scheme is used to solve two-dimensional flow problems. A family of implicit schemes is also developed to solve these problems, where the linear system that arises at each time step is solved by a preconditioned GMRES algorithm. Two partitioning strategies are employed, one that partitions triangles and the other that partitions vertices. The choice of the preconditioner in a distributed memory setting is discussed. All the methods are compared both in terms of elapsed times and convergence rates. It is shown that the implicit schemes offer adequate parallelism at the expense of minimal sequential overhead. The use of a global coarse grid to further minimize this overhead is also investigated. The schemes are implemented on a distributed memory parallel computer, the iPSC/860.
Venkatakrishnan, V.↗
Parallel implicit unstructured grid Euler solvers
A mesh-vertex finite volume scheme for solving the Euler equations on triangular unstructured meshes is implemented on a multiple-instruction/multiple-data stream parallel computer. An explicit four-stage Runge-Kutta scheme is used to solve two-dimensional flow problems. A family of implicit schemes is also developed to solve these problems, where the linear system that arises at each time step is solved by a preconditioned GMRES algorithm. Two partitioning strategies are employed: one that partitions triangles and the other that partitions vertices. The choice of the preconditioner in a distributed memory setting is discussed. All of the methods are compared both in terms of elapsed times and convergence rates. It is shown that the implicit schemes offer adequate parallelism at the expense of minimal sequential overhead. The use of a global coarse grid to further minimize this overhead is also investigated. The schemes are implemented on a distributed memory parallel computer, the Intel iPSC/860.
TRT-THEORETICAL↗
Slices: A Scalable Partitioner for Finite Element Meshes
A parallel partitioner for partitioning unstructured finite element meshes on distributed memory architectures is developed. The element based partitioner can handle mixtures of different element types. All algorithms adopted in the partitioner are scalable, including a communication template for unpredictable incoming messages, as shown in actual timing measurements.
partitioner finite element meshes parallel computi↗
Two-dimensional Euler computations on a triangular mesh using an upwind, finite-volume scheme
A numerical procedure was developed for the finite-volume solution of the Euler equations on unstructured triangular meshes based on a flux-difference split upwind method. Techniques for implementing Roe's (1985) approximate Reimann solver together with the preprocessing MUSCL differencing on unstructured grids are presented. Applications and comparisons with structured grid problems are carried out for a supersonic shock reflection problem, the supersonic flow over a blunt body, the transonic flow over NACA 0012 and RAE 2822 airfoils, and the flow about a double element Karman-Trefftz airfoil.
Whitaker, D. L.↗
Mapping unstructured grid computations to massively parallel computers
Investigated here is this mapping problem: assign the tasks of a parallel program to the processors of a parallel computer such that the execution time is minimized. First, a taxonomy of objective functions and heuristics used to solve the mapping problem is presented. Next, we develop a highly parallel heuristic mapping algorithm, called Cyclic Pairwise Exchange (CPE), and discuss its place in the taxonomy. CPE uses local pairwise exchanges of processor assignments to iteratively improve an initial mapping. A variety of initial mapping schemes are tested and recursive spectral bipartitioning (RSB) followed by CPE is shown to result in the best mappings. For the test cases studied here, problems arising in computational fluid dynamics and structural mechanics on unstructured triangular and tetrahedral meshes, RSB and CPE outperform methods based on simulated annealing. Much less time is required to do the mapping and the results obtained are better. Compared with random and naive mappings, RSB and CPE reduce the communication time two fold for the test problems used. Finally, we use CPE in two applications on a CM-2. The first application is a data parallel mesh-vertex upwind finite volume scheme for solving the Euler equations on 2-D triangular unstructured meshes. CPE is used to map grid points to processors. The performance of this code is compared with a similar code on a Cray-YMP and an Intel iPSC/860. The second application is parallel sparse matrix-vector multiplication used in the iterative solution of large sparse linear systems of equations. We map rows of the matrix to processors and use an inner-product based matrix-vector multiplication. We demonstrate that this method is an order of magnitude faster than methods based on scan operations for our test cases.
Hammond, Steven Warren↗
High Energy Boundary Conditions for a Cartesian Mesh Euler Solver
Inlets and exhaust nozzles are common place in the world of flight. Yet, many aerodynamic simulation packages do not provide a method of modelling such high energy boundaries in the flow field. For the purposes of aerodynamic simulation, inlets and exhausts are often fared over and it is assumed that the flow differences resulting from this assumption are minimal. While this is an adequate assumption for the prediction of lift, the lack of a plume behind the aircraft creates an evacuated base region thus effecting both drag and pitching moment values. In addition, the flow in the base region is often mis-predicted resulting in incorrect base drag. In order to accurately predict these quantities, a method for specifying inlet and exhaust conditions needs to be available in aerodynamic simulation packages. A method for a first approximation of a plume without accounting for chemical reactions is added to the Cartesian mesh based aerodynamic simulation package CART3D. The method consists of 3 steps. In the first step, a components approach where each triangle is assigned a component number is used. Here, a method for marking the inlet or exhaust plane triangles as separate components is discussed. In step two, the flow solver is modified to accept a reference state for the components marked inlet or exhaust. In the third step, the flow solver uses these separated components and the reference state to compute the correct flow condition at that triangle. The present method is implemented in the CART3D package which consists of a set of tools for generating a Cartesian volume mesh from a set of component triangulations. The Euler equations are solved on the resulting unstructured Cartesian mesh. The present methods is implemented in this package and its usefulness is demonstrated with two validation cases. A generic missile body is also presented to show the usefulness of the method on a real world geometry.
Pandya, Shishir↗
Accuracy of an unstructured-grid upwind-Euler algorithm for the ONERA M6 wing
Improved algorithms for the solution of the three-dimensional, time-dependent Euler equations are presented for aerodynamic analysis involving unstructured dynamic meshes. The improvements have been developed recently to the spatial and temporal discretizations used by unstructured-grid flow solvers. The spatial discretization involves a flux-split approach that is naturally dissipative and captures shock waves sharply with at most one grid point within the shock structure. The temporal discretization involves either an explicit time-integration scheme using a multistage Runge-Kutta procedure or an implicit time-integration scheme using a Gauss-Seidel relaxation procedure, which is computationally efficient for either steady or unsteady flow problems. With the implicit Gauss-Seidel procedure, very large time steps may be used for rapid convergence to steady state, and the step size for unsteady cases may be selected for temporal accuracy rather than for numerical stability. Steady flow results are presented for both the NACA 0012 airfoil and the Office National d'Etudes et de Recherches Aerospatiales M6 wing to demonstrate applications of the new Euler solvers. The paper presents a description of the Euler solvers along with results and comparisons that assess the capability.
Batina, John T.↗
Self-Avoiding Walks over Adaptive Triangular Grids
In this paper, we present a new approach to constructing a "self-avoiding" walk through a triangular mesh. Unlike the popular approach of visiting mesh elements using space-filling curves which is based on a geometric embedding, our approach is combinatorial in the sense that it uses the mesh connectivity only. We present an algorithm for constructing a self-avoiding walk which can be applied to any unstructured triangular mesh. The complexity of the algorithm is O(n x log(n)), where n is the number of triangles in the mesh. We show that for hierarchical adaptive meshes, the algorithm can be easily parallelized by taking advantage of the regularity of the refinement rules. The proposed approach should be very useful in the run-time partitioning and load balancing of adaptive unstructured grids.
Heber, Gerd↗
Application of Quaternions for Mesh Deformation
A new three-dimensional mesh deformation algorithm, based on quaternion algebra, is introduced. A brief overview of quaternion algebra is provided, along with some preliminary results for two-dimensional structured and unstructured viscous mesh deformation.
Samareh, Jamshid A.↗
Application of Quaternions for Mesh
A new three dimensional mesh deformation algorithm, based on quaternion algebra, is introduced. A brief overview of quaternion algebra is provided, along with some preliminary results for two-dimensional structured and unstructured viscous mesh deformation.
Samareh, Jamshid A.↗
An implicit-in-time DPG formulation of the 1D1V Vlasov-Poisson equations
Efficient solution of the Vlasov equation, which can be up to six-dimensional, is key to the simulation of many difficult problems in plasma physics. The discontinuous Petrov-Galerkin (DPG) finite element methodology provides a framework for the development of stable (in the sense of Ladyzhenskaya–Babuška–Brezzi conditions) finite element formulations, with built-in mechanisms for adaptivity. While DPG has been studied extensively in the context of steady-state problems and to a lesser extent with space-time discretizations of transient problems, relatively little attention has been paid to time-marching approaches. In the present work, we study a first application of time-marching DPG to the Vlasov equation, using backward Euler for a Vlasov-Poisson discretization. We demonstrate adaptive mesh refinement for two problems: the two-stream instability problem, and a cold diode problem. Furthermore, we believe the present work is novel both in its application of unstructured adaptive mesh refinement (as opposed to block-structured adaptivity, which has been studied previously) in the context of Vlasov-Poisson, as well as in its application of DPG to the Vlasov-Poisson system. We also discuss extensive additions to the Camellia library in support of both the present formulation as well as extensions to higher dimensions, Maxwell equations, and space-time formulations.
97 MATHEMATICS AND COMPUTING↗
Laminar and turbulent flow computations of Type 4 shock-shock interference aerothermal loads using unstructured grids
This report presents computations for the Type 4 shock-shock interference flow under laminar and turbulent conditions using unstructured grids. Mesh adaptation was accomplished by remeshing, refinement, and mesh movement. Two two-equation turbulence models were used to analyze turbulent flows. The mean flow governing equations and the turbulence governing equations are solved in a coupled manner. The solution algorithm and the details pertaining to its implementation on unstructured grids are described. Computations were performed at two different freestream Reynolds numbers at a freestream Mach number of 11. Effects of the variation in the impinging shock location are studied. The comparison of the results in terms of wall heat flux and wall pressure distributions is presented.
Vemaganti, Gururaja R.↗