Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “complex 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.

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

At least 865 records · Page 48
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Covalency-Driven Differences in the Hydrogenation Chemistry of Lanthanide- and Actinide-Based Frustrated Lewis Pairs

The electronic organization of Frustrated Lewis Pairs (FLPs) allows them to activate strong bonds in mechanisms that are usually free of redox events at the Lewis acidic site. The unique 6d/5f manifold of uranium could serve as an interesting FLP acceptor site, but to date FLP-like catalysis with actinide ions is unknown. In this paper, the catalytic, FLP-like hydrogenation reactivity of trivalent uranium complexes is explored in the presence of base-stabilized silylenes. Comparison to isoelectronic, isostructural lanthanide and thorium complexes lends insight into the electronic factors governing dihydrogen activation. Mechanistic studies of the uranium- and lanthanide-catalyzed hydrogenations are presented, including discussion of likely intermediates. Computational modeling of the f-element complexes, combined with experimental comparison to p-block Lewis acids, elucidates the relevance of steric hindrance to productive reactivity with dihydrogen. As a result, consideration of the complete experimental and theoretical evidence provides a clear picture of the electronic and steric factors governing dihydrogen activation by these FLPs.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2020

Gauges, loops, and polynomials for partition functions of graphical models

Graphical models represent multivariate and generally not normalized probability distributions. Computing the normalization factor, called the partition function, is the main inference challenge relevant to multiple statistical and optimization applications. The problem is #P-hard that is of an exponential complexity with respect to the number of variables. Here, aimed at approximating the partition function, we consider multi-graph models where binary variables and multivariable factors are associated with edges and nodes, respectively, of an undirected multi-graph. We suggest a new methodology for analysis and computations that combines the Gauge function technique from Chertkov and Chernyak with the technique developed in Anari and Oveis Gharan 2017 arXiv:1702.02937; Gurvits 2011 arXiv:1106.2844; Straszak and Vishnoi 2017 55th Annual Allerton Conf. on Communication, Control, and Computing, based on the recent progress in the field of real stable polynomials. We show that the Gauge function, representing a single-out term in a finite sum expression for the partition function which achieves extremum at the so-called belief-propagation gauge, has a natural polynomial representation in terms of gauges/variables associated with edges of the multi-graph. Moreover, Gauge function can be used to recover the partition function through a sequence of transformations allowing appealing algebraic and graphical interpretations. Algebraically, one step in the sequence consists of the application of a differential operator over gauges associated with an edge. Graphically, the sequence is interpreted as a repetitive elimination/contraction of edges resulting in multi-graph models on decreasing in size (number of edges) graphs with the same partition function as in the original multi-graph model. Even though the complexity of computing factors in the sequence of the derived multi-graph models and respective Gauge functions grow exponentially with the number of eliminated edges, polynomials associated with the new factors remain bi-stable if the original factors have this property. Moreover, we show that BP estimations in the sequence do not decrease, each low-bounding the partition function.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Metal additive manufacturing simulation across length, time, and computing scales

Metal additive manufacturing (AM) offers a unique opportunity for production of advanced materials and complex geometries. However, variability in microstructure and properties challenges conventional approaches to design, process optimization, qualification, and materials selection. Modeling and simulation can improve understanding of AM processing and materials, but also poses major challenges for existing computational methods. Simultaneously, modern scientific computing hardware has become increasingly complex, most notably with the adoption of hybrid architectures such as Graphical Processing Units (GPUs). If appropriately utilized, emerging computational capabilities provide an opportunity to reveal new insight into AM processing and the resulting material structure and properties. In this review we describe the computational AM landscape, identify critical gaps, and highlight opportunities to impact the development and application of AM. First, the requirements and challenges of representative AM problem statements will be defined. Here, these problems range from scientific studies to industrial applications and are designed to capture the breadth of challenges facing the AM community. Next, the current state of AM modeling and simulation is evaluated, broken down by enabling hardware and software, process simulation, microstructure simulation, and property simulation. Each section describes the diversity of simulation approaches and associated trade-offs in physical fidelity and computational expense. Each area is then assessed based on their suitability and readiness for current and developing computational architectures. Lastly, the greatest opportunities for future research and application are highlighted, including gaps in modeling capabilities, opportunities for near-term application, and key scientific challenges.

additive manufacturing↗
DOE OSTI2024

A fast and accurate domain decomposition nonlinear manifold reduced order model

Here, this paper integrates nonlinear-manifold reduced order models (NM-ROMs) with domain decomposition (DD). NM ROMs approximate the full order model (FOM) state in a nonlinear-manifold by training a shallow, sparse autoencoder using FOM snapshot data. These NM-ROMs can be advantageous over linear-subspace ROMs (LS-ROMs) for problems with slowly decaying Kolmogorov n-width. However, the number of NM-ROM parameters that need to be trained scales with the size of the FOM. Moreover, for “extreme-scale” problems, the storage of high-dimensional FOM snapshots alone can make ROM training expensive. To alleviate the training cost, this paper applies DD to the FOM, computes NM-ROMs on each subdomain, and couples them to obtain a global NM-ROM. This approach has several advantages: Subdomain NM-ROMs can be trained in parallel, involve fewer parameters to be trained than global NM-ROMs, require smaller subdomain FOM dimensional training data, and can be tailored to subdomain specific features of the FOM. The shallow, sparse architecture of the autoencoder used in each subdomain NM-ROM allows application of hyper-reduction (HR), reducing the complexity caused by nonlinearity and yielding computational speedup of the NM-ROM. This paper provides the first application of NM-ROM (with HR) to a DD problem. In particular, this paper details an algebraic DD reformulation of the FOM, training a NM-ROM with HR for each sub domain, and a sequential quadratic programming (SQP) solver to evaluate the coupled global NM-ROM. Theoretical convergence results for the SQP method and a priori and a posteriori error estimates for the DD NM-ROM with HR are provided. The proposed DD NM-ROM with HR approach is numerically compared to a DD LS-ROM with HR on the 2D steady-state Burgers’ equation, showing an order of magnitude improvement in accuracy of the proposed DD NM-ROM over the DD LS-ROM.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Complexation of Lanthanides and Heavy Actinides with Aqueous Sulfur-Donating Ligands

The separation of trivalent lanthanides and actinides is challenging because of their similar sizes and charge densities. S-donating extractants have shown significant selectivity for trivalent actinides over lanthanides, with single-stage americium/ lanthanide separation efficiencies for some thiol-based extractants reported at >99.999%. While such separations could transform the nuclear waste management landscape, these systems are often limited by the hydrolytic and radiolytic stability of the extractant. Progress away from thiol-based systems is limited by the poorly understood and complex interactions of these extractants in organic phases, where molecular aggregation and micelle formation obfuscates assessment of the metal–extractant coordination environment. Because S-donating thioethers are generally more resistant to hydrolysis and oxidation and the aqueous phase coordination chemistry is anticipated to lack complications brought on by micelle formation, we have considered three thioethers, 2,2'-thiodiacetic acid (TDA), (2R,5S)- tetrahydrothiophene-2,5-dicarboxylic acid, and 2,5-thiophenedicarboxylic acid (TPA), as possible trivalent actinide selective reagents. Formation constants, extended X-ray absorption fine structure spectroscopy, and computational studies were completed for thioether complexes with a variety of trivalent lanthanides and actinides including Nd, Eu, Tb, Am, Cm, Bk, and Cf. TPA was found to have moderately higher selectivity for the actinides because of its ability to bind actinides in a different manner than lanthanides, but the utility of TPA is limited by poor water solubility and high rigidity. While significant competition with water for the metal center limits the efficacy of aqueous-based thioethers for separations, the characterization of these solution-phase, S-containing lanthanide and actinide complexes is the most comprehensively available in the literature to date. Here, this is due to the breadth of lanthanides and actinides considered as well as the techniques deployed and serves as a platform for the further development of Scontaining reagents for actinide separations. Additionally, this paper reports on the first bond lengths for Cf and Bk with a neutral S donor.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2023

Partitioning Quantum Chemistry Simulations with Clifford Circuits

Current quantum computing hardware is restricted by the availability of only few, noisy qubits which limits the investigation of larger, more complex molecules in quantum chemistry calculations on quantum computers in the near term. Here, in this work, we investigate the limits of their classical and near-classical treatment while staying within the framework of quantum circuits and the variational quantum eigensolver. To this end, we consider naive and physically motivated, classically efficient product ansatz for the parametrized wavefunction adapting the separable-pair ansatz form. We combine it with post-treatment to account for interactions between subsystems originating from this ansatz. The classical treatment is given by another quantum circuit that has support between the enforced subsystems and is folded into the Hamiltonian. To avoid an exponential increase in the number of Hamiltonian terms, the entangling operations are constructed from purely Clifford or near-Clifford circuits. While Clifford circuits can be simulated efficiently classically, they are not universal. In order to account for missing expressibility, near-Clifford circuits with only few, selected non-Clifford gates are employed. The exact circuit structure to achieve this objective is molecule-dependent and is constructed using simulated annealing and genetic algorithms. We demonstrate our approach on a set of molecules of interest and investigate the extent of our methodology’s reach.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2025

Data Quality Monitoring for the Hadron Calorimeters Using Transfer Learning for Anomaly Detection

The proliferation of sensors brings an immense volume of spatio-temporal (ST) data in many domains, including monitoring, diagnostics, and prognostics applications. Data curation is a time-consuming process for a large volume of data, making it challenging and expensive to deploy data analytics platforms in new environments. Transfer learning (TL) mechanisms promise to mitigate data sparsity and model complexity by utilizing pre-trained models for a new task. Despite the triumph of TL in fields like computer vision and natural language processing, efforts on complex ST models for anomaly detection (AD) applications are limited. In this study, we present the potential of TL within the context of high-dimensional ST AD with a hybrid autoencoder architecture, incorporating convolutional, graph, and recurrent neural networks. Motivated by the need for improved model accuracy and robustness, particularly in scenarios with limited training data on systems with thousands of sensors, this research investigates the transferability of models trained on different sections of the Hadron Calorimeter of the Compact Muon Solenoid experiment at CERN. The key contributions of the study include exploring TL’s potential and limitations within the context of encoder and decoder networks, revealing insights into model initialization and training configurations that enhance performance while substantially reducing trainable parameters and mitigating data contamination effects.

47 OTHER INSTRUMENTATION↗
DOE OSTI2022

From PeleC to PeleACC, to PeleC++

PeleC is an Exascale Computing Project application for simulating compressible combustion in complex geometries. It has been built on top of the popular AMReX library. In the beginning of the Exascale Computing Project, PeleC was focused on KNL. It uses a mixture of C++, C, and kernels written in Fortran to obtain performance by focusing on vectorization. Recently we have taken two approaches in deciding PeleC's future for obtaining performance on exascale GPU machines. In the first programming model, we decorated the Fortran kernels with OpenACC directives. This expedited our ability to run at large scales on Summit's GPUs, where we achieved a significant speedup over the CPUs on Summit. The second programming model involved rewriting the Fortran kernels in C++ and using AMReX's Kokkos-like lambda abstractions for running on the GPU. This resulted in similar speedups on Summit's GPUs over merely utilizing the CPUs. Both approaches involved AMReX's management of memory transfers between the device and host. In this work, we compare and contrast the benefits and pitfalls to both programming approaches regarding performance, performance portability, and productivity. We also discuss advantages we have found in taking the time to modernize our code and why have chosen a specific pathway to prepare our code for the future DOE exascale machines.

exascale computing↗
DOE OSTI2023

A computational fluid dynamics model to estimate local quantities in firebrand char oxidation

Firebrand burning is a complex phenomenon that is influenced by several parameters which are difficult to fully explore experimentally. Computational fluid dynamics models capable of predicting local quantities are essential for accurate prediction of char oxidation in firebrands. This article presents a computational fluid dynamics model to estimate firebrand mass loss, diameter change, and surface temperature during char oxidation. The model was validated using previously conducted wind tunnel experiments. These experiments were conducted for firebrands of two different aspect ratios, which were arranged in three different configurations (single, horizontal array, and vertical array), and for four different wind speeds (0.5, 1, 1.5, and 2 m/s). The computational fluid dynamics results were compared with a previous 1 D model. In all the test cases, the computational fluid dynamics model predicted the physical phenomena with significantly improved accuracy compared to a 1 D model. The char oxidation model presented in this article can be coupled with other models to study firebrand generation and trajectory, biomass pyrolysis, fluidized bed reactors, and coal combustion.

Engineering↗
DOE OSTI2023

Scalable computations for nonstationary Gaussian processes

Nonstationary Gaussian process models can capture complex spatially varying dependence structures in spatial datasets. However, the large number of observations in modern datasets makes fitting such models computationally intractable with conventional dense linear algebra. In addition, derivative-free or even first-order optimization methods can be very slow to converge when estimating many spatially varying parameters. In this paper, we present a computational framework which couples an algebraic block diagonal plus low-rank covariance matrix approximation with stochastic trace estimation to facilitate the efficient use of second-order solvers for maximum likelihood estimation of Gaussian process models with many parameters. We demonstrate the effectiveness of these methods by simultaneously fitting 192 parameters in the popular nonstationary model of Paciorek and Schervish using 107,600 sea surface temperature anomaly measurements.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

MOOSE ProbML: Parallelized probabilistic machine learning and uncertainty quantification for computational energy applications

Here, this paper presents the development and demonstration of massively parallel probabilistic machine learning (ML) and uncertainty quantification (UQ) capabilities within the Multiphysics Object-Oriented Simulation Environment (MOOSE), an open-source computational platform for parallel finite element and finite volume analyses. In addressing the computational expense and uncertainties inherent in complex multiphysics simulations, this paper integrates Gaussian process (GP) variants, active learning, Bayesian inverse UQ, adaptive forward UQ, Bayesian optimization, evolutionary optimization, and Markov chain Monte Carlo (MCMC) within MOOSE. It also elaborates on the interaction among key MOOSE systems — Sampler, MultiApp, Reporter, and Surrogate — in enabling these capabilities. The modularity offered by these systems enables development of a multitude of probabilistic ML and UQ algorithms in MOOSE. Example code demonstrations include parallel active learning and parallel Bayesian inference via active learning. The impact of these developments is illustrated through five applications relevant to computational energy applications: UQ of nuclear fuel fission product release, using parallel active learning Bayesian inference; very rare events analysis in nuclear microreactors using active learning; advanced manufacturing process modeling using multi-output GPs (MOGPs) and dimensionality reduction; fluid flow using deep GPs (DGPs); and tritium transport model parameter optimization for fusion energy, using batch Bayesian optimization. These capabilities are part of the MOOSE framework.

97 - MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Novel superposed kinklike and pulselike solutions for several nonlocal nonlinear equations

In this work, we show that a number of nonlocal nonlinear equations, including the Ablowitz–Musslimani and Yang variant of the nonlocal nonlinear Schrödinger (NLS) equation, the nonlocal modified Korteweg de Vries (mKdV) equation, and the nonlocal Hirota equation, admit novel kinklike and pulselike superposed periodic solutions. Furthermore, we show that the nonlocal mKdV equation also admits the superposed (hyperbolic) kink–antikink solution. In addition, we show that while the nonlocal Ablowitz–Musslimani variant of the NLS admits complex parity-time reversal-invariant kink and pulse solutions, neither the local NLS nor the Yang variant of the nonlocal NLS admits such solutions. Finally, except for the Yang variant of the nonlocal NLS, we show that the other three nonlocal equations admit both the kink and pulse solutions in the same model.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Band Heater Heat Flux Characterization Using Inverse Heat Conduction Problem Models

Abstract An experimental apparatus was constructed to correlate water flowrate and temperature rise under an external band heater. Due to the physical characteristics of the band heater, its transient heating behavior is unknown. This paper investigates the application of inverse heat conduction problem (IHCP) methods to characterize the heat flux from the band heater. Three experiments with different heating times (5, 10, and 20 s) and no flowrate were conducted to measure the transient temperature under the 400 W band heater. Type-T thermocouples measure surface temperature at the centerline of the band heater. The experimental results are computed with five different heat conduction models. The models are chosen to identify how the heat flux response varies from a simplified to a realistic model. Additionally, the results of the experimental heat flux are compared to the manufacturer band heater data (58.9 kW/m2) for each model. The minimum time needed for the heater to fully energize the system is from 10 to 12 s. The residuals for each model are analyzed and used to evaluate the appropriateness of the five different models. The results show that the use of simpler models can achieve results similar to those of complex models, with less time and computational cost.

Engineering↗
DOE OSTI2020

High-Fidelity Large-Signal Order Reduction Approach for Composite Load Model

With the increasing penetration of electronic loads and distributed energy resources, conventional load models cannot capture their dynamics. Therefore, a new comprehensive composite load model is developed by Western Electricity Coordinating Council (WECC). However, this model is a complex high-order non-linear system with multi-time-scale property, which poses challenges on power system studies with heavy computational burden. In order to reduce the model complexity, the authors firstly develop a large-signal order reduction (LSOR) method using singular perturbation theory. In this method, the fast dynamics are integrated into the slow ones to preserve transient characteristics of the former. Then, accuracy assessment conditions are proposed and embedded into the LSOR to improve and guarantee the accuracy of reduced-order model. Finally, the reduced-order WECC composite load model is derived by using the proposed algorithm. Overall, simulation results show that the reduced-order large-signal model significantly alleviates the computational burden while maintaining similar dynamic responses as the original composite load model.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2022

What can simulation test beds teach us about social science? Results of the ground truth program

The ground truth program used simulations as test beds for social science research methods. The simulations had known ground truth and were capable of producing large amounts of data. This allowed research teams to run experiments and ask questions of these simulations similar to social scientists studying real-world systems, and enabled robust evaluation of their causal inference, prediction, and prescription capabilities. We tested three hypotheses about research effectiveness using data from the ground truth program, specifically looking at the influence of complexity, causal understanding, and data collection on performance. We found some evidence that system complexity and causal understanding influenced research performance, but no evidence that data availability contributed. The ground truth program may be the first robust coupling of simulation test beds with an experimental framework capable of teasing out factors that determine the success of social science research.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Assessment of Updraft Modeling Bias Using Computational Fluid Dynamics

Golden Eagle (Aquila chrysaetos) habitats may overlap with wind energy development in some regions of the US. Eagles, and similar soaring bird species, are therefore at risk of collision with wind turbines when flying through wind farms. Recently developed behavioral modeling approaches can predict the presence of eagles near turbines within the rotor-swept layer but require reliable prediction of atmospheric flowfield conditions. In particular, the vertical component of the wind speed dictates a soaring bird's ability to maintain or gain altitude, since they rely on updrafts to subsidize their flight. In this work, we investigate the atmospheric conditions around a wind farm in complex terrain and compare methods for atmospheric characterization. We use computational fluid dynamics (specifically, large-eddy simulations, or LES) to simulate the atmospheric boundary layer over a region encompassing multiple wind farms with high temporal and spatial resolution (seconds and 10's of meters, respectively). We compare traditional non-simulation-based methods of determining the orographic updraft potential based on wind direction, terrain slope and aspect, with the flowfields from LES that include both orographic updrafts alone and combined thermal and orographic updrafts. Preliminary analysis suggests that although the model captures the horizontal pattern of vertical updrafts, their magnitude can be improved with information about the surface heat flux, which is usually correlated with time of the day. Within our study region, we found that the low-fidelity model may over- or underestimate updraft potential by up to 400% at 80 m AGL, depending on local orographic features. This can result in an inaccurate representation of eagle presence and, consequently, risk. Another important finding is that flowfield time-averaging can hide important details about the flight environment, including how thermally generated flow structures within the atmospheric boundary layer (e.g., convective rolls and/or cells) may be important drivers of eagle flight.

atmospheric turbulence↗
DOE OSTI2020

Computationally aided, entropy-driven synthesis of highly efficient and durable multi-elemental alloy catalysts

Multi-elemental alloy nanoparticles (MEA-NPs) hold great promise for catalyst discovery in a virtually unlimited compositional space. However, rational and controllable synthesize of these intrinsically complex structures remains a challenge. Here, we report the computationally aided, entropy-driven design and synthesis of highly efficient and durable catalyst MEA-NPs. The computational strategy includes prescreening of millions of compositions, prediction of alloy formation by density functional theory calculations, and examination of structural stability by a hybrid Monte Carlo and molecular dynamics method. Selected compositions can be efficiently and rapidly synthesized at high temperature (e.g., 1500 K, 0.5 s) with excellent thermal stability. We applied these MEA-NPs for catalytic NH 3 decomposition and observed outstanding performance due to the synergistic effect of multi-elemental mixing, their small size, and the alloy phase. We anticipate that the computationally aided rational design and rapid synthesis of MEA-NPs are broadly applicable for various catalytic reactions and will accelerate material discovery.

36 MATERIALS SCIENCE↗