SEARCH · Search NASA

Results for “high performance and distributed computing”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,585 records · Page 88

All sources NASA NTRS DOE OSTI

DOE OSTI2019

BCL: A Cross-Platform Distributed Data Structures Library

One-sided communication is a useful paradigm for irregular parallel applications, but most one-sided programming environments, including MPI's one-sided interface and PGAS programming languages, lack application-level libraries to support these applications. We present the Berkeley Container Library, a set of generic, cross-platform, high-performance data structures for irregular applications, including queues, hash tables, Bloom filters and more. BCL is written in C++ using an internal DSL called the BCL Core that provides one-sided communication primitives such as remote get and remote put operations. The BCL Core has backends for MPI, OpenSHMEM, GASNet-EX, and UPC++, allowing BCL data structures to be used natively in programs written using any of these programming environments. Along with our internal DSL, we present the BCL ObjectContainer abstraction, which allows BCL data structures to transparently serialize complex data types while maintaining efficiency for primitive types. We also introduce the set of BCL data structures and evaluate their performance across a number of high-performance computing systems, demonstrating that BCL programs are competitive with hand-optimized code, even while hiding many of the underlying details of message aggregation, serialization, and synchronization.

Brock, Benjamin↗

DOE OSTI2024

Parallel computing for power system climate resiliency: Solving a large-scale stochastic capacity expansion problem with mpi-sppy

Here we propose a nodal stochastic generation and transmission expansion planning model that incorporates the output from high-resolution global climate models through load and generation availability scenarios. We implement our model in Pyomo and perform computational studies on a realistically-sized test case of the California electric grid in a high performance computing environment. We propose model reformulations and algorithm tuning to efficiently solve this large problem using a variant of the Progressive Hedging Algorithm. We utilize the parallelization capabilities and overall versatility of mpi-sppy, exploiting its hub-and-spoke architecture to concurrently obtain inner and outer bounds on an optimal expansion plan. Initial results show that instances with 360 representative days on a system with over 8,000 buses can be solved to within 5% of optimality in under 4 h of wall clock time, a first step towards solving a large-scale power system expansion planning problem across a wide range of climate-informed operational scenarios.

24 POWER TRANSMISSION AND DISTRIBUTION↗

DOE OSTI2019

Additive Manufacturing: Assessing Metal Powder Quality Through Characterizing Feedstock and Contaminants

The quality of powder feedstock for additive manufacturing (AM) metal powder bed fusion methods can significantly affect the quality of parts built from it. Particle size distribution (PSD) and shape factors influence flowability as well as the thickness and uniformity of each powder layer in the build box. For high-performance applications such as aerospace, medical, power generation and military, it becomes important to identify critical additional factors: the types, numbers and sizes of particulate contaminants that may be present in the powder. This is true for virgin, used and blended powders. Contaminants may be introduced during powder manufacture (e.g., ceramic insulation fragments from gas atomization equipment), handling (building insulation, talc) or possibly during the build process itself. Contaminants contained within a batch of powder can be physically built into an additive part when they are incorporated into the melt pool, and they can remain as discrete particulates or non-fused interfaces that act as stress concentrators. Their presence may decrease fatigue life by increasing the likelihood of fatigue crack initiation. This article describes three methods to rapidly and quantifiably characterize powder feedstock. (1) Computer-controlled scanning electron microscopy (CCSEM) provides quantitative size and shape parameters, as well as fine surface details from individual images on a particle-by-particle basis in large populations of powder. (2) Energy-dispersive spectroscopy (EDS) can be included, providing insights into variations within a batch of powder, as well as contaminant compositions. (3) For critical applications, the heavy liquid separation (HLS) method physically extracts low-density contaminants from a sample of powder metal down to part-per-billion detection limits to allow direct examination of contaminants and enhance identification and prevention of their sources. Altogether, these methods permit direct comparisons among powder metal samples. Better quantification of powder characteristics aids determination of suitability for end uses.

36 MATERIALS SCIENCE↗

DOE OSTI2026

Constant Overhead Entanglement Distillation via Scrambling

High-fidelity quantum entanglement enables key quantum networking capabilities such as secure communication and distributed quantum computing, but long-distance entanglement distribution is limited by noise and loss. Entanglement distillation protocols address this problem by extracting high-fidelity Bell pairs from multiple noisy ones. The primary objective is minimizing the resource overhead: the number of noisy input pairs needed to distill each high-fidelity output pair. While protocols achieving optimal overhead are known in theory, they often require complex decoding operations that make practical implementation challenging. We circumvent this challenge by introducing protocols that use quantum scrambling—the spreading of quantum information under chaotic dynamics—through random Clifford operations. Based on this scrambling mechanism, our protocol maintains asymptotically constant overhead, independent of the desired output error rate $\bar{𝜖}$ , and can be implemented with shallow quantum circuits of depth 𝑂⁡(poly log log⁡ $\bar{𝜖}$ −1 ) and memory 𝑂⁡(poly log⁡ $\bar{𝜖}$ −1 ). Our protocol remains effective even with noisy quantum gates. By incorporating error correction, our protocol achieves state-of-the-art performance: starting with pairs of 10% initial infidelity, we require only seven noisy inputs per output pair to distill a single Bell pair with infidelity $\bar{𝜖}$ =10 −12 , substantially outperforming existing schemes. We demonstrate the utility of our protocols for quantum repeater networks.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2025

High-Temperature Gas-Cooled Reactors Multiphysics Simulation Demonstration and Code Validation

This study presents a comprehensive benchmarking and verification effort of several thermal-hydraulic and multiphysics capabilities for high-temperature gas-cooled reactor applications. The first part of this effort focuses on the running-in verification of Griffin’s multiphysics capabilities, specifically for simulating the evolution of pebble-bed reactor cores from startup to equilibrium. Since Fiscal Year 2024, improvements and enhancements have been implemented in Griffin, including simplifying the process to specify streamlines and developing the online cross-section generation capability. In the absence of validation data, code-to-code comparisons are conducted with kugelpy, showing good agreement for integral quantities like k-eff predictions and predictions for maximum power density. However, accuracy issues are noted for more detailed quantities like the spatial distribution of fission rate densities which will require further work to address. The second part of this report presents an improved System Analysis Module (SAM) core channel model where the effects of cross flow are considered during the pressurized loss of forced cooling transient, resulting in an improved agreement of the predicted pebble temperature with respect to the predictions from the SAM 2D porous media model. Additionally, the wall channeling effect due to variable porosity at the near wall region of the core is also investigated. Furthermore, to demonstrate Griffin’s online cross-section generation capability, a Multiphysics simulation is performed by coupling Griffin to the SAM core channel model. In the third part of the report, as a part of the Organisation for Economic Co-operation and Development/Nuclear Energy Agency (OECD/NEA) thermal-hydraulic code validation benchmark activity for a high-temperature gas-cooled reactor, the High Temperature Test Facility (HTTF) is investigated first using the NekRS computational fluid dynamics (CFD) code to study the flow mixing phenomenon in the lower plenum of the facility. Then, code-to-code and code-to-data comparisons are performed for Test PG27, which is a pressurized conduction cooldown (PCC) test, using five different codes by six organizations from five countries. The different simulations show good agreements in terms of the general trend but there are differences in some results such as the peak temperatures of different regions and heat removal rate.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

DOE OSTI2021

Scalable Pattern Matching in Metadata Graphs via Constraint Checking

Pattern matching is a fundamental tool for answering complex graph queries. Unfortunately, existing solutions have limited capabilities: They do not scale to process large graphs and/or support only a restricted set of search templates or usage scenarios. Moreover, the algorithms at the core of the existing techniques are not suitable for today’s graph processing infrastructures relying on horizontal scalability and shared-nothing clusters, as most of these algorithms are inherently sequential and difficult to parallelize. In this article we present an algorithmic pipeline that bases pattern matching on constraint checking. The key intuition is that each vertex and edge participating in a match has to meet a set of constraints implicitly specified by the search template. These constraints can be verified independently and typically are less expensive to compute than searching the full template. The pipeline we propose generates these constraints and iterates over them to eliminate all the vertices and edges that do not participate in any match, thus reducing the background graph to a subgraph that is the union of all template matches—the complete set of all vertices and edges that participate in at least one match. Additional analysis can be performed on this annotated, reduced graph, such as full match enumeration, match counting, or computing vertex/edge centrality. Furthermore, a vertex-centric formulation for constraint checking algorithms exists, and this makes it possible to harness existing high-performance, vertex-centric graph processing frameworks. This technique (i) enables highly scalable pattern matching in metadata (labeled) graphs; (ii) supports arbitrary patterns with 100% precision; (iii) enables tradeoffs between precision and time-to-solution, while always selects all vertices and edges that participate in matches, thus offering 100% recall; and (iv) supports a set of popular data analytics scenarios. We implement our approach on top of HavoqGT, an open-source asynchronous graph processing framework, and demonstrate its advantages through strong and weak scaling experiments on massive scale real-world (up to 257 billion edges) and synthetic (up to 4.4 trillion edges) labeled graphs, respectively, and at scales (1,024 nodes / 36,864 cores), orders of magnitude larger than used in the past for similar problems. This article serves two purposes: First, it synthesises the knowledge accumulated during a long-term project. Second, it presents new system features, usage scenarios, optimizations, and comparisons with related work that strengthen the confidence that pattern matching based on iterative pruning via constraint checking is an effective and scalable approach in practice. The new contributions include the following: (i) We demonstrate the ability of the constraint checking approach to efficiently support two additional search scenarios that often emerge in practice, interactive incremental search and exploratory search. (ii) We empirically compare our solution with two additional state-of-the-art systems, Arabsque and TriAD. (iii) We show the ability of our solution to accommodate a more diverse range of datasets with varying properties, e.g., scale, skewness, label distribution, and match frequency. (iv) We introduce or extend a number of system features (e.g., work aggregation, load balancing, and the ability to cap the generated traffic) and design optimizations and demonstrate their advantages with respect to improving performance and scalability. (v) We present bottleneck analysis and insights into artifacts that influence performance. (vi) We present a theoretical complexity argument that motivates the performance gains we observe.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2026

Multipoint Aerostructural Optimization of Wind Turbine Rotors Using a Coupled Blade‐Resolved Aerostructural Solver

Physics‐based design optimization workflows thread the needle between computational cost limitations and simulation complexity, often compromising between modeling detail and the range of operating design conditions. Multipoint aerostructural optimization of wind turbine rotors has so far been confined to low‐fidelity analyses or to high‐fidelity studies with simplified structural models, leaving the most complex design trade‐offs unexplored. We close this gap by performing the first tightly coupled gradient‐based multipoint aerostructural rotor optimization using 3D aerodynamic and structural solvers with discrete coupled adjoints. The optimizer simultaneously varies blade planform, airfoil shapes, and structural thickness through more than 270 design variables, minimizing a weighted combination of rotor mass and power across multiple wind speeds. Applied to a modified DTU 10‐MW benchmark under conservative structural and aerodynamic constraints, our multipoint optimization reduces rotor mass by up to 36% and increases power by 12%–15% across the main operating conditions; biasing the objective toward power yields power gains up to 18% and a 17% mass reduction. For a nominal wind distribution, 3‐point rotor designs accounting for low RPM and high thrust conditions capture dominant trade‐offs and outperform single‐point designs. Adding two off‐design points changes individual‐condition power by less than 3% but leaves the weighted average within 0.5%, and the mass‐power bias has a stronger effect on the final design than the operating‐point weighting itself. Our framework extends naturally to richer load cases and site‐specific wind distributions, providing a basis for high‐fidelity multipoint design earlier in industrial workflows.

17 WIND ENERGY↗

DOE OSTI2021

Inclusive prompt photon-jet correlations as a probe of gluon saturation in electron-nucleus scattering at small x

We compute the differential cross-section for inclusive prompt photon+quark production in deeply inelastic scattering of electrons off nuclei at small x (e + A DIS) in the framework of the Color Glass Condensate effective field theory. The result is expressed as a convolution of the leading order (in the strong coupling α s ) impact factor for the process and universal dipole matrix elements, in the limit of hard photon transverse momentum relative to the nuclear saturation scale Q s,A (x). We perform a numerical study of this process for the kinematics of the Electron-Ion Collider (EIC), exploring in particular the azimuthal angle correlations between the final state photon and quark. We observe a systematic suppression and broadening pattern of the back-to-back peak in the relative azimuthal angle distribution, as the saturation scale is increased by replacing proton targets with gold nuclei. Our results suggest that photon+jet final states in inclusive e + A DIS at high energies are in general a promising channel for exploring gluon saturation that is complementary to inclusive and diffractive dijet production. They also provide a sensitive empirical test of the universality of dipole matrix elements when compared to identical measurements in proton-nucleus collisions. However because photon+jet correlations at small x in EIC kinematics require jet reconstruction at small k ⊥ , it will be important to study their feasibility relative to photon-hadron correlations.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

DOE OSTI2026

Roadmap and Benchmarking: Privacy in Federated Load Forecasting

Data-driven techniques for energy demand forecasting continue to emerge with promising impacts on distribution grid planning. However, the development of robust and generalizable machine learning models requires that representative high quality training data are available. Distributed energy resources have begun to embed intelligence, gathering large amounts of data on customer demand, behavior, and household devices that are connected to the grid. Though utilities aggregate meter-level demand data for load shaping, demand response, outage management, reliability planning, and billing applications, there lies an inherent privacy concern in sharing consumption data that may identify individual consumer behavioral patterns. Hence, while sharing the data is crucial, the private sensitive customer data must be safeguarded from being exposed or manipulated. In this study, we propose a roadmap for implementing a based privacy preserving framework to support the advancement of data-driven analytics in data-sensitive distributed energy resources environments. The roadmap incorporates federated learning–a distributed training framework, differential privacy–a statistical framework that provides guarantees to safeguard the leakage of sensitive data, secure multiparty computation and homomorphic encryption– techniques for encrypting model gradients and applying secure aggregation on the server. Moreover, we perform baseline experiments on the federated short-term load forecasting (STLF) task using open-source residential load profile datasets, offering insights into the challenges of integrating differential privacy into federated learning.

Abebe, Waqwoya [Oak Ridge National Laboratory (ORN↗

DOE OSTI2025

LTAU-FF: Loss Trajectory Analysis for Uncertainty in atomistic Force Fields

Model ensembles are effective tools for estimating prediction uncertainty in deep learning atomistic force fields. However, their widespread adoption is hindered by high computational costs and overconfident error estimates. In this work, we address these challenges by leveraging distributions of per-sample errors obtained during training and employing a distance-based similarity search in the model latent space. Our method, which we call LTAU (Loss Trajectory Analysis for Uncertainty), efficiently estimates the full probability distribution function of errors for any test point using the logged training errors, achieving speeds that are 2–3 orders of magnitudes faster than typical ensemble methods and allowing it to be used for tasks where training or evaluating multiple models would be infeasible. We apply LTAU towards estimating parametric uncertainty in atomistic force fields (LTAU-FF), demonstrating that it produces well-calibrated confidence intervals and predicts errors that correlate strongly with the true errors for data near the training domain. Furthermore, we show that the errors predicted by LTAU-FF can be used in practical applications for detecting out-of-domain data, tuning model performance, and predicting failure during simulations. We believe that LTAU will be a valuable tool for uncertainty quantification in atomistic force fields and is a promising method that should be further explored in other domains of machine learning.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

MassiveGNN: Efficient Training via Prefetching for Massively Connected Distributed Graphs

Graph Neural Networks (GNN) are indispensable in learning from graph-structured data, yet their rising computational costs, especially on massively connected graphs, pose significant challenges in terms of execution performance. To tackle this, distributed-memory solutions such as partitioning the graph to concurrently train multiple replicas of GNNs are in practice. However, approaches requiring a partitioned graph usually suffer from communication overhead and load imbalance, even under optimal partitioning and communication strategies due to irregularities in the neighborhood minibatch sampling. This paper proposes practical trade-offs for improving the sampling and communication overheads for representation learn- ing on distributed graphs (using popular GraphSAGE architecture) by developing a parameterized prefetch and eviction scheme on top of the state-of-the-art Amazon DistDGL distributed GNN framework, demonstrating about 15–40% improvement in end-to-end training performance on the NERSC Perlmutter supercomputer for various OGB datasets.

Machine Leanring, high performance comptuing, grap↗

DOE OSTI2021

ARENA: Asynchronous Reconfigurable Accelerator Ring to Enable Data-Centric Parallel Computing

The next generation HPC and data centers are likely to be reconfigurable and data-centric due to the trend of hardware specialization and the emergence of data-driven applications. In this work, we propose ARENA – an asynchronous reconfigurable accelerator ring architecture as a potential scenario on how the future HPC and data centers will be like. Despite using the coarse-grained reconfigurable arrays (CGRAs) as the substrate platform, our key contribution is not only the CGRA-cluster design itself, but also the ensemble of a new architecture and programming model that enables asynchronous tasking across a cluster of reconfigurable nodes, so as to bring specialized computation to the data rather than the reverse. We presume distributed data storage without asserting any prior knowledge on the data distribution. Hardware specialization occurs at runtime when a task finds the majority of data it requires are available at the present node. In other words, we dynamically generate specialized CGRA accelerators where the data reside. The asynchronous tasking for bringing computation to data is achieved by circulating the task token, which describes the dataflow graphs to be executed for a task, among the CGRA cluster connected by a fast ring network. Evaluations on a set of HPC and data-driven applications across different domains show that ARENA can provide better parallel scalability with reduced data movement (53.9 percent). Compared with contemporary compute-centric parallel models, ARENA can bring on average 4.37× speedup. The synthesized CGRAs and their task-dispatchers only occupy 2.93mm 2 chip area under 45nm process technology and can run at 800MHz with on average 759.8mW power consumption. ARENA also supports the concurrent execution of multi-applications, offering ideal architectural support for future high-performance parallel computing and data analytics systems.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2022

Tensor Network Quantum Virtual Machine for Simulating Quantum Circuits at Exascale

The numerical simulation of quantum circuits is an indispensable tool for development, verification, and validation of hybrid quantum-classical algorithms intended for near-term quantum co-processors. The emergence of exascale high-performance computing (HPC) platforms presents new opportunities for pushing the boundaries of quantum circuit simulation. Here, we present a modernized version of the Tensor Network Quantum Virtual Machine (TNQVM) that serves as the quantum circuit simulation backend in the eXtreme-scale ACCelerator (XACC) framework. The new version is based on the scalable tensor network processing library ExaTN (Exascale Tensor Networks). It provides multiple configurable quantum circuit simulators that perform either an exact quantum circuit simulation via the full tensor network contraction or an approximate simulation via a suitably chosen tensor factorization scheme. Upon necessity, stochastic noise modeling from real quantum processors is incorporated into the simulations by modeling quantum channels with Kraus tensors. By combining the portable XACC quantum programming frontend and the scalable ExaTN numerical processing backend, we introduce an end-to-end virtual quantum development environment that can scale from laptops to future exascale platforms. We report initial benchmarks of our framework, which include a demonstration of the distributed execution, incorporation of quantum decoherence models, and simulation of the random quantum circuits used for the certification of quantum supremacy on Google’s Sycamore superconducting architecture.

Nguyen, Thien↗

DOE OSTI2023

Fluoride-Cooled High-Temperature Pebble-Bed Reactor Reference Plant Model

In this report we present work performed in Fiscal Year 2022 that demonstrates the modeling and simulation of a fully coupled neutronics thermal hydraulics reference plant model for a fluoride-cooled high-temperature pebble-bed reactor. The multiphysics model is developed on the Nuclear Regulatory Commission’s Comprehensive Reactor Analysis Bundle (BlueCRAB) available on the Idaho National Laboratory’s high-performance computer, which natively and seamlessly couples Griffin, Pronghorn, and the BISON Multiphysics Object-Oriented Simulation Environment based applications. Griffin provides reactor physics capabilities, including depletion to the equilibrium core, k-eigenvalue, adjoint, and transient. The unique direct equilibrium core capability in Griffin is based on a streamline methodology to spatially deplete the pebbles into burnup groups. Pronghorn solves the porous medium equations for the fluid regions and conduction in the solid regions and incorporates a fluidic diode model to simulate the transition from forced to natural convection during accident scenarios. MOOSE modules solves thermal conduction problems for the pebbles and tristructural isotropic in the pebble-bed core, thus providing the fuel and moderator spatial fields for each pebble burnup group. The neutronics feedback relies primarily on fuel, moderator, and reflector temperatures as as well as the FLiBe salt density. Here, we present results for the uncoupled equilibrium core and perform comparisons to equivalent Monte Carlo models. The power distributions and kinetic parameters obtained with Griffin are consistent with those computed with Griffin. We demonstrate a noticeable improvement with the use of discrete ordinates method (SN) transport. The coupled steady-state equilibrium core provides the initial condition for two time-dependent problems: a control rod withdrawal event and an unprotected loss of flow event. In both cases, the reactor design is self-stabilizing and the solutions are consistent with the expected physics. Although this model is prototypical regarding BlueCRAB’s capabilities, its results are consistent with published work by Kairos Power and other research entities. Significant improvements to the model are planned in future work.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

NASA NTRS2019

Stabilization of a Swept-Wing Boundary Layer by Discrete Roughness Elements at High Reynolds Numbers

Direct numerical simulations (DNS) are performed to study potential stabilizing ef- fect of spanwise periodic discrete roughness elements (DREs) on cross ow instabilities in a spatially developing three-dimensional boundary layer over an in nite-swept natural- laminar- ow wing at a freestream Mach number of 0:75 and a chord Reynolds number of approximately 25 million. In the DNS, both the spanwise periodic DREs and distributed roughness in the leading-edge region are implemented to simulate a typical experimen- tal scenario in which multiple steady cross ow modes including the most unstable mode (i.e., the \target" mode) emerge because of the presence of naturally distributed surface roughness in the leading edge region and spanwise periodic control cylinders of subcritical wavelength are used to force small-wavelength disturbances (i.e., the control mode) for damping the target mode. The DNS results show that the e ectiveness of DRE control is sensitive to roughness diameter, height, and chordwise placement. For the DRE parame- ters considered in this study, the stabilizing e ect on the target mode is small within the computational domain that ended at about 35% of the chord.

Nicholson, Gary↗

DOE OSTI2025

In situ multi-tier auto-ignition detection applied to dual-fuel combustion simulations

Here we use an anomaly detection methodology that is centered on analyzing fourth-order joint moments (co-kurtosis), particularly focusing on its application in auto-ignition of combustion problems with large numbers of species. Unsupervised anomaly detection is challenging to generalize across problem types and domains. A recent technique, centered on analyzing information in the fourth-order joint moment co-kurtosis, has shown promise, especially for high-dimensional scientific data. In this work we present developments to the co-kurtosis based anomaly detection method needed to make it effective and scalable for large-scale distributed scientific data, such as those generated by massively parallel simulations. An in situ co-kurtosis algorithm is employed as the anomaly detection method for identifying ignition kernels in simulations of turbulent combustion. Here, we extend an existing methodology which identifies regions of the domain where anomalies are present, and add another tier of anomaly detection where the individual samples contributing to the anomaly are identified. We apply this algorithm on-the-fly to a variety of turbulent reacting flow problems and compare it to the widely used (but significantly more expensive) chemical explosive mode analysis (CEMA). We demonstrate the ability of the method to detect and identify the onset of low and high temperature ignition which can be used for computational steering, as chemical and combustion anomalies occur intermittently at spatio-temporal locations unknown a priori. Finally, we apply our lightweight in situ algorithm to an exascale high-fidelity simulation with a total of 2.4 Trillion degrees of freedom, performed using an adaptive mesh refinement solver. Furthermore, through a scalability analysis, we show that the relative computational cost of this in-situ anomaly detection algorithm compared to an iteration of the reacting flow solver is negligible.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2022

Development of machine learning framework for interface force closures based on bubble tracking data

Interfacial force closures in the two-fluid model play a critical role for the predictive capabilities of void fraction distribution. However, the practices of interfacial force modeling have long been challenged by the inherent physical complexity of the two-phase flows. The rapidly expanding computational capabilities in the recent years have made high-fidelity data from the interface-captured direct numerical simulation become more available, and hence potential for data-driven interfacial force modeling has prevailed. In this work, we established a data-driven modeling framework integrated to the HZDR multiphase Eulerian-Eulerian framework for computational fluid dynamics simulations. The data-driven framework is verified in a benchmark problem, where a feedforward neural network managed to capture the non-linear mapping between bubble Reynolds number and drag coefficient and reproduce the void distribution resulting from the baseline model in the test case. The second focus is on utilizing the bubble tracking data set to form a closure for the bubble drag in the turbulent bubbly flow, in which the drag coefficient is set to be correlated with the bubble Reynolds number and the Eötvös number. Pseudo-steady state filtering in the Frenet Frame was carried out to obtain the drag coefficient from the turbulent bubbly flow data. The performance of the data-driven drag model is also examined through a case study, where improvement of model’s prediction near-wall is regarded necessary. In conclusion, discussion and further plans of investigation are provided.

42 ENGINEERING↗

DOE OSTI2017

Dynamics, nucleosynthesis, and kilonova signature of black hole—neutron star merger ejecta

Here we investigate the ejecta from black hole—neutron star mergers by modeling the formation and interaction of mass ejected in a tidal tail and a disk wind. The outflows are neutron-rich, giving rise to optical/infrared emission powered by the radioactive decay of r-process elements (a kilonova). Here we perform an end-to-end study of this phenomenon, where we start from the output of a fully-relativistic merger simulation, calculate the post-merger hydrodynamical evolution of the ejecta and disk winds including neutrino physics, determine the final nucleosynthetic yields using post-processing nuclear reaction network calculations, and compute the kilonova emission with a radiative transfer code. We study the effects of the tail-to-disk mass ratio by scaling the tail density. A larger initial tail mass results in fallback matter becoming mixed into the disk and ejected in the subsequent disk wind. Relative to the case of a disk without dynamical ejecta, the combined outflow has lower mean electron fraction, faster speed, larger total mass, and larger absolute mass free of high-opacity Lanthanides or Actinides. In most cases, the nucleosynthetic yield is dominated by the heavy r-process contribution from the unbound part of the dynamical ejecta. A Solar-like abundance distribution can however be obtained when the total mass of the dynamical ejecta is comparable to the mass of the disk outflows. The kilonova has a characteristic duration of 1 week and a luminosity of ~ 10 41 erg s -1 , with orientation effects leading to variations of a factor ~2 in brightness. At early times (< 1 d) the emission includes an optical component from the (hot) Lanthanide-rich material, but the spectrum evolves quickly to the infrared thereafter.

79 ASTRONOMY AND ASTROPHYSICS↗