Search NASA⌕ Search

SEARCH · Search NASA

Results for “Grid Partition”

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 73 records · Page 4

Horizontal Resolution Sensitivity of the Simple Convection-Permitting E3SM Atmosphere Model in a Doubly-Periodic Configuration

We develop a doubly periodic version of the Simple Convection-Permitting E3SM Atmosphere Model (SCREAM) to provide an efficient configuration for this global convection permitting model (GCPM), akin to a single column model often found in conventional general circulation models. The design details are explained, in addition to the extensive case library associated with the doubly periodic SCREAM (DP-SCREAM) configuration. We demonstrate that doubly periodic cloud resolving models are useful tools to explore the horizontal resolution sensitivity of GCPMs, in addition to replicating biases seen in the global models. Using DP-SCREAM, we show that SCREAM exhibits behaviors of a scale aware model as it is able to naturally partition between sub-grid scale (SGS) and resolved vertical transport across the gray zone of turbulence. We show that SCREAM is reasonably scale insensitive when run at resolutions from 1 to 5 km, but can exhibit sensitivity, particularly for the shallow convective regime, when run at resolutions approaching that of large eddy simulations. We conclude that SGS parameterization improvements are likely needed to reduce this scale sensitivity.

54 ENVIRONMENTAL SCIENCES↗

Three-dimensional Euler time accurate simulations of fan rotor-stator interactions

A numerical method useful to describe unsteady 3-D flow fields within turbomachinery stages is presented. The method solves the compressible, time dependent, Euler conservation equations with a finite volume, flux splitting, total variation diminishing, approximately factored, implicit scheme. Multiblock composite gridding is used to partition the flow field into a specified arrangement of blocks with static and dynamic interfaces. The code is optimized to take full advantage of the processing power and speed of the Cray Y/MP supercomputer. The method is applied to the computation of the flow field within a single stage, axial flow fan, thus reproducing the unsteady 3-D rotor-stator interaction.

Boretti, A. A.↗

The Effect of the Weight Scheme on DFT Vibrational Frequencies

All-electron B3LYP harmonic frequencies of Ge2H5 and Ge2H6 are computed for several choices of grid and using both the Becke and the Stratmann, Scuseria, and Frisch atomic partition functions (weight scheme). For large grids, the results are independent of the weighting scheme. The lowest frequency mode is much more stable with respect to the number of grid points when the Stratmann, Scuseria, and Frisch weights are used.

Bauschlicher, Charles↗

Counterrotating prop-fan simulations which feature a relative-motion multiblock grid decomposition enabling arbitrary time-steps

Improvements are presented of a computer algorithm developed for the time-accurate flow analysis of rotating machines. The flow model is a finite volume method utilizing a high-resolution approximate Riemann solver for interface flux definitions. The numerical scheme is a block LU implicit iterative-refinement method which possesses apparent unconditional stability. Multiblock composite gridding is used to orderly partition the field into a specified arrangement of blocks exhibiting varying degrees of similarity. Block-block relative motion is achieved using local grid distortion to reduce grid skewness and accommodate arbitrary time step selection. A general high-order numerical scheme is applied to satisfy the geometric conservation law. An even-blade-count counterrotating unducted fan configuration is chosen for a computational study comparing solutions resulting from altering parameters such as time step size and iteration count. The solutions are compared with measured data.

Janus, J. Mark↗

Domain Decomposition By the Advancing-Partition Method

A new method of domain decomposition has been developed for generating unstructured grids in subdomains either sequentially or using multiple computers in parallel. Domain decomposition is a crucial and challenging step for parallel grid generation. Prior methods are generally based on auxiliary, complex, and computationally intensive operations for defining partition interfaces and usually produce grids of lower quality than those generated in single domains. The new technique, referred to as "Advancing Partition," is based on the Advancing-Front method, which partitions a domain as part of the volume mesh generation in a consistent and "natural" way. The benefits of this approach are: 1) the process of domain decomposition is highly automated, 2) partitioning of domain does not compromise the quality of the generated grids, and 3) the computational overhead for domain decomposition is minimal. The new method has been implemented in NASA's unstructured grid generation code VGRID.

Pirzadeh, Shahyar Z.↗

Scalability of grid- and subbasin-based land surface modeling approaches for hydrologic simulations

This paper investigates the relative merits of grid- and subbasin-based land surface modeling approaches for hydrologic simulations, with a focus on their scalability (i.e., abilities to perform consistently across a range of spatial resolutions) in simulating runoff generation. Simulations produced by the grid- and subbasin-based configurations of the Community Land Model (CLM) are compared at four spatial resolutions (0.125o, 0.25o, 0.5o and 1o) over the topographically diverse region of the U.S. Pacific Northwest. Using the 0.125o resolution simulation as the “reference”, statistical skill metrics are calculated and compared across simulations at 0.25o, 0.5o and 1o spatial resolutions of each modeling approach at basin and topographic region levels. Results suggest significant scalability advantage for the subbasin-based approach compared to the grid-based approach for runoff generation. Basin level annual average relative errors of surface runoff at 0.25o, 0.5o, and 1o compared to 0.125o are 3%, 4%, and 6% for the subbasin-based configuration and 4%, 7%, and 11% for the grid-based configuration, respectively. The scalability advantages of the subbasin-based approach are more pronounced during winter/spring and over mountainous regions. The source of runoff scalability is found to be related to the scalability of major meteorological and land surface parameters of runoff generation. More specifically, the subbasin-based approach is more consistent across spatial scales than the grid-based approach in snowfall/rainfall partitioning, which is related to air temperature and surface elevation. Scalability of a topographic parameter used in the runoff parameterization also contributes to improved scalability of the rain driven saturated surface runoff component, particularly during winter. Hence this study demonstrates the importance of spatial structure for multi-scale modeling of hydrological processes, with implications to surface heat fluxes in coupled land-atmosphere modeling.

Tesfa, Teklu K.↗

Direct Numerical Simulation of Hypersonic Turbulent Boundary Layer Flow using SPARC: Initial Evaluation

This report documents the initial testing of the Sandia Parallel Aerodynamics and Reentry Code (SPARC) to directly simulate hypersonic, turbulent boundary layer flow over a sharp 7- degree half-angle cone. This type of computation involves a tremendously large range of scales both in time and space, requiring a large number of grid cells and the efficient utilization of a large pool of resources. The goal of the simulation is to mimic and verify a wind tunnel experiment that seeks to measure the turbulent surface pressure fluctuations. These data are necessary for building a model to predict random vibration loading in the reentry flight environment. A low-dissipation flux scheme in SPARC is used on a 2.7 billion cell mesh to capture the turbulent fluctuations in the boundary layer flow. The grid is divided into 115200 partitions and simulated using the Knight's Landings (KNL) partition of the Trinity system. The parallel performance of SPARC is explored on the Trinity system, as well as some of the other new architectures. Extracting data from the simulation shows good agreement with the experiment as well as a colleague's simulation. The data provide a guide for which a new model can be built for better prediction of the reentry random vibration loads.

42 ENGINEERING↗

Improved 3-D turbomachinery CFD algorithm

The building blocks of a computer algorithm developed for the time-accurate flow analysis of rotating machines are described. The flow model is a finite volume method utilizing a high resolution approximate Riemann solver for interface flux definitions. This block LU implicit numerical scheme possesses apparent unconditional stability. Multi-block composite gridding is used to orderly partition the field into a specified arrangement. Block interfaces, including dynamic interfaces, are treated such as to mimic interior block communication. Special attention is given to the reduction of in-core memory requirements by placing the burden on secondary storage media. Broad applicability is implied, although the results presented are restricted to that of an even blade count configuration. Several other configurations are presently under investigation, the results of which will appear in subsequent publications.

Janus, J. Mark↗

Drought and Deluge: the Recurrence of Hydroclimate Extremes During the Past 600 Years in Eastern Australia’s Natural Resource Management (NRM) Clusters

Recent extremes of flood and drought across Australia have raised questions about the recurrence of such rare events and highlighted the importance of understanding multi-decadal climate variability. However, instrumental records over the past century are too short to adequately characterise climate variability on multi-decadal and longer timescales or robustly determine extreme event frequencies and their duration. Palaeoclimate reconstructions can provide much-needed information to help address this problem. Here, we use the 600-year hydroclimate record captured in the eastern Australian and New Zealand Drought Atlas (ANZDA) to analyse drought and pluvial frequency trends for East Australian Natural Resource Management (NRM) clusters. This partitioning of the drought atlas grid points into recognised biophysical areas (i.e. NRM clusters) revealed their differences and similarities in drought intensity and pluvial events over time. We find sustained multi-decadal periods of a wet–dry geographic 'seesaw' between eastern to central and southern NRMs (e.g. 1550–1600 CE and 1700–1750 CE). In contrast, other periods reveal spatially consistent wetting (e.g. 1500–1550 CE) or drying (e.g. 1750–1800 CE). Emerging hot spot analysis further shows that some areas that appear naturally buffered from severe drought during the instrumental period have a greater exposure risk when the longer 600-year record is considered. These findings are particularly relevant to management plans when dealing with the impacts of climate extremes developed at regional scales. Our results demonstrate that integrating and extending instrumental records with palaeoclimate datasets will become increasingly important for developing robust and locally specific extreme event frequency information for managing water resources.

Australian hydroclimate↗

Flexible User-Defined Domain Decomposition in Kilometer-Scale E3SM Land Model Simulation

The Energy Exascale Earth System Model (E3SM) Land Model (ELM) has been extended to kilometer-scale (km-ELM) resolutions, enabling high-fidelity simulations of terrestrial processes at 1 km x 1 km grid spacing. In ELM, domain decomposition partitions the computational domain across processors, ensuring efficient parallel execution. Currently, round-robin decomposition is applied, providing a straightforward way to distribute computational workload. As ELM continues evolving at the kilometer-scale (km-scale), particularly with integrating lateral flow modeling, decomposition strategies must also account for the increased workload and data movement. This paper introduces a flexible user-defined domain decomposition framework, allowing users to customize domain partitioning based on application requirements. The impact of different decomposition strategies is evaluated across various applications concerning computation, communication, and I/O. Results demonstrate that while 1D partitioning yields superior I/O performance, k-nearest neighbors (KNN) clustering effectively reduces inter-process communication overhead. This study lays the groundwork for scalable partitioning in large-scale land surface simulations, enhancing next-generation Earth system modeling.

Wang, Dali [ORNL] (ORCID:0000000168065108)↗

Memory access optimization for particle operations in computational fluid dynamics-discrete element method simulations

Computational Fluid Dynamics - Discrete Element Method is used to model gas-solid systems in several applications in energy, pharmaceutical and petrochemical industries. Computational performance bottlenecks often limit the problem sizes that can be simulated at industrial scale. The data structures used to store several millions of particles in such large-scale simulations have a large memory footprint that does not fit into the processor cache hierarchies on current high-performance-computing platforms, leading to reduced computational performance. This paper specifically addresses this aspect of memory access bottlenecks in industrial scale simulations. The use of space-filling curves to improve memory access patterns is described and their impact on computational performance is quantified in both shared and distributed memory parallelization paradigms. The Morton space filling curve applied to uniform grids and k-dimensional tree partitions are used to reorder the particle data-structure thus improving spatial and temporal locality in memory. The performance impact of these techniques when applied to two benchmark problems, namely the homogeneous-cooling-system and a fluidized-bed, are presented. We report these optimization techniques lead to approximately two-fold performance improvement in particle focused operations such as neighbor-list creation and data-exchange, with ~ 1.5 times overall improvement in a fluidization simulation with 1.27 million particles.

97 MATHEMATICS AND COMPUTING↗

A simple hydrologically based model of land surface water and energy fluxes for general circulation models

A generalization of the single soil layer variable infiltration capacity (VIC) land surface hydrological model previously implemented in the Geophysical Fluid Dynamics Laboratory (GFDL) general circulation model (GCM) is described. The new model is comprised of a two-layer characterization of the soil column, and uses an aerodynamic representation of the latent and sensible heat fluxes at the land surface. The infiltration algorithm for the upper layer is essentially the same as for the single layer VIC model, while the lower layer drainage formulation is of the form previously implemented in the Max-Planck-Institut GCM. The model partitions the area of interest (e.g., grid cell) into multiple land surface cover types; for each land cover type the fraction of roots in the upper and lower zone is specified. Evapotranspiration consists of three components: canopy evaporation, evaporation from bare soils, and transpiration, which is represented using a canopy and architectural resistance formulation. Once the latent heat flux has been computed, the surface energy balance is iterated to solve for the land surface temperature at each time step. The model was tested using long-term hydrologic and climatological data for Kings Creek, Kansas to estimate and validate the hydrological parameters, and surface flux data from three First International Satellite Land Surface Climatology Project Field Experiment (FIFE) intensive field campaigns in the summer-fall of 1987 to validate the surface energy fluxes.

Liang, XU↗

Self-Avoiding Walks Over Adaptive Triangular Grids

Space-filling curves is a popular approach based on a geometric embedding for linearizing computational meshes. We present a new O(n log n) combinatorial algorithm for constructing a self avoiding walk through a two dimensional mesh containing n triangles. We show that for hierarchical adaptive meshes, the algorithm can be locally adapted and easily parallelized by taking advantage of the regularity of the refinement rules. The proposed approach should be very useful in the runtime partitioning and load balancing of adaptive unstructured grids.

Heber, Gerd↗

INGRID: An interactive grid generator for 2D edge plasma modeling

A fusion boundary-plasma domain is defined by axisymmetric magnetic surfaces where the geometry is often complicated by the presence of one or more X-points; and modeling boundary plasmas usually relies on computational grids that account for the magnetic field geometry. The new grid generator INGRID (Interactive Grid Generator) presented in this work is a Python-based code for calculating grids for fusion boundary plasma modeling, for a variety of configurations with one or two X-points in the domain. INGRID first performs partitioning over the domain consisting of a small number of patches conforming to the magnetic field and wall geometry; then it generates a subgrid on each of the patches and joins them into a global grid. This domain partitioning strategy makes possible a uniform treatment of various configurations with one or two X-points in the domain. This includes single-null, double-null, and other configurations with two X-points in the domain. The INGRID design allows generating grids either interactively, via a parameter-file driven GUI, or using a non-interactive script-controlled workflow. Results of testing demonstrate that INGRID is a flexible, robust, and user-friendly grid-generation tool for fusion boundary-plasma modeling.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

INGRID: An interactive grid generator for 2D edge plasma modeling

A fusion boundary-plasma domain is defined by axisymmetric magnetic surfaces where the geometry is often complicated by the presence of one or more X-points; and modeling boundary plasmas usually relies on computational grids that account for the magnetic field geometry. The new grid generator INGRID (Interactive Grid Generator) presented here is a Python-based code for calculating grids for fusion boundary plasma modeling, for a variety of configurations with one or two X-points in the domain. INGRID first performs partitioning over the domain consisting of a small number of patches conforming to the magnetic field and wall geometry; then it generates a subgrid on each of the patches and joins them into a global grid. This domain partitioning strategy makes possible a uniform treatment of various configurations with one or two X-points in the domain. This includes single-null, double-null, and other configurations with two X-points in the domain. The INGRID design allows generating grids either interactively, via a parameterfile driven GUI, or using a non-interactive script-controlled workflow. Results of testing demonstrate that INGRID is a flexible, robust, and user-friendly grid-generation tool for fusion boundary-plasma modeling.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Noise and error analysis and optimization in particle-based kinetic plasma simulations

In this paper we analyze the noise in macro-particle methods used in plasma physics and fluid dynamics, leading to approaches for minimizing the total error, focusing on electrostatic models in one dimension. We begin by describing kernel density estimation for continuous values of the spatial variable x, expressing the kernel in a form in which its shape and width are represented separately. The covariance matrix of the noise in the density is computed, first for uniform true density. The bandwidth of the covariance matrix C(x,y) is related to the width of the kernel. A feature that stands out is the presence of constant negative terms in the elements of the covariance matrix both on and off-diagonal. These negative correlations are related to the fact that the total number of particles is fixed at each time step; they also lead to the property ∫C(x,y)dy = 0. We investigate the effect of these negative correlations on the electric field computed by Gauss's law, finding that the noise in the electric field is related to a process called the Ornstein-Uhlenbeck bridge, leading to a covariance matrix of the electric field with variance significantly reduced relative to that of a Brownian process. For non-constant density, p(x), still with continuous x, we analyze the total error in the density estimation and discuss it in terms of bias-variance optimization (BVO). For some characteristic length l, determined by the density and its second derivative, and kernel width h, having too few particles within h leads to too much variance; for h that is large relative to l, there is too much smoothing of the density. The optimum between these two limits is found by BVO. For kernels of the same width, it is shown that this optimum (minimum) is weakly sensitive to the kernel shape. Next, we repeat the analysis for x discretized on a grid. In this case the charge deposition rule is determined by a particle shape. An important property to be respected in the discrete system is the exact preservation of total charge on the grid; this property is necessary to ensure that the electric field is equal at both ends, consistent with periodic boundary conditions. We find that if the particle shapes satisfy a partition of unity property, the particle charge deposited on the grid is conserved exactly. Further, if the particle shape is expressed as the convolution of a kernel with another kernel that satisfies the partition of unity, then the particle shape obeys the partition of unity. This property holds for kernels of arbitrary width, including widths that are not integer multiples of the grid spacing. Furthermore, we show results relaxing the approximations used to do BVO optimization analytically, by doing numerical computations of the total error as a function of the kernel width, on a grid in x. The comparison between numerical and analytical results shows good agreement over a range of particle shapes. We discuss the practical implications of our results, including the criteria for design and implementation of computationally efficient particle shapes that take advantage of the developed theory.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

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↗