Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 55 records · Page 3

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↗

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↗

Ray tracing a three dimensional scene using a grid

Ray tracing a three-dimensional scene using a grid. One example embodiment is a method for ray tracing a three-dimensional scene using a grid. In this example method, the three-dimensional scene is made up of objects that are spatially partitioned into a plurality of cells that make up the grid. The method includes a first act of computing a bounding frustum of a packet of rays, and a second act of traversing the grid slice by slice along a major traversal axis. Each slice traversal includes a first act of determining one or more cells in the slice that are overlapped by the frustum and a second act of testing the rays in the packet for intersection with any objects at least partially bounded by the one or more cells overlapped by the frustum.

97 MATHEMATICS AND COMPUTING↗

Automatic off-body overset adaptive Cartesian mesh method based on an octree approach

This paper describes a method for generating adaptive structured Cartesian grids within a near-body/off-body mesh partitioning framework for the flow simulation around complex geometries. The off-body Cartesian mesh generation derives from an octree structure, assuming each octree leaf node defines a structured Cartesian block. This enables one to take into account the large scale discrepancies in terms of resolution between the different bodies involved in the simulation, with minimum memory requirements. Two different conversions from the octree to Cartesian grids are proposed: the first one generates Adaptive Mesh Refinement (AMR) type grid systems, and the second one generates abutting or minimally overlapping Cartesian grid set. We also introduce an algorithm to control the number of points at each adaptation, that automatically determines relevant values of the refinement indicator driving the grid refinement and coarsening. An application to a wing tip vortex computation assesses the capability of the method to capture accurately the flow features.

97 MATHEMATICS AND COMPUTING↗

A multiscale two-point flux-approximation method

A large number of multiscale finite-volume methods have been developed over the past decade to compute conservative approximations to multiphase flow problems in heterogeneous porous media. In particular, several iterative and algebraic multiscale frameworks that seek to reduce the fine-scale residual towards machine precision have been presented. Common for all such methods is that they rely on a compatible primal–dual coarse partition, which makes it challenging to extend them to stratigraphic and unstructured grids. Herein, we propose a general idea for how one can formulate multiscale finite-volume methods using only a primal coarse partition. To this end, we use two key ingredients that are computed numerically: (i) elementary functions that correspond to flow solutions used in transmissibility upscaling, and (ii) partition-of-unity functions used to combine elementary functions into basis functions. We exemplify the idea by deriving a multiscale two-point flux-approximation (MsTPFA) method, which is robust with regards to strong heterogeneities in the permeability field and can easily handle general grids with unstructured fine- and coarse-scale connections. The method can easily be adapted to arbitrary levels of coarsening, and can be used both as a standalone solver and as a preconditioner. Several numerical experiments are presented to demonstrate that the MsTPFA method can be used to solve elliptic pressure problems on a wide variety of geological models in a robust and efficient manner.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Atom-partitioned multipole expansions for electrostatic potential boundary conditions

Applications such as grid-based real-space density functional theory (DFT) use the Poisson equation to compute electrostatics. However, the expected long tail of the electrostatic potential requires either the use of a large and costly outer domain or Dirichlet boundary conditions estimated via multipole expansion. We find that the oft-used single-center spherical multipole expansion is only appropriate for isotropic mesh domains such as spheres and cubes. In this work, we introduce a method suitable for high aspect ratio meshes whereby the charge density is partitioned into atomic domains and multipoles are computed for each domain. While this approach is moderately more expensive than a single-center expansion, it is numerically stable and still a small fraction of the overall cost of a DFT calculation. The net result is that when high aspect ratio systems are being studied, form-fitted meshes can now be used in lieu of cubic meshes to gain computational speedup.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Spatial decomposition of structured grids for nuclear reactor simulations

Spatial decomposition methods based on graph partitioning are developed and implemented in the high fidelity neutron transport code MPACT. These graph-based spatial decomposition methods are more general than previous decomposition methods and typically provide better load balance and reduced runtimes due to their improved parallel efficiency. Correlations are drawn between simulation runtime and the balance of the partition for 2D simulations. Comparisons are made using partition balance metrics for different decomposition schemes in 2D and 3D simulations. Finally, for typical ranges of subdomains, graph-based partitioning methods offer significant reductions to runtimes. However, for highly decomposed problems, these graph-based methods may decrease convergence rates, thus reducing parallel efficiency compared to older methods.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Zonal-Based Emission Source Term Model for Predicting Particulate Emission Factors in Wildfire Simulations

A physics/chemistry-based numerical model for predicting the emission of fine particles from wildfires is proposed. This model implements the fundamental mechanisms of soot formation in a combustion environment: soot nucleation, surface growth, agglomeration, oxidation, and particle fragmentation. These mechanisms occur on a scale too fine for the discretization of most wildfire models, which need to simulate landscape-scale dynamics. As a result this model implements a zonal approach, where the computed soot particle distribution is partitioned into process zones within a single resolved grid cell. These process zones include: an inception zone (for nucleation), a heating zone (for coagulation, surface growth, and fragmentation), a reaction zone (for oxidation), and a quenched zone (for atmospheric processes). Governing mechanisms are applied to the appropriate zones to predict total particle growth and emission. Additionally, the proposed model is implemented into HIGRAD/FIRETEC, a physics-based wildfire simulation code which couples interactions between fire, fuels, atmosphere, and topography on a landscape scale. Fire simulations among grasslands and conifer forests are performed and compared against experimental data for emission factors.

54 ENVIRONMENTAL SCIENCES↗

Demonstration of Wake Steering Through Yaw Control in a Wind Plant Field Experiment: Cooperative Research and Development Final Report, CRADA Number CRD-16-00629

Over the last few decades, wind energy has evolved into a large international industry involving major players in the manufacturing, construction, and utility sectors. Coinciding with the industry’s growth, significant innovation in the technology has resulted in larger turbines with lower associated costs of energy and more complex designs in all subsystems. However, as the deployment of the technology has grown and its role within the electricity sector become more prominent, so have the expectations of the technology in terms of performance, reliability, and cost. The industry currently partitions its efforts into separate paths for turbine design, plant design and development, finance, grid interaction and operation, mitigation of adverse community and environmental impacts, and other areas. One prominent area where this partition is evident is in wind turbine control. Traditionally, each wind turbine in a wind plant has been controlled separately – via its own internal controller using only its own sensors. However, wind turbines in a plant interact with each other through the plant-level fluid dynamics. Wake losses (due to upstream turbines extracting energy from the winds and “waking” downstream turbines) can be up to 10% or even 20% of the gross energy production (if each turbine experienced the free stream wind inflow to the plant). A series of studies and experiments have demonstrated that there is potential for improving energy output at existing plants through plant control methods which seek to optimize total wind plant energy production over the current “greedy” approach where each turbine maximizes its own production. Wake steering induced by yaw offsets (turning the turbine to be out of the plane perpendicular to wind inflow) for upstream turbines has shown significant promise in simulations and wind tunnel experiments. In simulation studies, annual energy production has been shown to increase by 2% or more depending on the particular aspects of the wind plant (turbine spacing, meteorological conditions, etc). This project seeks to demonstrate the potential of plant-level controls via wake steering at a commercial wind plant. This is an important step towards commercialization and industry adoption of this plant-level modeling and analysis capability.

17 WIND ENERGY↗

Optimization of Air-Gap Profile in Interior Permanent-Magnet Synchronous Motors for Torque Ripple Mitigation

Interior permanent magnet synchronous motors (IPMSMs) have been widely used due to their high efficiency and high power density. Minimization of torque pulsation resulting in vibration and acoustic noise is one of the important design considerations for IPMSMs. In this paper, a grid on/off search method for the rotor profile is proposed to mitigate torque pulsation. Selection of the rotor profile is due to the fact that air-gap is the most sensitive parameter in electric machines wherein changes in flux densities can cause substantial differences in the distribution of forces. A layer comprised of 20 partitions with a 0.1 mm thickness and 3 degrees wide grids have been introduced to the rotor surface for each pole and the possible geometries have been analyzed using finite element method (FEM) in ANSYS Maxwell. An optimal design was found that has the lowest torque ripple with a higher average torque compared to the original design. Genetic algorithm (GA) has also been applied to the method to automate the coupling between Maxwell and Matlab thereby saving the simulation time. Finally, complete structural analysis has been done for both of the original and optimal designs to verify the superiority and feasibility of the proposed design.

42 ENGINEERING↗

A multi-center quadrature scheme for the molecular continuum

We report a common way to evaluate electronic integrals for polyatomic molecules is to use Becke’s partitioning scheme (Becke and Chem, 1988) in conjunction with overlapping grids centered at each atomic site. The Becke scheme was designed for integrands that fall off rapidly at large distances, such as those approximating bound electronic states. When applied to states in the electronic continuum, however, Becke scheme exhibits slow convergence and it is highly redundant. Here, we present a modified version of Becke scheme that is applicable to functions of the electronic continuum, such as those involved in molecular photoionization and electron–molecule scattering, and which ensures convergence and efficiency comparable to those realized in the calculation of bound states. In this modified scheme, the atomic weights already present in Becke’s partition are smoothly switched off within a range of few bond lengths from their respective nuclei, and complemented by an asymptotically unitary weight. The atomic integrals are evaluated on small spherical grids, centered on each atom, with size commensurate to the support of the corresponding atomic weight. The residual integral of the interstitial and long-range region is evaluated with a central master grid. The accuracy of the method is demonstrated by evaluating integrals involving integrands containing Gaussian Type Orbitals and Yukawa potentials, on the atomic sites, as well as spherical Bessel functions centered on the master grid. These functions are representative of those encountered in realistic electron-scattering and photoionization calculations in polyatomic molecules.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Lattice Quantum Chromodynamics: SPI, mapping, site ordering, and QPX in Lattice QCD code on Mira (ALCF-2 Early Science Program Technical Report)

Lattice QCD is a numerical method to simulate QCD (Quantum Chromodynamics) including non-perturbative effects. Among other methods, lattice QCD is the only successful non-perturbative method that can be systematically improved from first principles. Lattice QCD plays an important role in High Energy Particle Physics (flavor physics, spectroscopy, and beyond the Standard Model physics) and Nuclear Physics (nucleon/nuclear spectrum & structure, quark-gluon plasma, and the QCD equation of state). Moreover, recently there are active developments in applying lattice gauge theory to quantum field theory in general, for example the theoretical description of graphene or cold atom systems. We define the QCD action on a finite and discrete ‘lattice’ like grid, so that we can compute the path integral (partition function) on a computer. A current lattice size is 96 3 ×192, and the corresponding number of degrees of freedom for the path integral is about 6×10 8 . Thus, it requires enormous computing resources. In this report, we describe our overall efforts to improve lattice QCD software on Mira, which include a new communication library using the Message Unit (MU) SPI (System Programming Interface), better node mapping strategy, lattice site reordering, and using the quad floating point (QPX) intrinsics.

Na, Heechang↗

Intelligent Partitioning based Fully Parallel AC Security-Constrained Optimal Power Flow

Today’s power grid is becoming more diverse and integrated with high-level distributed energy resources and smart control technologies that is creating a new set of grid management challenges in terms of large-scale, nonlinear, and non-convex problem modeling, complex and time-consuming computation, as well as difficult uncertainty handling. This project focused on solving a challenging multi-period security-constrained generation scheduling problem, which is of great importance for maximizing the social welfare of real-time dispatch, day-ahead market, as well as weekly planning of power systems. Our developed software explored parallel optimization algorithms for complex and realistic power system models, and develop fast, efficient, and robust grid optimization solutions on the high-performance computing platform that will enable increased grid economics, flexibility, resilience, as well as energy security in the United States.

24 POWER TRANSMISSION AND DISTRIBUTION↗

A coupled discontinuous Galerkin-Finite Volume framework for solving gas dynamics over embedded geometries

Herein, we present a computational framework for solving the equations of inviscid gas dynamics using structured grids with embedded geometries. The novelty of the proposed approach is the use of high-order discontinuous Galerkin (dG) schemes and a shock-capturing Finite Volume (FV) scheme coupled via an hp adaptive mesh refinement (hp-AMR) strategy that offers high-order accurate resolution of the embedded geometries. The hp-AMR strategy is based on a multi-level block-structured domain partition in which each level is represented by block-structured Cartesian grids and the embedded geometry is represented implicitly by a level set function. The intersection of the embedded geometry with the grids produces the implicitly-defined mesh that consists of a collection of regular rectangular cells plus a relatively small number of irregular curved elements in the vicinity of the embedded boundaries. High-order quadrature rules for implicitly-defined domains enable high-order accuracy resolution of the curved elements with a cell-merging strategy to address the small-cell problem. The hp-AMR algorithm treats the system with a second-order finite volume scheme at the finest level to dynamically track the evolution of solution discontinuities while using dG schemes at coarser levels to provide high-order accuracy in smooth regions of the flow. On the dG levels, the methodology supports different orders of basis functions on different levels. The space-discretized governing equations are then advanced explicitly in time using high-order Runge-Kutta algorithms. Numerical tests are presented for two-dimensional and three-dimensional problems involving an ideal gas. The results are compared with both analytical solutions and experimental observations and demonstrate that the framework provides high-order accuracy for smooth flows and accurately captures solution discontinuities.

97 MATHEMATICS AND COMPUTING↗

Interplay of waves and eddies in rotating stratified turbulence and the link with kinetic-potential energy partition

The interplay between waves and eddies in stably stratified rotating flows is investigated by means of world-class direct numerical simulations using up to 3072 3 grid points. Strikingly, we find that the shift from vortex- to wave-dominated dynamics occurs at a wave number kR which does not depend on the Reynolds number, suggesting that the partition of energy between wave and vortical modes is not sensitive to the development of turbulence at the smaller scales. Additionally, we also show that k R is comparable to the wave number at which exchanges between kinetic and potential modes stabilize at close to equipartition, emphasizing the role of potential energy, as conjectured in the atmosphere and the oceans. Moreover, k R varies as the inverse of the Froude number as explained by the scaling prediction proposed, consistently with recent observations and modeling of the Mesosphere–Lower Thermosphere and of the ocean.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Evolution of CMS Workload Management Towards Multicore Job Support

The successful exploitation of multicore processor architectures is a key element of the LHC distributed computing system in the coming era of the LHC Run 2. High-pileup complex-collision events represent a challenge for the traditional sequential programming in terms of memory and processing time budget. The CMS data production and processing framework is introducing the parallel execution of the reconstruction and simulation algorithms to overcome these limitations. CMS plans to execute multicore jobs while still supporting singlecore processing for other tasks difficult to parallelize, such as user analysis. The CMS strategy for job management thus aims at integrating single and multicore job scheduling across the Grid. This is accomplished by employing multicore pilots with internal dynamic partitioning of the allocated resources, capable of running payloads of various core counts simultaneously. An extensive test programme has been conducted to enable multicore scheduling with the various local batch systems available at CMS sites, with the focus on the Tier-0 and Tier-1s, responsible during 2015 of the prompt data reconstruction. Scale tests have been run to analyse the performance of this scheduling strategy and ensure an efficient use of the distributed resources. This paper presents the evolution of the CMS job management and resource provisioning systems in order to support this hybrid scheduling model, as well as its deployment and performance tests, which will enable CMS to transition to a multicore production model for the second LHC run.

Perez-Calero Yzquierdo, A.↗