Search NASA⌕ Search

SEARCH · Search NASA

Results for “grid code”

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 865 records · Page 48

Ice Shape Characterization Using Self-Organizing Maps

A method for characterizing ice shapes using a self-organizing map (SOM) technique is presented. Self-organizing maps are neural-network techniques for representing noisy, multi-dimensional data aligned along a lower-dimensional and possibly nonlinear manifold. For a large set of noisy data, each element of a finite set of codebook vectors is iteratively moved in the direction of the data closest to the winner codebook vector. Through successive iterations, the codebook vectors begin to align with the trends of the higher-dimensional data. In information processing, the intent of SOM methods is to transmit the codebook vectors, which contains far fewer elements and requires much less memory or bandwidth, than the original noisy data set. When applied to airfoil ice accretion shapes, the properties of the codebook vectors and the statistical nature of the SOM methods allows for a quantitative comparison of experimentally measured mean or average ice shapes to ice shapes predicted using computer codes such as LEWICE. The nature of the codebook vectors also enables grid generation and surface roughness descriptions for use with the discrete-element roughness approach. In the present study, SOM characterizations are applied to a rime ice shape, a glaze ice shape at an angle of attack, a bi-modal glaze ice shape, and a multi-horn glaze ice shape. Improvements and future explorations will be discussed.

McClain, Stephen T.↗

Advances in Parallelization for Large Scale Oct-Tree Mesh Generation

Despite great advancements in the parallelization of numerical simulation codes over the last 20 years, it is still common to perform grid generation in serial. Generating large scale grids in serial often requires using special "grid generation" compute machines that can have more than ten times the memory of average machines. While some parallel mesh generation techniques have been proposed, generating very large meshes for LES or aeroacoustic simulations is still a challenging problem. An automated method for the parallel generation of very large scale off-body hierarchical meshes is presented here. This work enables large scale parallel generation of off-body meshes by using a novel combination of parallel grid generation techniques and a hybrid "top down" and "bottom up" oct-tree method. Meshes are generated using hardware commonly found in parallel compute clusters. The capability to generate very large meshes is demonstrated by the generation of off-body meshes surrounding complex aerospace geometries. Results are shown including a one billion cell mesh generated around a Predator Unmanned Aerial Vehicle geometry, which was generated on 64 processors in under 45 minutes.

O'Connell, Matthew↗

Near-Body Mesh Adaption for Transitional Flows Using OVERFLOW

Accurate modeling of boundary-layer transition is an important aspect of developing greener air transport technologies. In that regard, transition models based on auxiliary transport equations offer a robust approach that is easily integrated into the Reynolds-averaged Navier-Stokes (RANS) solvers. Recent workshops under NATO and AIAA have identified the verification of transport-equations-based transition modeling as a critical aspect of reducing the scatter between the predictions of different CFD codes. Follow-on work has highlighted the need for highly dense grids to achieve an asymptotic convergence of transition related flow metrics. The present work examines the role of automatic near-body mesh adaptation capability in the NASA OVERFLOW CFD solver to enable verification studies in an efficient manner, and for establishing best practices for designing grids for the RANS-based transition models. A sensor function relevant to the Langtry-Menter \gamma-Re_{\theta t}\ transition model has been identified and used for error-based mesh adaptation for canonical configurations comprising a flat plate, and the S809 and NLR-7301 airfoils. The efficacy of the mesh adaptation approach is assessed for flow conditions involving multiple transition scenarios such as natural transition, separation-induced transition, and shock-induced transition. The results from this exploratory study indicate that the meshes adapted using the proposed sensor provide solutions that approach the references solutions obtained with uniformly refined hand-crafted meshes, in terms of the chosen metrics, and yield modest yet significant savings in grid count. We also highlight areas for improvement in the grid adaptation methodology within OVERFLOW.

CFD↗

Near-Body Mesh Adaption for Transitional Flows Using OVERFLOW

Accurate modeling of boundary-layer transition is an important aspect of developing greener air transport technologies. In that regard, transition models based on auxiliary transport equations offer a robust approach that is easily integrated into the Reynolds-averaged Navier-Stokes (RANS) solvers. Recent workshops under NATO and AIAA have identified the verification of transport-equations-based transition modeling as a critical aspect of reducing the scatter between the predictions of different CFD codes. Follow-on work has highlighted the need for highly dense grids to achieve an asymptotic convergence of transition related flow metrics. The present work examines the role of automatic near-body mesh adaptation capability in the NASA OVERFLOW CFD solver to enable verification studies in an efficient manner, and for establishing best practices for designing grids for the RANS-based transition models. A sensor function relevant to the Langtry-Menter \gamma-Re_{\theta t}\ transition model has been identified and used for error-based mesh adaptation for canonical configurations comprising a flat plate, and the S809 and NLR-7301 airfoils. The efficacy of the mesh adaptation approach is assessed for flow conditions involving multiple transition scenarios such as natural transition, separation-induced transition, and shock-induced transition. The results from this exploratory study indicate that the meshes adapted using the proposed sensor provide solutions that approach the references solutions obtained with uniformly refined hand-crafted meshes, in terms of the chosen metrics, and yield modest yet significant savings in grid count. We also highlight areas for improvement in the grid adaptation methodology within OVERFLOW.

CFD↗

A scalable framework for efficient coupling of thermal and microstructural simulations in additive manufacturing

Predicting microstructure evolution in metal additive manufacturing (AM) is important for process optimization, but spatiotemporal scale disparities between thermal transport and microstructure evolution create significant challenges for efficient data transfer between simulation codes. To address this, we present Stork, a scalable framework for coupling thermal and microstructural simulations. Stork uses a sparse data representation to identify and store active solidification sub-volumes, enabling highly parallel quad-linear interpolation from coarse thermal grids to fine microstructure grids without large intermediate storage. We demonstrate the framework by coupling the semi-analytic heat transfer code 3DThesis with the time-parallel cellular automata code Toucan. This approach achieves over two orders of magnitude reduction in data generation time and file size compared to prior workflows. Numerical studies show that quad-linear interpolation preserves grain morphology and crystallographic texture in laser powder bed fusion (LPBF) simulations for coarsening ratios up to 16. Overall, Stork provides a scalable pathway for high-throughput, component-scale AM simulations on modern high-performance computing systems.

36 MATERIALS SCIENCE↗

Multiblock grid generation with automatic zoning

An overview will be given for multiblock grid generation with automatic zoning. We shall explore the many advantages and benefits of this exciting technology and will also see how to apply it to a number of interesting cases. The technology is available in the form of a commercial code, GridPro(registered trademark)/az3000. This code takes surface geometry definitions and patterns of points as its primary input and produces high quality grids as its output. Before we embark upon our exploration, we shall first give a brief background of the environment in which this technology fits.

Eiseman, Peter R.↗

Structure- and Physics-Preserving Reductions of Power Grid Models

The large size of multiscale, distribution and transmission, power grids hinders fast systemwide estimation and real-time control and optimization of operations. This paper studies graph reduction methods of power grids that are favorable for fast simulations and follow-up applications. While the classical Kron reduction has been successful in reduced order modeling of power grids with traditional, hierarchical design, the selection of reference nodes for the reduced model in a multiscale, distribution and transmission, network becomes ambiguous. In this work we extend the use of the iterative Kron reduction by utilizing the electric grid's graph topology for the selection of reference nodes, consistent with the design features of multiscale networks. Additionally, we propose further reductions by aggregation of coherent subnetworks of triangular meshes, based on the graph topology and network characteristics, in order to preserve currents and build another power-flow equivalent network. Our reductions are achieved through the use of iterative aggregation of subgraphs that include general tree structures, lines, and triangles. Important features of our reduction algorithms include that (i) the reductions are either equivalent to the Kron reduction or otherwise produce a power-flow equivalent network; (ii) due to the mentioned power-flow equivalence, the reduced network can model the dynamic of the swing equations for a lossless, inductive, steady state network; (iii) the algorithms efficiently utilize hash tables to store the sequential reduction steps. The third feature allows for easy reintroduction of detailed models into the reduced, conceptual network and makes the final reduced order model backward compatible with a sequence of intermediate, partially reduced networks with varying resolution---the ordered sequence of iterative reductions corresponds to a sequence of reduced order models. The performance of our graph reduction algorithms and features of the reduced grids are discussed on a real-word transmission and distribution grid. We produce visualizations of the reduced models through open source libraries and release our reduction algorithms with example code and toy data.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Multigrid convergence of an implicit symmetric relaxation scheme

Multigrid has been applied to an existing three-dimensional compressible Euler solver to accelerate the convergence of the implicit symmetric relaxation scheme. This lower-upper symmetric Gauss-Seidel implicit scheme is shown to be an effective multigrid driver in three-dimensions. A grid refinement study is performed including the effects of large cell aspect ratio meshes. Performance figures of the present multigrid code on Cray computers including the new C90 are presented. A reduction of three orders of of magnitude in the residual for a three-dimensional transonic inviscid flow using 920K grid points is obtained in less than 4 minutes on a Cray C90.

Yoon, Seokkwan↗

Multigrid convergence of an implicit symmetric relaxation scheme

The multigrid method has been applied to an existing three-dimensional compressible Euler solver to accelerate the convergence of the implicit symmetric relaxation scheme. This lower-upper symmetric Gauss-Seidel implicit scheme is shown to be an effective multigrid driver in three dimensions. A grid refinement study is performed including the effects of large cell aspect ratio meshes. Performance figures of the present multigrid code on Cray computers including the new C90 are presented. A reduction of three orders of magnitude in the residual for a three-dimensional transonic inviscid flow using 920 k grid points is obtained in less than 4 min on a Cray C90.

Yoon, Seokkwan↗

Tracking Debris Shed by a Space-Shuttle Launch Vehicle

The DEBRIS software predicts the trajectories of debris particles shed by a space-shuttle launch vehicle during ascent, to aid in assessing potential harm to the space-shuttle orbiter and crew. The user specifies the location of release and other initial conditions for a debris particle. DEBRIS tracks the particle within an overset grid system by means of a computational fluid dynamics (CFD) simulation of the local flow field and a ballistic simulation that takes account of the mass of the particle and its aerodynamic properties in the flow field. The computed particle trajectory is stored in a file to be post-processed by other software for viewing and analyzing the trajectory. DEBRIS supplants a prior debris tracking code that took .15 minutes to calculate a single particle trajectory: DEBRIS can calculate 1,000 trajectories in .20 seconds on a desktop computer. Other improvements over the prior code include adaptive time-stepping to ensure accuracy, forcing at least one step per grid cell to ensure resolution of all CFD-resolved flow features, ability to simulate rebound of debris from surfaces, extensive error checking, a builtin suite of test cases, and dynamic allocation of memory.

Stuart, Phillip C.↗

A New CIERRA Gridded Product Climatology for LIS/OTD

The GLM-CIERRA processing generates two products: A level-2 cluster feature dataset that merges flashes that should have been a single flash following the clustering algorithm flash definition (for GLM, this is due to the LCFA thresholds); A set of level-3 gridded products including Flash Extent Density, Convective Probability, etc. The CIERRA Level-3 products are generated on a 0.1 degree grid. This is suboptimal given the spatial variations in GLM pixel size AND the size of gridpoints in the output grid. As a stepping-stone towards developing improved GLM-CIERRA grids, I am testing pixel matching techniques on the LIS/OTD data. The goal is to maintain accuracy while vastly improving computational efficiency. The CIERRA reclustering codes are also being applied to LIS / OTD to merge flashes split by the “first fit” clustering technique. The end result will be standardized grids at the nominal resolution of each instrument (5 km for LIS, 10 km for OTD) that take into account the pixel geometry for each event that comprises a given reclustered flash.

54 ENVIRONMENTAL SCIENCES↗

Transonic flow calculations using Euler's equations

An implicit finite difference method with implicit boundary conditions is employed to solve the steady Euler's equations for flows past arbitrary geometries. The resulting code is used to investigate in a systematic way various aspects of flow past airfoils at transonic speeds such as, method of solution, boundary conditions, grid stretching and generation, shock and sonic point operators, the Kutta condition, and smoothing. Results obtained are in good agreement with results of other codes. Moreover, it appears that the method of solution employed is such that Kutta's condition need not be invoked. This statement appears to be valid for other existing schemes employed in the solution of Euler's equations.

Atkins, H. L.↗

A Performance-Portable MultiGPU Implementation of 3D Euler Equations using ProtoX and IRIS

Computational scientists often face challenges when developing and optimizing code for high-performance computing (HPC), especially when trying to leverage GPUs. Given the heterogeneity of the nodes that comprise many modern HPC facilities, considerable demand exists for performance portable solutions for the core computational kernels used in many scientific computing libraries. In this work, we demonstrate a fourth-order finite volume method–based implementation of the Euler equations, which are an integral part of computational fluid dynamics. Our performance-portable multiGPU implementation for Euler equations uses ProtoX to generate kernels and IRIS for portability. ProtoX is a domain-specific language that uses a structured-grid partial differential equation library called Proto as its front end and the SPIRAL code generation system as its back end to generate optimized kernels for different architectures. Optimized kernels generated by ProtoX are orchestrated through the IRIS intelligent runtime system to provide portability. Two levels of optimizations within the IRIS runtime— directed acyclic graph fusion and task fusion—are explored to efficiently utilize computing resources in a multiGPU environment. Performance improvement through these optimizations is showcased by comparing the base ProtoX-IRIS implementation on AMD GPUs (Frontier node) and on NVIDIA GPUs (NVIDIA DGX-1).

Mankad, Het↗

Application of Chimera Grid Scheme to Combustor Flowfields at all Speeds

A CFD method for solving combustor flowfields at all speeds on complex configurations is presented. The approach is based on the ALLSPD-3D code which uses the compressible formulation of the flow equations including real gas effects, nonequilibrium chemistry and spray combustion. To facilitate the analysis of complex geometries, the chimera grid method is utilized. To the best of our knowledge, this is the first application of the chimera scheme to reacting flows. In order to evaluate the effectiveness of this numerical approach, several benchmark calculations of subsonic flows are presented. These include steady and unsteady flows, and bluff-body stabilized spray and premixed combustion flames.

Yungster, Shaye↗

X-ray Reflected Spectra from Accretion Disk Models. III. A Complete Grid of Ionized Reflection Calculations

We present a new and complete library of synthetic spectra for modeling the component of emission that is reflected from an illuminated accretion disk. The spectra were computed using an updated version of our code xillver that incorporates new routines and a richer atomic data base. We offer in the form of a table model an extensive grid of reflection models that cover a wide range of parameters. Each individual model is characterized by the photon index Gamma of the illuminating radiation, the ionization parameter zeta at the surface of the disk (i.e., the ratio of the X-ray flux to the gas density), and the iron abundance A(sub Fe) relative to the solar value. The ranges of the parameters covered are: 1.2 <= Gamma <= 3.4, 1 <= zeta <= 104, and 0.5 <= A(sub Fe) <= 10. These ranges capture the physical conditions typically inferred from observations of active galactic nuclei, and also stellar-mass black holes in the hard state. This library is intended for use when the thermal disk flux is faint compared to the incident power-law flux. The models are expected to provide an accurate description of the Fe K emission line, which is the crucial spectral feature used to measure black hole spin. A total of 720 reflection spectra are provided in a single FITS file suitable for the analysis of X-ray observations via the atable model in xspec. Detailed comparisons with previous reflection models illustrate the improvements incorporated in this version of xillver.

X-ray↗

Solution adaptive local rectangular grid refinement for transonic aerodynamic flow problems

This paper describes the use of solution-adaptive local grid refinement in a numerical method for solving transonic flow problems about complex three-dimensional aircraft configurations. The method is implemented in the TRANAIR code, which has been applied to help solve many practical engineering problems. Attention is focused here on the principal components of the solution-adaptive grid algorithms currently being developed and on two applications that demonstrate the capabilities of the algorithms.

Bieterman, Michael B.↗

Application of FUN3D and CFL3D to the Third Workshop on CFD Uncertainty Analysis

Two Reynolds-averaged Navier-Stokes computer codes - one unstructured and one structured - are applied to two workshop cases (for the 3rd Workshop on CFD Uncertainty Analysis, held at Instituto Superior Tecnico, Lisbon, in October 2008) for the purpose of uncertainty analysis. The Spalart-Allmaras turbulence model is employed. The first case uses the method of manufactured solution and is intended as a verification case. In other words, the CFD solution is expected to approach the exact solution as the grid is refined. The second case is a validation case (comparison against experiment), for which modeling errors inherent in the turbulence model and errors/uncertainty in the experiment may prevent close agreement. The results from the two computer codes are also compared. This exercise verifies that the codes are consistent both with the exact manufactured solution and with each other. In terms of order property, both codes behave as expected for the manufactured solution. For the backward facing step, CFD uncertainty on the finest grid is computed and is generally very low for both codes (whose results are nearly identical). Agreement with experiment is good at some locations for particular variables, but there are also many areas where the CFD and experimental uncertainties do not overlap.

Rumsey, C. L.↗

Hierarchical Model-Free Transactional Control of Building Loads to Support Grid Services

A transition from generation on demand to consumption on demand is one of the solutions to overcome the many limitations associated with the higher penetration of renewable energy sources. Such a transition, however, requires a considerable amount of load flexibility in the demand side. Demand response (DR) programs can reveal and utilize this demand flexibility by enabling the participation of a large number of grid-interactive efficient buildings (GEB). Existing approaches on DR require significant modelling or training efforts, are computationally expensive, and do not guarantee the satisfaction of end users. To address the aforementioned limitations, this software code considers a scalable hierarchical model-free transactional control approach that incorporates elements of virtual battery, game theory, and model-free control (MFC) mechanisms. The developed approach separates the control mechanism into upper and lower levels. The MFC modulates the flexible GEB in the lower level with guaranteed thermal comfort of end users in response to the optimal pricing and power signals determined in the upper layer using a Stackelberg game integrated with aggregate virtual battery constraints. Additionally, the usage of MFC necessitates less burdensome computational and communication requirements, thus, it is easily deployable even on small, embedded devices. This software code enables the use of residential and small-size commercial buildings to offer a potentially substantial source of ancillary grid services that are currently underutilized. A hierarchical, model-free transactive building control provides a smooth interface between the grid service requests of utilities and the reliable control required by participating buildings. Model-free control, which supports distributed control architecture, will be a more scalable solution that can be deployed in neighborhood-size systems as well as individual buildings. The proposed approach contributes to the body of knowledge on two main aspects. First, it couples the MFC with the game-theoretic control and proposes a scalable model-free transactive control approach. MFC does not require any modeling effort or model training for the various building loads. This is very beneficial since deriving an accurate model for every single unit participating in DR programs and obtaining all the parameters about the units (e.g., thermal coefficients, standby losses) are infeasible. Also, MFC is computationally efficient, easily deployable even on small, embedded devices, and can be implemented in real time. Second, it integrates the concept of virtual battery into DR via the Stackelberg game. The concept of virtual battery enables efficient coordination and aggregation of a large number of flexible GEB with guaranteed thermal comfort of end users.

Olama, Mohammed [Oak Ridge National Lab. (ORNL), O↗