Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “computation time”

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,279 records · Page 71

CFD simulations of electric motor end ring cooling for improved thermal management

Proper thermal management of an electric motor for vehicle applications extends its operating range. One cooling approach is to impinge Automatic Transmission Fluid (ATF) onto the rotor end ring. Increased ATF coverage correlates to enhanced heat transfer. Computational Fluid Dynamics (CFD) analytical tools provide a mechanism to assess motor thermal management prior to hardware fabrication. The complexity of the fluid flow (e.g., jet atomization, interface tracking, wall impingement) and heat transfer makes these simulations challenging. Computational costs are high when solving these flows on high-speed rotating meshes. Typically, a Volume-of Fluid (VOF) technique (i.e., two-fluid system) is used to resolve ATF dynamics within this rotating framework. Suitable numerical resolution of the relevant physics for thin films under strong inertial forces at high rotor speeds is computationally expensive, further increasing the run times. In this work, a numerical study of rotor-ring cooling by ATF is presented using a patent automated Cartesian cut-cell based method coupled with Automatic Mesh Refinement (AMR). This approach automatically creates the Cartesian mesh on-the-fly and can effectively handle complex rotating geometries by adaptively refining the mesh based on local gradients in the flow field which results in better resolution of the air-ATF interface. A Single non-inertial Reference Frame (SRF) approach is used to account for the rotating geometry and to further improve the overall computational efficiency. Quasi-steady state conditions are targeted in the analysis of the results. Important physics such as ATF jet structure, velocity detail near the air-jet interface, ATF coverage/accumulation on the ring surface, and cooling capacity are presented for a low-resolution Reynolds averaged Navier-Stokes (RANS), high-resolution RANS, and high-resolution Large-Eddy Simulation (LES) models. Computations are scaled over hundreds of cores on a supercomputer to maximize turnaround time. Each numerical approach is shown to capture the general trajectory of the oil jet prior to surface impingement. The high-resolution LES simulation, however, is superior in capturing small scale details and heat transfer between the free jet and surrounding air.

42 ENGINEERING↗

Measuring the Loschmidt Amplitude for Finite-Energy Properties of the Fermi-Hubbard Model on an Ion-Trap Quantum Computer

Calculating the equilibrium properties of condensed-matter systems is one of the promising applications of near-term quantum computing. Recently, hybrid quantum-classical time-series algorithms have been proposed to efficiently extract these properties from a measurement of the Loschmidt amplitude ⟨ ψ | e − i H ^ t | ψ ⟩ from initial states | ψ ⟩ and a time evolution under the Hamiltonian H ^ up to short times t . In this work, we study the operation of this algorithm on a present-day quantum computer. Specifically, we measure the Loschmidt amplitude for the Fermi-Hubbard model on a 16 -site ladder geometry (32 orbitals) on the Quantinuum H2-1 trapped-ion device. We assess the effect of noise on the Loschmidt amplitude and implement algorithm-specific error-mitigation techniques. By using a thus-motivated error model, we numerically analyze the influence of noise on the full operation of the quantum-classical algorithm by measuring expectation values of local observables at finite energies. Finally, we estimate the resources needed for scaling up the algorithm. Published by the American Physical Society 2024

Physics↗

Spatiotemporal pattern detection, generation, and computation with circuits

Abstract Implementations of neurons, delays, and synapse circuits are presented with simulations. These neural elements are used to create two small spiking neural networks, the Rate-Window and Order-Biased clusters, which are capable of detecting simple two-spike spatiotemporal patterns. A simple pattern detecting network (SPDN) is created by combining the Rate-Window and Order-Biased clusters, where clusters are small spiking neural networks, and its simple pattern detection ability is demonstrated in simulation. The SPDN is used to implement a complex pattern detecting network (CPDN) and its complex pattern detection ability is demonstrated in simulation. Methods for generating arbitrary spatiotemporal patterns are presented. The CPDN and spatiotemporal pattern generation methods are then used to implement a novel spatiotemporal computing paradigm based on detecting and responding to spatiotemporal symbols. A simulation of a spatiotemporal half adder is presented to demonstrate the computing paradigm.

97 - MATHEMATICS AND COMPUTING↗

Quasi-Classical Trajectory Calculation of Rate Constants Using an Ab Initio Trained Machine Learning Model (aML-MD) with Multifidelity Data

Machine learning (ML) provides a great opportunity for the construction of models with improved accuracy in classical molecular dynamics (MD). However, the accuracy of a ML trained model is limited by the quality and quantity of the training data. Generating large sets of accurate ab initio training data can require significant computational resources. Furthermore, inconsistent or incompatible data with different accuracies obtained using different methods may lead to biased or unreliable ML models that do not accurately represent the underlying physics. Recently, transfer learning showed its potential for avoiding these problems as well as for improving the accuracy, efficiency, and generalization of ML models using multifidelity data. In this work, ab initio trained ML-based MD (aML-MD) models are developed through transfer learning using DFT and multireference data from multiple sources with varying accuracy within the Deep Potential MD framework. Further, the accuracy of the force field is demonstrated by calculating rate constants for the H + HO 2 → H 2 + 3 O 2 reaction using quasi-classical trajectories. We show that the aML-MD model with transfer learning can accurately predict the rate constants while reducing the computational cost by more than five times compared to the use of more expensive quantum chemistry training data sets. Hence, the aML-MD model with transfer learning shows great potential in using multifidelity data to reduce the computational cost involved in generating the training set for these potentials.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Provably accurate simulation of gauge theories and bosonic systems

Quantum many-body systems involving bosonic modes or gauge fields have infinite-dimensional local Hilbert spaces which must be truncated to perform simulations of real-time dynamics on classical or quantum computers. To analyze the truncation error, we develop methods for bounding the rate of growth of local quantum numbers such as the occupation number of a mode at a lattice site, or the electric field at a lattice link. Our approach applies to various models of bosons interacting with spins or fermions, and also to both abelian and non-abelian gauge theories. We show that if states in these models are truncated by imposing an upper limit Λ on each local quantum number, and if the initial state has low local quantum numbers, then an error at most ϵ can be achieved by choosing Λ to scale polylogarithmically with ϵ − 1 , an exponential improvement over previous bounds based on energy conservation. For the Hubbard-Holstein model, we numerically compute a bound on Λ that achieves accuracy ϵ , obtaining significantly improved estimates in various parameter regimes. We also establish a criterion for truncating the Hamiltonian with a provable guarantee on the accuracy of time evolution. Building on that result, we formulate quantum algorithms for dynamical simulation of lattice gauge theories and of models with bosonic modes; the gate complexity depends almost linearly on spacetime volume in the former case, and almost quadratically on time in the latter case. We establish a lower bound showing that there are systems involving bosons for which this quadratic scaling with time cannot be improved. By applying our result on the truncation error in time evolution, we also prove that spectrally isolated energy eigenstates can be approximated with accuracy ϵ by truncating local quantum numbers at Λ = polylog ( ϵ − 1 ) .

Tong, Yu↗

Deployment and Evaluation of SciStream on OLCF's Advanced Computing Ecosystem (ACE)

The growing demand for real-time analysis, experimental steering, and decision-making in scientific workflows has created a need for tightly coupled integrations between experimental facilities and high-performance computing (HPC) systems. The Department of Energy’s Integrated Research Infrastructure (IRI) initiative highlights data streaming as a key capability for enabling memory-to-memory data transfers, bypassing the limitations of traditional store-and-forward models. SciStream is a toolkit developed by researchers at Argonne National Laboratory (ANL) to support such streaming by addressing cross-domain security, delegated authentication, and application transparency. We deployed and evaluated SciStream on the Oak Ridge Leadership Computing Facility’s (OLCF) Advanced Computing Ecosystem (ACE) infrastructure, leveraging the Olivine OpenShift cluster and its high-bandwidth Data Streaming Nodes (DSNs) as gateway nodes. Our evaluation included synthetic streaming workloads derived from IRI science workflows, a streaming simulator, and integration with RabbitMQ to handle low-level messaging. This report documents the deployment process, performance evaluation, and challenges encountered, along with opportunities for future improvements.

97 MATHEMATICS AND COMPUTING↗

High-Performance Computing Based EMT Simulation of Large PV or Hybrid PV Plants

Faults in the transmission grid have led to reduced power generation from power electronics resources that are typically not connected to the faulted transmission line. In many of the cases, partial loss of power is observed within the power electronics resources like large photovoltaic (PV) power plants. This phenomena is not captured in existing simulation models and/or simulators. High-fidelity switched system electromagnetic transient (EMT) dynamic models of PV power plants can improve the fidelity of models available for accurate analysis of the impact on PV plants during simulation of faults. However, these models are extremely computationally expensive and take a long time to simulate. Long simulation times limit the ability to use these models as larger regions are studied in EMT simulations with more power electronics resources. In this paper, numerical simulation algorithms are combined with high-performance computing techniques and applied to the high-fidelity switched system EMT model of PV plants. Using these techniques, a speed-up of up to 58x is obtained, while preserving the accuracy of the simulation at greater than 98%.

Debnath, Suman↗

Spatiotemporal Downscaling Model for Solar Irradiance Forecast Using Nearest-Neighbor Random Forest and Gaussian Process

Accurate solar photovoltaic (PV) capacity estimation requires high-resolution, site-specific solar irradiance data to account for localized variability. However, global datasets, such as the National Solar Radiation Database (NSRDB), provide regional averages that fail to capture the fine-scale fluctuations critical for large-scale grid integration. This limitation is particularly relevant in the context of increasing distributed energy resources (DERs) penetration, such as rooftop PV. Additionally, it is critical to the implementation of the U.S. Federal Energy Regulatory Commission (FERC) Order 2222, which facilitates DER participation in U.S. bulk power markets. To address this challenge, this study evaluates Nearest-Neighbor Random Forest (NNRF) and Nearest-Neighbor Gaussian Process (NNGP) models for spatiotemporal downscaling of global solar irradiance data. By leveraging historical irradiance and meteorological data, these models incorporate spatial, temporal, and feature-based correlations to enhance local irradiance predictions. The NNRF model, a machine-learning approach, prioritizes computational efficiency and predictive accuracy, while the NNGP model offers a level of interpretability and prediction uncertainty by numerically quantifying correlations and dependencies in the data. Model validation was conducted using day-ahead predictions. The results showed that the average Goodness of Fit (GoF) of the NNRF model of 90.61% across all eight sites outperformed the GoF of the NNGP of 85.88%. Additionally, the computational speed of NNRF was 2.5 times faster than the NNGP. Finally, the NNGP displayed polynomial scaling while the NNRF scaled linearly with increasing number of nearest neighbors. Additional validation of the model on five sites in Puerto Rico further confirmed the superiority of the NNRF model over the NNGP model. These findings highlight the robustness and computational efficiency of NNRF for large-scale solar irradiance downscaling, making it a strong candidate for improving PV capacity estimation and real-time electricity market integration for DERs.

Asiedu, Shadrack (ORCID:0009000646004826)↗

Intelligent Monitoring Systems and Advanced Well Integrity and Mitigation

Long-term seismic monitoring of carbon capture and storage projects is needed to verify that the injected gas is safely stored in the subsurface until permanence can be assured. Conventional surface seismic monitoring techniques are usually expensive, require highly invasive surface operations, and need significant time investments on the part of personnel for both the field effort and processing the acquired data. For these reasons, permanent reservoir monitoring technologies are preferred, as they can offer a cost-effective solution for long-term monitoring. As part of the monitoring program of the Archer Daniels Midland’s large-scale injection of CO 2 in Decatur, Illinois, USA, a continuous seismic monitoring array was installed using a combination of surface orbital vibrator (SOV) sources and fiber-optic cables for distributed acoustic sensing (DAS) acquisition with the objective to build a continuous monitoring array. The aim of the presented project was to build a monitoring array and platform that integrates real-time seismic data with conventional data streams and provides continuous data analysis using dynamic computational models to deliver a comprehensive real-time assessment of subsurface conditions. It is in this context that the Intelligent Monitoring Systems and Advanced Well Integrity and Mitigation project was proposed with the objective to develop an integrated architecture that utilizes a permanent seismic monitoring network, combines the real-time geophysical and process data with reservoir flow and geomechanical models to create a comprehensive monitoring, visualization, and control system that delivers critical information for process surveillance and optimization.

54 ENVIRONMENTAL SCIENCES↗

On the novel 3-D neutron transport kinetic tRAPID algorithm and its validation

The Real-time Analysis for Particle-transport and In-situ Detection (RAPID) Code System, based on the Multi-stage Response-function Transport (MRT) methodology, allows for real-time simulation of nuclear systems based on 3-D continuous-energy particle transport. RAPID's steady-state (criticality) neutron transport algorithm is based on the Fission Matrix (FM) method, and has been extensively verified and validated against computational benchmarks and experiments. This paper introduces the novel 3-D time-dependent transport algorithm that has been implemented into the code, tRAPID, and its validation using the JSI TRIGA Mark-II reactor. tRAPID accurately and efficiently calculates neutron kinetics parameters (such as β{sub eff}, l{sub eff} , Λ, α{sub Rossi}) and 3-D time-dependent neutron fission source distribution and neutron importances for both prompt and delayed neutrons. tRAPID is used to simulate a rod insertion experiment performed at the JSI TRIGA Mark-II reactor, during which signals from four fission chambers at four different locations in the core were collected. The results demonstrate how tRAPID is capable of calculating detailed and accurate results with only a minimal use computational resources and time.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Simulations for HEP with SQMS Quantum Hardware (Snowmass2021 - Letter of Interest)

The Superconducting Quantum Materials and Systems (SQMS) Center, a Fermilab lead NQI center, will develop and deploy a beyond state of the art quantum computers. These systems will exhibit long coherent times, and a high degree of connectivity. We are interested in exploring the utility of these devices to address computational challenges in HEP, such as the simulation of strongly coupled quantum field theories. A progression of toy models and simulations can begin to chart a course towards simulating QCD-like systems.

42 ENGINEERING↗

Retrieval of temperature and humidity profiles from ground-based high-resolution infrared observations using an adaptive fast iterative algorithm

Various retrieval algorithms have been developed for retrieving temperature and water vapor profiles from Atmospheric Emitted Radiance Interferometer (AERI) observations. The physical retrieval algorithm, named AERI Optimal Estimation (AERIoe), outperforms other retrieval algorithms in many aspects except the retrieval time, which is significantly increased due to the complex radiative transfer process. The calculation of the Jacobian matrix is the most computationally intensive step of the physical retrieval algorithm. Interestingly, an analysis of the change in AERI observations' information content with respect to Jacobians revealed that the AERIoe algorithm's performance presents negligible dependence on these metrics. Thus, the Jacobian matrix could remain unchanged when the variation in the atmospheric state is small in the retrieval process to reduce the most time-consuming computation. On the basis of the above findings, a fast physical–iterative retrieval algorithm was proposed by adaptively recalculating Jacobians in keeping with the changes in the atmospheric state. Experiments with synthetic observations demonstrate that the proposed method experiences an average reduction in retrieval time by an impressive 59 % compared to the original AERIoe algorithm while achieving maximum root-mean-square errors of less than 0.95 K and 0.22 log(ppmv) for heights below 3 km for the temperature and water vapor profile, respectively. Further analyses revealed that the fast-retrieval algorithm reached an acceptable convergence rate of 98.7 %, marginally lower than AERIoe's 99.9 % convergence rate for the 826 cases used in this study.

54 ENVIRONMENTAL SCIENCES↗

Rapid neutron and gamma-ray source localization using machine learning

Rapid localization of radiation sources is critical for applications including nuclear emergency response, safeguards, and security. However, conventional imaging systems such as neutron scatter cameras and Compton cameras depend on rare coincidence events, which often result in long acquisition times. In this work, we address the challenge of rapid source localization by developing a machine learning approach to predict the direction of a single radiation source using only count rates from an array of neutron and gamma-ray detectors. The proposed model is a fully connected neural network (FCNN) trained using Monte Carlo simulation data from a 252 Cf source. The model hyperparameters are optimized with a small set of routine 252 Cf measurements. We benchmarked the performance of the trained and optimized machine learning model using additional 252 Cf , 137 Cs , and PuBe measurements under laboratory conditions with varying source-detector configurations. For these measurements, the machine learning model achieved a mean localization error smaller than 30° with 3 x 10 3 system counts, corresponding to 8 s measurement time for the imaging system used in this work. In this low-statistics regime, the method outperformed traditional scatter-based imaging by more than 75% in localization accuracy for the evaluated measurement configurations. These results demonstrate that a machine learning-based approach can significantly reduce the time required for accurate single-source localization, providing a robust and computationally efficient alternative to traditional imaging systems in time-critical nuclear security and emergency response scenarios.

Gamma-ray imaging↗

Tomo2Mesh: Fast Reconstruction and Visualization of Tomography Data in Mesh Format

Tomo2Mesh is an open-source project targeted towards real-time reconstruction, segmentation, and visualization of computed tomography (CT) data in mesh format. The CT reconstruction scheme is based on filtered back-projection of voxel subsets. The segmentation scheme uses a 3D convolutional neural network. To allow for fast, real-time reconstruction, voxel subsets are first identified by coarse reconstruction. The detail in specific regions of interest is improved through full reconstruction of voxel subsets in that region. Data structures are implemented to store and process voxel subsets. Finally, voxel data is labeled using connected components to detect disconnected regions such as voids whose morphological attributes (e.g., Feret diameter, principal axis orientation, local number density, size, etc.) can be measured also in real-time. Finally, a fast marching cubes implementation processes labeled voxel data into a triangular face mesh (vertices and faces) in .ply format for visualization in Paraview or other mesh visualization tools. The code provides a simple programming interface for detecting, classifying, and visualizing regions of interest based on morphology. For example, detected voids can be classified as round pores or extended cracks. Highly porous neighborhoods can be identified based on local number density. The mesh texture (or color) is assigned based these morphological attributes to allow smart visualization scenarios in real-time (e.g., show only long cracks). At the time of first release (July 2022), extraction of face mesh for visualization for raw CT data from a 2 megapixel camera would take between 1-5 minutes for most scenarios.

TEKAWADE, ANIKET↗

A computational modeling framework for pre-clinical evaluation of cardiac mapping systems

There are a variety of difficulties in evaluating clinical cardiac mapping systems, most notably the inability to record the transmembrane potential throughout the entire heart during patient procedures which prevents the comparison to a relevant “gold standard”. Cardiac mapping systems are comprised of hardware and software elements including sophisticated mathematical algorithms, both of which continue to undergo rapid innovation. The purpose of this study is to develop a computational modeling framework to evaluate the performance of cardiac mapping systems. The framework enables rigorous evaluation of a mapping system’s ability to localize and characterize (i.e., focal or reentrant) arrhythmogenic sources in the heart. The main component of our tool is a library of computer simulations of various dynamic patterns throughout the entire heart in which the type and location of the arrhythmogenic sources are known. Our framework allows for performance evaluation for various electrode configurations, heart geometries, arrhythmias, and electrogram noise levels and involves blind comparison of mapping systems against a “silver standard” comprised of computer simulations in which the precise transmembrane potential patterns throughout the heart are known. A feasibility study was performed using simulations of patterns in the human left atria and three hypothetical virtual catheter electrode arrays. Activation times (AcT) and patterns (AcP) were computed for three virtual electrode arrays: two basket arrays with good and poor contact and one high-resolution grid with uniform spacing. The average root mean squared difference of AcTs of electrograms and those of the nearest endocardial action potential was less than 1 ms and therefore appears to be a poor performance metric. In an effort to standardize performance evaluation of mapping systems a novel performance metric is introduced based on the number of AcPs identified correctly and those considered spurious as well as misclassifications of arrhythmia type; spatial and temporal localization accuracy of correctly identified patterns was also quantified. This approach provides a rigorous quantitative analysis of cardiac mapping system performance. Proof of concept of this computational evaluation framework suggests that it could help safeguard that mapping systems perform as expected as well as provide estimates of system accuracy.

59 BASIC BIOLOGICAL SCIENCES↗

xSDK: Building an ecosystem of highly efficient math libraries for exascale

Current efforts to build increasingly powerful computer architectures are opening up new avenues for more complex and higher fidelity simulations coupled with data analytics and learning, leading to new scientific insights and deeper understanding. At one extreme, exascale computers will be much faster than previous computer generations (performing 10 18 operations per second—that is, 1,000 times faster than petascale). To achieve these performance improvements, computer architectures are becoming increasingly complex, with deep memory hierarchies, very high node and core counts, and heterogeneous features such as graphics processing units (GPUs). Such architectural changes impact the full breadth of computing scales, as heterogeneity pervades even current-generation laptops, workstations, and moderate-sized clusters. While emerging advanced architectures provide unprecedented opportunities, they also present significant challenges for developers of scientific applications, such as multiphysics and multiscale codes, who must adapt their software to handle disruptive changes in architectures and new programming models that have not yet stabilized. Developers must consider increasing concurrency while reducing communication and synchronization, and other complexities such as the potential for using mixed precision to leverage the compute power available in low-precision tensor cores. On one hand, developers must implement new scientific capabilities, which in turn increase code complexity. On the other hand, the codes must be ported to new architectures, requiring the inclusion of new programming models and the restructuring of code to achieve good performance. Addressing these issues is beyond the capability of any single person or team—leading to the need for collaboration among many teams, who encapsulate their expertise in reusable software and work together to create sustainable software ecosystems.

97 MATHEMATICS AND COMPUTING↗

The symmetric quasi-classical model using on-the-fly time-dependent density functional theory within the Tamm–Dancoff approximation

The primary computational challenge when simulating nonadiabatic ab initio molecular dynamics is the unfavourable compute costs of electronic structure calculations with molecular size. Simple electronic structure theories, like time-dependent density functional theory within the Tamm–Dancoff approximation (TDDFT/TDA), alleviate this cost for moderately sized molecular systems simulated on realistic time scales. Although TDDFT/TDA does have some limitations in accuracy, an appealing feature is that, in addition to including electron correlation through the use of a density functional, the cost of calculating analytic nuclear gradients and nonadiabatic coupling vectors is often computationally feasible even for moderately sized basis sets. Here in this work, some of the benefits and limitations of TDDFT/TDA are discussed and analysed with regard to its applicability as a ‘back-end’ electronic structure method for the symmetric quasi-classical Meyer–Miller model (SQC/MM). In order to investigate the benefits and limitations of TDDFT/TDA, SQC/MM is employed to predict and analyse a prototypical example of excited-state hydrogen transfer in gas-phase malonaldehyde. Then, the ring-opening dynamics of selenophene are simulated, which highlight some of the deficiencies of TDDFT/TDA. Additionally, some new algorithms are proposed that speed up the calculation of analytic nuclear gradients and nonadiabatic coupling vectors for a set of excited electronic states.

molecular dynamics↗

Multi-spatio-temporal scales PIV in a turbulent buoyant jet discharging in a linearly stratified environment

Time-resolved particle image velocimetry is implemented with a camera array and several laser sheets; this results in a multi-spatio-temporal scale system that is modular and flexible. The setup is optimized to capture global flow features, while locally resolving in space and time near the Kolmogorov scale. The apparatus relies extensively on machine vision CMOS cameras; they are inexpensive and stream to computer hard drive with virtually continuous time-resolved records (up to one hour for the current system). This leads to statistically converged data and also helps in minimizing down time between experimental runs. Details of the implementation and design of experiment are reported. The system instruments a vertical buoyant jet discharging in a linearly stratified environment. Refractive index matched aqueous solutions enable precise optical deployment. The density difference is 3% and the fluids have similar dynamic viscosity. The jet Reynolds number is 2.00 x 10 4 and is above the mixing transition. Such flows are typically challenging to instrument and few velocity field data are available to date. The velocity statistics are reported as well as first insights gained from the campaign.

42 ENGINEERING↗