Search NASA⌕ Search

SEARCH · Search NASA

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.

At least 1,117 records · Page 62

Generation of three-dimensional unstructured grids by the advancing-front method

The generation of three-dimensional unstructured grids using the advancing-front technique is described. While this generation technique has been shown to be effective for the generation of unstructured grids in two dimensions, its extension to three-dimensional regions required the development of surface definition software and sophisticated data structures to avoid excessive CPU-time overheads for the search operations involved. After obtaining an initial triangulation of the surfaces, tetrahedrons are generated by successively deleting faces from the generation front. Details of the mesh generation algorithm are given, together with examples and timings.

Lohner, Rainald↗

New modelling capabilities in IDT

This work concerns the enhanced modelling capabilities of the discrete ordinates transport solver IDT. The novelties introduced allow for modelling unstructured geometries composed by a collection of X/Y segments and circles, and the use of reciprocity and conservation relations reduce the memory imprint as well as the computational cost of the method. IDT decomposes geometries in modular Cartesian patterns, which are the so-called Heterogeneous Cartesian Cells (HCCs), containing a chunk of the original unstructured geometries. Each HCC can be then discretized by superimposing a XY grid to refine locally the HCC. Unlike the most popular MOC, IDT performs the spatial sweeping by directional collision probabilities instead of trajectories. The sources and interface angular fluxes are expanded up to linear order. The accuracy of ray-tracing, the memory imprints together with the novel mesh refinement capabilities have been verified. A first set of preliminary results on PWR lattice problems will be presented in this paper.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Near-field supersonic flow predictions by an adaptive unstructured tetrahedral grid solver

Applicability of a three-dimensional solution adaptive unstructured tetrahedral Euler flow solver about generic models for near-field sonic boom pressure signature predictions is evaluated. Comparisons of computational and experimental data demonstrates the capability of the method for predicting inviscid solutions useful for high speed calculations about simple 3-D geometries. The approach has promising features and results indicate potential for application to more complex configurations. The mesh generation is based on the advancing front technique, and steady state solutions of the Euler equations are achieved by explicit time integration. Spatial discretization uses the Taylor-Galerkin approach; an alternate time integration, based on the Runge-Kutta method, is also included. The solution-adaptive grid procedure is based on either remeshing or mesh refinement techniques. An alternative geometry-adaptive grid procedure has also been incorporated.

Djomehri, M. J.↗

A consistent and conservative scheme for MHD flows with complex boundaries on an unstructured Cartesian adaptive system

The numerical simulation of Magnetohydrodynamics (MHD) flows with complex boundaries has been a topic of great interest in the development of a fusion reactor blanket for the difficulty to accurately simulate the Hartmann layers and side layers along arbitrary geometries. An adaptive version of a consistent and conservative scheme has been developed for simulating the MHD flows. Besides, the present study forms the first attempt to apply the cut-cell approach for irregular wall-bounded MHD flows, which is more flexible and conveniently implemented under adaptive mesh refinement (AMR) technique. It employs a Volume-of-Fluid (VOF) approach to represent the fluid–conducting wall interface that makes it possible to solve the fluid–solid coupling magnetic problems, emphasizing at how electric field solver is implemented when conductivity is discontinuous in cut-cell. For the irregular cut-cells, the conservative interpolation technique is applied to calculate the Lorentz force at cell-center. On the other hand, it will be shown how consistent and conservative scheme is implemented on fine/coarse mesh boundaries when using AMR technique. Then, the applied numerical schemes are validated by five test simulations and excellent agreement was obtained for all the cases considered, simultaneously showed good consistency and conservative properties.

42 ENGINEERING↗

Enhancing Scalability for FUN3D Rotorcraft Simulations with Yoga: an Overset Grid Assembler

FUN3D, an unstructured grid Navier-Stokes CFD code is capable of overset grid simu- lations, but does not have an internal method for assembling an overset grid system from a group of component grids. FUN3D currently relies on the third party codes Suggar++ and DiRTlib to perform domain assembly and provide intergrid connectivity for overset simulations. Rotorcraft simulations with moving, deforming blades require domain assembly and mesh deformation at each time step. For these simulations, the three primary drivers of computational cost for each time step are: deforming the mesh, performing domain assembly, and performing subiterations of the flow solver. FUN3D exhibits strong and weak scalability for the flow solver subiterations and the mesh deformation. However, FUN3D is currently hardwired directly to the serial version of Suggar++, which has a fixed cost for a given mesh system. Therefore, domain assembly begins to dominate the total cost of each time step as grid systems become larger. An integrated method for parallel domain assembly is presented that addresses scalability for large grid systems. Restructuring within FUN3D to accommodate integrated domain assembly is also discussed, which could enable use of the parallel Suggar++ library.

Cameron T Druyor↗

Generation and adaptation of 3-D unstructured grids for transient problems

Grid generation and adaptive refinement techniques suitable for the simulation of strongly unsteady flows past geometrically complex bodies in 3-D are described. The grids are generated using the advancing front technique. Emphasis is placed not to generate elements that are too small, as this would severely increase the cost of simulations with explicit flow solvers. The grids are adapted to an evolving flowfield using simple h-refinement. A grid change is performed every 5 to 10 timesteps, and only one level of refinement/coarsening is allowed per mesh change.

Loehner, Rainald↗

A New Semistructured Algebraic Multigrid Method

Multigrid methods are well suited to large massively parallel computer architectures because they are mathematically optimal and display good parallelization properties. Since current architecture trends are favoring regular compute patterns to achieve high performance, the ability to express structure has become much more important. The hypre software library provides high-performance multigrid preconditioners and solvers through conceptual interfaces, including a semistructured interface that describes matrices primarily in terms of stencils and logically structured grids. This paper presents a new semistructured algebraic multigrid (SSAMG) method built on this interface. The numerical convergence and performance of a CPU implementation of this method are evaluated for a set of semistructured problems. In conclusion, SSAMG achieves significantly better setup times than hypre’s unstructured AMG solvers and comparable convergence. In addition, the new method is capable of solving more complex problems than hypre’s structured solvers.

97 MATHEMATICS AND COMPUTING↗

Three dimensional unstructured grids for the solution of the Euler equations

The advancing front technique is being used to develop a code to generate grids around complex 3-D configurations for use in computing the invisid flow solutions by the Euler equations. By the advancing front technique points are introduced concurrently with the connectivity information so that a separate library is not required. The generation of a 3-D grid is accomplished in several steps. First the boundaries of the domain to be gridded must be described by two-, three- or four-sided surface patches. Next, a background mesh is required to control the grid spacing and stretching throughout the domain. This coarse tetrahedral grid is not required to conform to any of the boundaries. Next, each of the patches is mapped to 2-D, triangulated by the advancing front technique and mapped back to 3-D. These triangles form the initial front for the generation of the final tetrahedral mesh.

Gumbert, Clyde↗

Verification & Validation of High-Order Short-Characteristics-Based Deterministic Transport Methodology on Unstructured Grids

The research team has developed a practical, high-order, discrete-ordinates, short characteristics neutron transport code for three-dimensional configurations represented on unstructured tetrahedral grids that can be used for realistic reactor physics applications at both the assembly and core levels. This project will perform a comprehensive verification and validation of this new computational tool against both a continuous-energy Monte Carlo simulation (e.g. MCNP) and experimentally measured data, an essential prerequisite for its deployment in reactor core modeling. Verification is divided into three phases. The team will first conduct spatial mesh and expansion order refinement studies to monitor convergence of the numerical solution to reference solutions. This is quantified by convergence rates that are based on integral error norms computed from the cell-by-cell difference between the code’s numerical solution and its reference counterpart. The latter is either analytic or very fine- mesh numerical solutions from independent computational tools. For the second phase, the team will create a suite of code-independent benchmark configurations to enable testing the theoretical order of accuracy of any particular discretization of the discrete ordinates approximation of the transport equation. For each tested case (i.e. mesh and spatial approximation order), researchers will execute the code and compare the resulting numerical solution to the exact solution on a per cell basis to determine the distribution of the numerical error. The final activity comprises a comparison to continuous-energy Monte Carlo solutions for zero-power critical configuration measurements at Idaho National Laboratory’s Advanced Test Reactor (ATR). Results of this comparison will allow the investigators to distinguish between modeling errors and the above-listed discretization errors introduced by the deterministic method, and to separate the sources of uncertainty.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Finite Element Modeling of Diffusion in Fractured Porous Media by Using Hierarchical Material Properties

Abstract Fractured porous media challenge modeling approaches due to high computational costs and excessive mesh refinement imposed by the extreme scale variability of fractures and the heterogeneity of the surrounding porous rock. To overcome such difficulties, we utilize the hierarchical finite element method ( Hi ‐FEM) that has been developed previously to simulate the electrical potential distribution in complex geologic environments. The method employs the hierarchical basis functions in classical finite element analysis to enable representation of material properties on each dimensional component of a given 3D unstructured finite element, thereby inherently allowing for interactions at the boundary between fracture and a host rock. In this study, we extend its application to transient fluid flow and heat conduction in the Laplace domain. Time‐domain flow solutions are obtained by numerical inverse Laplace transform. We evaluate the accuracy of the method using different flow models and demonstrate its robustness for large‐scale, rock mass models featuring complex fracture networks. Moreover, for the computation of nodal Darcian velocity fields in fractured porous media where the fractures are represented as 2D features, a new approach that employs the Yeh's Galerkin model for both volume and facet elements is proposed. Results show that Hi ‐FEM can produce accurate flow solutions for fractured porous media without any need of coupling or transfer mechanism while still being computationally economical and numerically robust, even for large‐scale simulations.

Beskardes, G. D.↗

The computation of three-dimensional flows using unstructured grids

A general method is described for automatically discretizing, into unstructured assemblies of tetrahedra, the three-dimensional solution domains of complex shape which are of interest in practical computational aerodynamics. An algorithm for the solution of the compressible Euler equations which can be implemented on such general unstructured tetrahedral grids is described. This is an explicit cell-vertex scheme which follows a general Taylor-Galerkin philosophy. The approach is employed to compute a transonic inviscid flow over a standard wing and the results are shown to compare favorably with experimental observations. As a more practical demonstration, the method is then applied to the analysis of inviscid flow over a complete modern fighter configuration. The effect of using mesh adaptivity is illustrated when the method is applied to the solution of high speed flow in an engine inlet.

Morgan, K.↗

Dynamic Load Balancing for Adaptive Meshes using Symmetric Broadcast Networks

Many scientific applications involve grids that lack a uniform underlying structure. These applications are often dynamic in the sense that the grid structure significantly changes between successive phases of execution. In parallel computing environments, mesh adaptation of grids through selective refinement/coarsening has proven to be an effective approach. However, achieving load balance while minimizing inter-processor communication and redistribution costs is a difficult problem. Traditional dynamic load balancers are mostly inadequate because they lack a global view across processors. In this paper, we compare a novel load balancer that utilizes symmetric broadcast networks (SBN) to a successful global load balancing environment (PLUM) created to handle adaptive unstructured applications. Our experimental results on the IBM SP2 demonstrate that performance of the proposed SBN load balancer is comparable to results achieved under PLUM.

Das, Sajal K.↗

Multidimensional Unstructured-Grid Liquid Rocket Engine Nozzle Performance and Heat Transfer Analysis

The objective of this study is to conduct a unified computational analysis for computing design parameters such as axial thrust, convective and radiative wall heat fluxes for regeneratively cooled liquid rocket engine nozzles, so as to develop a computational strategy for computing those parameters through parametric investigations. The computational methodology is based on a multidimensional, finite-volume, turbulent, chemically reacting, radiating, unstructured-grid, and pressure-based formulation, with grid refinement capabilities. Systematic parametric studies on effects of wall boundary conditions, combustion chemistry, radiation coupling, computational cell shape, and grid refinement were performed and assessed. Under the computational framework of this study, it is found that the computed axial thrust performance, flow features, and wall heat fluxes compared well with those of available data and calculations, using a strategy of structured-grid dominated mesh, finite-rate chemistry, and cooled wall boundary condition.

Wang, Ten-See↗

Accuracy of Gradient Reconstruction on Grids with High Aspect Ratio

Gradient approximation methods commonly used in unstructured-grid finite-volume schemes intended for solutions of high Reynolds number flow equations are studied comprehensively. The accuracy of gradients within cells and within faces is evaluated systematically for both node-centered and cell-centered formulations. Computational and analytical evaluations are made on a series of high-aspect-ratio grids with different primal elements, including quadrilateral, triangular, and mixed element grids, with and without random perturbations to the mesh. Both rectangular and cylindrical geometries are considered; the latter serves to study the effects of geometric curvature. The study shows that the accuracy of gradient reconstruction on high-aspect-ratio grids is determined by a combination of the grid and the solution. The contributors to the error are identified and approaches to reduce errors are given, including the addition of higher-order terms in the direction of larger mesh spacing. A parameter GAMMA characterizing accuracy on curved high-aspect-ratio grids is discussed and an approximate-mapped-least-square method using a commonly-available distance function is presented; the method provides accurate gradient reconstruction on general grids. The study is intended to be a reference guide accompanying the construction of accurate and efficient methods for high Reynolds number applications

Thomas, James↗

New multigrid approach for three-dimensional unstructured, adaptive grids

A new multigrid method with adaptive unstructured grids is presented. The three-dimensional Euler equations are solved on tetrahedral grids that are adaptively refined or coarsened locally. The multigrid method is employed to propagate the fine grid corrections more rapidly by redistributing the changes-in-time of the solution from the fine grid to the coarser grids to accelerate convergence. A new approach is employed that uses the parent cells of the fine grid cells in an adapted mesh to generate successively coaser levels of multigrid. This obviates the need for the generation of a sequence of independent, nonoverlapping grids as well as the relatively complicated operations that need to be performed to interpolate the solution and the residuals between the independent grids. The solver is an explicit, vertex-based, finite volume scheme that employs edge-based data structures and operations. Spatial discretization is of central-differencing type combined with a special upwind-like smoothing operators. Application cases include adaptive solutions obtained with multigrid acceleration for supersonic and subsonic flow over a bump in a channel, as well as transonic flow around the ONERA M6 wing. Two levels of multigrid resulted in reduction in the number of iterations by a factor of 5.

Parthasarathy, Vijayan↗

Development of a Robust and Efficient Parallel Solver for Unsteady Turbomachinery Flows

The traditional design and analysis practice for advanced propulsion systems relies heavily on expensive full-scale prototype development and testing. Over the past decade, use of high-fidelity analysis and design tools such as CFD early in the product development cycle has been identified as one way to alleviate testing costs and to develop these devices better, faster and cheaper. In the design of advanced propulsion systems, CFD plays a major role in defining the required performance over the entire flight regime, as well as in testing the sensitivity of the design to the different modes of operation. Increased emphasis is being placed on developing and applying CFD models to simulate the flow field environments and performance of advanced propulsion systems. This necessitates the development of next generation computational tools which can be used effectively and reliably in a design environment. The turbomachinery simulation capability presented here is being developed in a computational tool called Loci-STREAM [1]. It integrates proven numerical methods for generalized grids and state-of-the-art physical models in a novel rule-based programming framework called Loci [2] which allows: (a) seamless integration of multidisciplinary physics in a unified manner, and (b) automatic handling of massively parallel computing. The objective is to be able to routinely simulate problems involving complex geometries requiring large unstructured grids and complex multidisciplinary physics. An immediate application of interest is simulation of unsteady flows in rocket turbopumps, particularly in cryogenic liquid rocket engines. The key components of the overall methodology presented in this paper are the following: (a) high fidelity unsteady simulation capability based on Detached Eddy Simulation (DES) in conjunction with second-order temporal discretization, (b) compliance with Geometric Conservation Law (GCL) in order to maintain conservative property on moving meshes for second-order time-stepping scheme, (c) a novel cloud-of-points interpolation method (based on a fast parallel kd-tree search algorithm) for interfaces between turbomachinery components in relative motion which is demonstrated to be highly scalable, and (d) demonstrated accuracy and parallel scalability on large grids (approx 250 million cells) in full turbomachinery geometries.

West, Jeff↗

Improved ALE mesh velocities for complex flows

A key choice in the development of arbitrary Lagrangian-Eulerian solution algorithms is how to move the computational mesh. The most common approaches are smoothing and relaxation techniques, or to compute a mesh velocity field that produces smooth mesh displacements. We present a method in which the mesh velocity is specified by the irrotational component of the fluid velocity as computed from a Helmholtz decomposition, and excess compression of mesh cells is treated through a noniterative, local spring-force model. This approach allows distinct and separate control over rotational and translational modes. In conclusion, the utility of the new mesh motion algorithm is demonstrated on a number of 3D test problems, including problems that involve both shocks and significant amounts of vorticity.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

MPACT Development Activities at University of Michigan

This report documents the efforts of general development tasks in MPACT performed primarily at the University of Michigan during FY17. These tasks included: 1. Unstructured CMFD - The unstructured CMFD supports the RIA and BWR challenge problems. It allows MPACT to simulate mixed lattice cores (e.g. 8x8 next to 9x9). This design feature is common to operating BWRs and also the SPERT experiments being used to validate VERA-CS for RIA. 2. Higher order spatial sources for MOC - The higher order sources are for improving the overall performance of MPACT. Higher order spatial sources in MOC provide accurate solutions with potentially significantly fewer mesh regions, thus speeding up every calculation. This method is also particularly important for BWRs. 3. Improving fine source region visualization - The improvement of the visualization of the flat source region mesh in MPACT is to support users and communication of models and results from MPACT. VERAView provides visualization of pin-wise information, however MPACT resolves the spatial solution to intra pin level. The capability provided here will let users visualize the full model geometry and components of the solution at the highest spatial resolution available from MPACT. 4. Automated spatial decomposition - The automated spatial decomposition removes the burden from the user to know how to spatially decompose the model for MPACT; a task that has been rather tricky in the past. Instead the user may give some number of processors that is a multiple of the axial mesh and MPACT will determine a nearly optimal decomposition that gives better load balance than most decompositions used currently. 5. Optimal relaxation factors for feedback - The development of optimal relaxation factor is to improve the stability and robustness of problems with feedback. Presently the default feedback values are 0.5, which may or may not be optimal. Without relaxation the fixed point iteration that is currently used is known to be unstable for large problems. The optimal relaxation factors are derived by utilizing a previous Fourier analysis. From the original milestone there was a scope change where the work on the Intel MIC was deferred for work on the automated spatial decomposition.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗