Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “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,189 records · Page 66
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

A fast particle-mesh simulation of non-linear cosmological structure formation with massive neutrinos

Quasi-N-body simulations, such as FastPM, provide a fast way to simulate cosmological structure formation, but have yet to adequately include the effects of massive neutrinos. In this work, we present a method to include neutrino particles in FastPM, enabling computation of the CDM and total matter power spectra to percent-level accuracy in the non-linear regime. The CDM-neutrino cross-power can also be computed at a sufficient accuracy to constrain cosmological observables. To avoid the shot noise that typically plagues neutrino particle simulations, we employ a quasi-random algorithm to sample the relevant Fermi-Dirac distribution when setting the initial neutrino thermal velocities. We additionally develop an effective distribution function to describe a set of non-degenerate neutrinos as a single particle to speed up non-degenerate simulations. The simulation is accurate for the full range of physical interest, M ν ≲ 0.6eV, and applicable to redshifts z ≲ 2. Such accuracy can be achieved by initializing particles with the two-fluid approximation transfer functions (using the REPS package). Convergence can be reached in ~ 25 steps, with a starting redshift of z=99. Probing progressively smaller scales only requires an increase in the number of CDM particles being simulated, while the number of neutrino particles can remain fixed at a value less than or similar to the number of CDM particles. In turn, the percentage increase in runtime-per-step due to neutrino particles is between ~ 5-20% for runs with 1024 3 CDM particles, and decreases as the number of CDM particles is increased. The code has been made publicly available, providing an invaluable resource to produce fast predictions for cosmological surveys and studying reconstruction.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2026

Mesh-based multiphysics coupling acceleration for fusion neutronics through clustering for fusion blanket applications

Accurate modeling of particle transport within fusion blankets is essential for predicting performance metrics such as heat deposition and the tritium breeding ratio (TBR). However, high-fidelity coupling of thermal fluids from computational fluid dynamics (CFD) to neutronics simulations often incurs significant computational costs due to the complexity of surface intersection calculations in Monte Carlo codes. This paper presents an accelerated multiphysics coupling method for neutronics that utilizes hierarchical agglomerative clustering to map complex material property distributions to a neutronics model. Implemented within the fusion reactor design and assessment (FREDA) framework, the method leverages existing Python packages to automate the creation of clustered geometries for OpenMC. The approach is demonstrated on a sector model of an ARC-class tokamak with an immersion molten salt blanket, and an simple geometry with varying isotopic concentrations. Results show that the clustering method significantly reduces computational burden without compromising fidelity, providing a foundation for agile iteration of neutronics simulations involving multiple coupled material properties.

Bae, Jin Whan [ORNL] (ORCID:0000000326548907)↗
DOE OSTI2023

Tree-based solvers for adaptive mesh refinement code $\scriptsize{FLASH}$ – IV. An X-ray radiation scheme to couple discrete and diffuse X-ray emission sources to the thermochemistry of the interstellar medium

X-ray radiation, in particular radiation between 0.1 and 10 keV, is evident from both point-like sources, such as compact objects and T-Tauri young stellar objects, and extended emission from hot, cooling gas, such as in supernova remnants. The X-ray radiation is absorbed by nearby gas, providing a source of both heating and ionization. While protoplanetary chemistry models now often include X-ray emission from the central young stellar object, simulations of star-forming regions have yet to include X-ray emission coupled to the chemo-dynamical evolution of the gas. We present an extension of the $\scriptsize{TREERAY}$ reverse ray trace algorithm implemented in the flash magnetohydrodynamic code which enables the inclusion of X-ray radiation from 0.1 keV < E γ < 100 keV, dubbed $\scriptsize{XRAYTHESPOT}$. $\scriptsize{XRAYTHESPOT}$ allows for the use of an arbitrary number of bins, minimum and maximum energies, and both temperature-independent and temperature-dependent user-defined cross-sections, along with the ability to include both point and extended diffuse emission and is coupled to the thermochemical evolution. We demonstrate the method with several multibin benchmarks testing the radiation transfer solution and coupling to the thermochemistry. Finally, we show two example star formation science cases for this module: X-ray emission from protostellar accretion irradiating an accretion disc and simulations of molecular clouds with active chemistry, radiation pressure, and protostellar radiation feedback from infrared to X-ray radiation.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2023

Tree-based solvers for adaptive mesh refinement code FLASH – III: a novel scheme for radiation pressure on dust and gas and radiative transfer from diffuse sources

Radiation is an important contributor to the energetics of the interstellar medium, yet its transport is difficult to solve numerically. We present a novel approach towards solving radiative transfer of diffuse sources via backwards ray tracing. Here, we focus on the radiative transfer of infrared radiation and the radiation pressure on dust. The new module, TREERAY/RADPRESSURE, is an extension to the novel radiative transfer method TREERAY implemented in the grid-based Magneto-Hydrodynamics code FLASH. In TREERAY/RADPRESSURE, every cell and every star particle is a source of infrared radiation. We also describe how gas, dust, and radiation are coupled via a chemical network. This allows us to compute the local dust temperature in thermal equilibrium, leading to a significantly improvement over the classical grey approximation. In several tests, we demonstrate that the scheme produces the correct radiative intensities as well as the correct momentum input by radiation pressure. Subsequently, we apply our new scheme to model massive star formation from a collapsing, turbulent core of 150 M ⊙ . We include the effects of both, ionizing and infrared radiation on the dynamics of the core. We find that the newborn massive star prevents fragmentation in its proximity due to radiative heating. Over time, dust and radiation temperature equalize, while the gas temperature can be either warmer due to shock heating or colder due to insufficient dust–gas coupling. Compared to gravity, the effects of radiation pressure are insignificant for the stellar mass on the simulated time-scale in this work.

(ISM:) HII regions↗
DOE OSTI2017

Topology-Aware Performance Optimization and Modeling of Adaptive Mesh Refinement Codes for Exascale

Here, we introduce a topology-aware performance optimization and modeling workflow for AMR simulation that includes two new modeling tools, ProgrAMR and Mota Mapper, which interface with the BoxLib AMR framework and the SSTmacro network simulator. ProgrAMR allows us to generate and model the execution of task dependency graphs from high-level specifications of AMR-based applications, which we demonstrate by analyzing two example AMR-based multigrid solvers with varying degrees of asynchrony. Mota Mapper generates multiobjective, network topology-aware box mappings, which we apply to optimize the data layout for the example multigrid solvers. While the sensitivity of these solvers to layout and execution strategy appears to be modest for balanced scenarios, the impact of better mapping algorithms can be significant when performance is highly constrained by network hop latency. Furthermore, we show that network latency in the multigrid bottom solve is the main contributing factor preventing good scaling on exascale-class machines.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

Radiative Heat Transfer Calculation on 16384 GPUs Using a Reverse Monte Carlo Ray Tracing Approach with Adaptive Mesh Refinement

Modeling thermal radiation is computationally challenging in parallel due to its all-to-all physical and resulting computational connectivity, and is also the dominant mode of heat transfer in practical applications such as next-generation clean coal boilers, being modeled by the Uintah framework. However, a direct all-to-all treatment of radiation is prohibitively expensive on large computers systems whether homogeneous or heterogeneous. DOE Titan and the planned DOE Summit and Sierra machines are examples of current and emerging GPU-based heterogeneous systems where the increased processing capability of GPUs over CPUs exacerbates this problem. These systems require that computational frameworks like Uintah leverage an arbitrary number of on-node GPUs, while simultaneously utilizing thousands of GPUs within a single simulation. We show that radiative heat transfer problems can be made to scale within Uintah on heterogeneous systems through a combination of reverse Monte Carlo ray tracing (RMCRT) techniques combined with AMR, to reduce the amount of global communication. In particular, significant Uintah infrastructure changes, including a novel lock and contention-free, thread-scalable data structure for managing MPI communication requests and improved memory allocation strategies were necessary to achieve excellent strong scaling results to 16384 GPUs on Titan.

Computer Science↗
DOE OSTI2019

Geometric Mapping of Tasks to Processors on Parallel Computers with Mesh or Torus Networks

We present a new method for reducing parallel applications' communication time by mapping their MPI tasks to processors in a way that lowers the distance messages travel and the amount of congestion in the network. Assuming geometric proximity among the tasks is a good approximation of their communication interdependence, we use a geometric partitioning algorithm to order both the tasks and the processors, assigning task parts to the corresponding processor parts. In this way, interdependent tasks are assigned to “nearby” cores in the network. We also present a number of algorithmic optimizations that exploit specific features of the network or application to further improve the quality of the mapping. We specifically address the case of sparse node allocation, where the nodes assigned to a job are not necessarily located in a contiguous block nor within close proximity to each other in the network. Furthermore, our methods generalize to contiguous allocations as well, and results are shown for both contiguous and non-contiguous allocations. We show that, for the structured finite difference mini-application MiniGhost, our mapping methods reduced communication time up to 75% relative to MiniGhost's default mapping on 128K cores of a Cray XK7 with sparse allocation. For the atmospheric modeling code E3SM/HOMME, our methods reduced communication time up to 31% on 16K cores of an IBM BlueGene/Q with contiguous allocation.

97 MATHEMATICS AND COMPUTING↗