Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “computational efficiency”

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 685 records · Page 38

Real-Time Compton Imaging for the GammaTracker Handheld CdZnTe Detector

We are currently developing a handheld radioisotope identifier containing 18 position-sensitive CdZnTe crystals. In addition to isotope identification, the device performs basic Compton imaging to determine the location of suspected sources. This paper presents two computationally efficient algorithms for this purpose. The first algorithm traces individual Compton cones onto the unit sphere, whereas the second algorithm computes the intersection of two Compton cones and the unit sphere. Simulations demonstrate that the algorithms are suitable for determining the directionality, even with features such as uncertainty calculations omitted. The one-cone algorithm works more efficiently at high count rates, but the two-cone algorithm generates fewer image artifacts.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Rate constants of chemical reactions from semiclassical transition state theory in full and one dimension

Semiclassical Transition State Theory (SCTST), a method for calculating rate constants of chemical reactions, offers gains in computational efficiency relative to more accurate quantum scattering methods. In full-dimensional (FD) SCTST, reaction probabilities are calculated from third and fourth potential derivatives along all vibrational degrees of freedom. However, the computational cost of FD SCTST scales unfavorably with system size, which prohibits its application to larger systems. In this study, the accuracy and efficiency of 1-D SCTST, in which only third and fourth derivatives along the reaction mode are used, are investigated in comparison to those of FD SCTST. Potential derivatives are obtained from numerical ab initio Hessian matrix calculations at the MP2/cc-pVTZ level of theory, and Richardson extrapolation is applied to improve the accuracy of these derivatives. Reaction barriers are calculated at the CCSD(T)/cc-pVTZ level. Results from FD SCTST agree with results from previous theoretical and experimental studies when Richardson extrapolation is applied. Results from our implementation of 1-D SCTST, which uses only 4 single-point MP2/cc-pVTZ energy calculations in addition to those for conventional TST, agree with FD results to within a factor of 5 at 250 K. This degree of agreement and the efficiency of the 1-D method suggest its potential as a means of approximating rate constants for systems too large for existing quantum scattering methods.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Model reduction for fractured porous media: a machine learning approach for identifying main flow pathways

Discrete fracture networks (DFN) are often used to model flow and transport in fractured porous media. The accurate resolution of flow and transport behavior on a large DFN involving thousands of fractures is computationally expensive. This makes uncertainty quantification studies of quantities of interest such as travel time through the network computationally intractable, since hundreds to thousands of runs of the DFN model are required to get bounds on the uncertainty of the predictions. Prior works on the subject demonstrated that the complexity of a DFN could be reduced by considering a sub-network of it (often termed a “backbone” sub-network), one whose flow and transport properties were then shown to be similar to that of the full network. The technique is tantamount to partitioning the complete set of fractures of a network into two disjoint sets, one of which is the backbone sub-network while the other its complement. It is in this context that we present a system-reduction technique for DFNs using supervised machine learning via a Random Forest Classifier that selects a backbone sub-network from the full set of fractures. The in-sample errors (in terms of precision and recall scores) of the trained classifier are found to be very accurate indicators of the out-of-sample errors, thus exhibiting that the classifier generalizes well to test data. Moreover, this system-reduction technique yields sub-networks as small as 12% of the full DFN that still recover transport characteristics of the full network such as the peak dosage and tailing behavior for late times. Most importantly, the sub-networks remain connected, and their size can be controlled by a single dimensionless parameter. Furthermore, measures of KL-divergence and KS-statistic for the breakthrough curves of the sub-networks with respect to the full network show physically realistic trends in that the measures decrease monotonically as the size of the sub-networks increase. In conclusion, the computational efficiency gained by this technique depends on the size of the sub-network, but large reductions in computational time can be expected for small sub-networks, yielding as much as 90% computational savings for sub-networks that are as small as 10-12% of the full network.

97 MATHEMATICS AND COMPUTING↗

Adaptive reduction of constitutive model-form error using a posteriori error estimation techniques

In engineering practice, models are typically kept as simple as possible for ease of setup and use, computational efficiency, maintenance, and overall reduced complexity to achieve robustness. In solid mechanics, a simple and efficient constitutive model may be favored over one that is more predictive, but is difficult to parameterize, is computationally expensive, or is simply not available within a simulation tool. In order to quantify the modeling error due to the choice of a relatively simple and less predictive constitutive model, we adopt the use of a posteriori model-form error-estimation techniques. Based on local error indicators in the energy norm, an algorithm is developed for reducing the modeling error by spatially adapting the material parameters in the simpler constitutive model. The resulting material parameters are not material properties per se , but depend on the given boundary-value problem. As a first step to the more general nonlinear case, we focus here on linear elasticity in which the “complex” constitutive model is general anisotropic elasticity and the chosen simpler model is isotropic elasticity. As a result, the algorithm for adaptive error reduction is demonstrated using two examples: (1) A transversely-isotropic plate with hole subjected to tension, and (2) a transversely-isotropic tube with two side holes subjected to torsion.

42 ENGINEERING↗

Representation of correlation statistics functions in heterogeneous materials using layered fast spherical harmonics expansion

Statistical correlation function, including two-point function, is one of the popular methods to digitize microstructure quantitatively. This paper investigated how to represent statistical correlations using layered fast spherical harmonics expansion. A set of spherical harmonics coefficients may be used to represent the corresponding microstructures. It is applied to represent carbon nanotube composite microstructures to demonstrate how efficiently and precisely the harmonics coefficients will characterize the microstructure. This microstructure representation methodology will dramatically improve the computational efficiencies for future works in microstructure reconstruction and property prediction.

77 NANOSCIENCE AND NANOTECHNOLOGY↗

The role of quantum computing in advancing scientific high-performance computing: A perspective from the ADAC institute

Quantum computing (QC) has gained significant attention over the past two decades due to its potential for speeding up classically demanding tasks. This transition from an academic focus to a thriving commercial sector is reflected in substantial global investments. While advancements in qubit counts and functionalities continue at a rapid pace, current quantum systems still lack the scalability for practical applications, facing challenges such as too high error rates and limited coherence times. Here, this perspective paper examines the relationship between QC and high-performance computing (HPC), highlighting their complementary roles in enhancing computational efficiency. It is widely acknowledged that even fully error-corrected QC will not be suited for all computational tasks. Rather, future compute infrastructures are anticipated to employ quantum acceleration within hybrid systems that integrate HPC and QC. While QC can enhance classical computing, traditional HPC remains essential for maximizing quantum acceleration. This integration is a priority for supercomputing centers and companies, sparking innovation to address the challenges of merging these technologies. The novelty of this work lies in its unique perspective, reflecting the collective insights of the Accelerated Data Analytics and Computing (ADAC) Institute, a global consortium of over 20 leading HPC centers. Recognizing the growing importance of QC, ADAC established a Quantum Computing Working Group in 2023 to foster collaboration and knowledge-sharing among its members. This paper synthesizes insights from the group’s collaborative efforts and incorporates findings from a member survey that captures shared experiences, ongoing projects, and strategic directions. By outlining the current landscape and challenges of QC integration into HPC ecosystems, this work offers HPC specialists practical and forward-looking guidance on the opportunities and implications of QC in computationally intensive endeavors.

Accelerated Data Analytics and↗

Improving Resilience of Bus Bunching Holding Strategy through a Rolling Horizon Approach

Providing public transportation with quality service is critical to attracting more passengers to the system. However, high-demand routes are prone to the so-called bus bunching -- a tendency of buses to group as a consequence of variations in travel times and demands. Bus holding is applied to overcome this effect. In this study, we present a novel method for bus holding in which the control law is based only on the buses' position using a computationally efficient rolling horizon approach. The method uses similar inputs as linear control approaches while not increasing significantly the computational time. However, the method overcomes key a weakness of the linear control approach thanks to the explicit constraint handling that always ensures the control action effectiveness. Simulation experiments in a validation case and a model-specific for a bus rapid transit line in Curitiba, Brazil showed a reduced holding time and improved resilience, delivering more than 20% reduction in delay time accounting for the on-board and station delays.

33 ADVANCED PROPULSION SYSTEMS↗

Calibrating constitutive models with full‐field data via physics informed neural networks

Abstract The calibration of solid constitutive models with full‐field experimental data is a long‐standing challenge, especially in materials that undergo large deformations. In this paper, we propose a physics‐informed deep‐learning framework for the discovery of hyperelastic constitutive model parameterizations given full‐field surface displacement data and global force‐displacement data. Contrary to the majority of recent literature in this field, we work with the weak form of the governing equations rather than the strong form to impose physical constraints upon the neural network predictions. The approach presented in this paper is computationally efficient, suitable for irregular geometric domains, and readily ingests displacement data without the need for interpolation onto a computational grid. A selection of canonical hyperelastic material models suitable for different material classes is considered including the Neo–Hookean, Gent, and Blatz–Ko constitutive models as exemplars for general non‐linear elastic behaviour, elastomer behaviour with finite strain lock‐up, and compressible foam behaviour, respectively. We demonstrate that physics informed machine learning is an enabling technology and may shift the paradigm of how full‐field experimental data are utilized to calibrate constitutive models under finite deformations.

Hamel, Craig M.↗

Workshop on Advanced Computing for Connected and Automated Vehicles

To safely and reliably operate without a human driver, connected and automated vehicles (CAVs) require more advanced computing hardware and software solutions than are implemented today in vehicles that provide driver-assistance features. A workshop was held to discuss advanced microelectronics and computing approaches that can help meet future energy and computational requirements for CAVs. Workshop questions were posed as follows: will highly automated vehicles be viable with conventional computing approaches or will they require a step-change in computing; what are the energy requirements to support on-board sensing and computing; and what advanced computing approaches could reduce the energy requirements while meeting their computational requirements? At present, there is no clear convergence in the computing architecture for highly automated vehicles. However, workshop participants generally agreed that there is a need to improve the computing performance per watt by at least 10x to advance the degree of automation. Participants suggested that DOE and the national laboratories could play a near-term role by developing benchmarks for determining and comparing CAV computing performance, developing public data sets to support algorithm and software development, and contributing precompetitive advancements in energy efficient computing.

33 ADVANCED PROPULSION SYSTEMS↗

A Novel Deep Reinforcement Learning Approach to Traffic Signal Control with Connected Vehicles

The advent of connected vehicle (CV) technology offers new possibilities for a revolution in future transportation systems. With the availability of real-time traffic data from CVs, it is possible to more effectively optimize traffic signals to reduce congestion, increase fuel efficiency, and enhance road safety. The success of CV-based signal control depends on an accurate and computationally efficient model that accounts for the stochastic and nonlinear nature of the traffic flow. Without the necessity of prior knowledge of the traffic system’s model architecture, reinforcement learning (RL) is a promising tool to acquire the control policy through observing the transition of the traffic states. In this paper, we propose a novel data-driven traffic signal control method that leverages the latest in deep learning and reinforcement learning techniques. By incorporating a compressed representation of the traffic states, the proposed method overcomes the limitations of the existing methods in defining the action space to include more practical and flexible signal phases. The simulation results demonstrate the convergence and robust performance of the proposed method against several existing benchmark methods in terms of average vehicle speeds, queue length, wait time, and traffic density.

42 ENGINEERING↗

Benchmarking Density Functional Theory Methods for Efficient Calculations of a Strongly Correlated Li 1– x Ni 1– y O 2−δ System

Transition metal oxides (TMOs), such as LiNiO 2 , are promising candidates for energy storage and electronic devices due to their unique electronic properties, exceptional physical and chemical characteristics, and ability to adopt multiple oxidation states. However, accurately predicting their properties using mean-field density functional theory (DFT) is challenging due to the presence of strongly correlated d-electrons and the complex interplay between their structural, electronic, and magnetic responses. These challenges are further exacerbated by the need to model defects, surfaces, and interfaces, which require computationally efficient, large-scale simulations. To address these issues, we carry out a benchmark study on the Li 1–x NiO 2 system, evaluating the performance of several popular functionals. Our findings demonstrate that combining SCAN functional relaxation with single-step HSE calculations provides a practical and scalable computational strategy. This approach balances accuracy and efficiency, enabling high-throughput simulations of strongly correlated TMOs and improved predictive modeling capability of TMOs for practical applications.

25 ENERGY STORAGE↗

A single-site multipole model for liquid water

Accurate and efficient empirical potential energy models that describe the atomistic interactions between water molecules in the liquid phase are essential for computer simulations of many problems in physics, chemistry, and biology, especially when long length or time scales are important. However, while models with non-polarizable partial charges at four or five sites in a water molecule give remarkably good values for certain properties, deficiencies have been noted in other properties and increasing the number of sites decreases computational efficiency. An alternate approach is to utilize a multipole expansion of the electrostatic potential due to the molecular charge distribution, which is exact outside the charge distribution in the limits of infinite distances or infinite orders of multipoles while partial charges are a qualitative representation of electron density as point charges. Here, a single-site multipole model of water is presented, which is as fast computationally as three-site models but is also more accurate than four- and five-site models. The dipole, quadrupole, and octupole moments are from quantum mechanical–molecular mechanical calculations so that they account for the average polarization in the liquid phase, and represent both the in-plane and out-of-plane electrostatic potentials of a water molecule in the liquid phase. This model gives accurate thermodynamic, dynamic, and dielectric properties at 298 K and 1 atm, as well as good temperature and pressure dependence of these properties.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A low-rank solver for the stochastic unsteady Navier–Stokes problem

Here we study a low-rank iterative solver for the unsteady Navier–Stokes equations for incompressible flows with a stochastic viscosity. The equations are discretized using the stochastic Galerkin method, and we consider an all-at-once formulation where the algebraic systems at all the time steps are collected and solved simultaneously. The problem is linearized with Picard’s method. To efficiently solve the linear systems at each step, we use low-rank tensor representations within the Krylov subspace method, which leads to significant reductions in storage requirements and computational costs. Combined with effective mean-based preconditioners and the idea of inexact solve, we show that only a small number of linear iterations are needed at each Picard step. The proposed algorithm is tested with a model of flow in a two-dimensional symmetric step domain with different settings to demonstrate the computational efficiency.

97 MATHEMATICS AND COMPUTING↗

High-Performance Computing Unlocks Innovation at NREL

Need to fly around a wind farm? Or step inside a molecule? NREL scientists use a super powerful (and highly energy-efficient) computer to visualize and solve big problems in renewable energy research.

17 WIND ENERGY↗

High-resolution methods for preserving the sum of mass fractions: improved χ-scheme and an alternative

When high resolution convection schemes are used for discretizing chemical species mass balance equations, the mass fractions are not guaranteed to add to one. We show that a proposed remedy called χ-scheme (Darwish and Moukalled, Comput.Methods Appl.Mech. Engrg. 192 (2003): 1711) will degrade to a diffusive first-order scheme when a chemical species vanishes from the mixture, for example, because of chemical reactions. We propose an improvement to the χ-scheme to overcome this problem. Furthermore, a computationally efficient alternative scheme is proposed and evaluated with several examples, to quantify the improvements in the accuracy and the computational time.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A moving morphable component‐based topology optimization approach considering transient structural dynamic responses

Abstract A novel approach is developed under the moving morphable component (MMC) framework to solve topology optimization problems considering transient structural dynamic responses, where the structure for optimization is constructed with a collection of structural components, and the structural layout can be described explicitly via only a small number of design variables characterizing the positions and geometries of the components. The transient dynamic response of the structure and corresponding sensitivities are computed via step‐by‐step numerical integration and mode reduction technique is also employed to enhance the computational efficiency. Compared with existing works, the numerical instabilities induced by localized vibration modes can be substantially alleviated and the computational effort for direct sensitivity analysis is significantly reduced in the proposed approach. Two and three‐dimensional numerical examples considering the cases of nonproportional damping mechanism and time‐varying mass are also provided to manifest the validity of the proposed approach.

Li, Jialin↗

Theory and numerics of subspace approximation of eigenvalue problems

Large-scale eigenvalue problems arise in various fields of science and engineering and demand computationally efficient solutions. In this study, we investigate the subspace approximation for parametric linear eigenvalue problems, aiming to mitigate the computational burden associated with high-fidelity systems. Furthermore, we provide general error estimates under non-simple eigenvalue conditions, establishing some theoretical foundations for understanding the convergence behavior of subspace approximations. Numerical examples, including problems with one-dimensional to three-dimensional spatial domain and one-dimensional to two-dimensional parameter domain, are presented to demonstrate the efficacy of reduced basis method in handling parametric variations in boundary conditions and coefficient fields to achieve significant computational savings while maintaining high accuracy, making them promising tools for practical applications in large-scale eigenvalue computations.

Eigenvalue problems↗

Multi-level Monte Carlo methods in chemical applications with Lennard-Jones potentials and other landscapes with isolated singularities

We describe and compare outcomes of various Multi-Level Monte Carlo (MLMC) method variants, motivated by the potential of improved computational efficiency over rejection based Monte Carlo, which scales poorly with problem dimension. With an eye toward its application to computational chemical physics, we test MLMC's ability to sample trajectories on two problems — a familiar double-well potential, with known stationary distributions, and a Lennard-Jones solid potential (a Galton Board). By sampling Brownian motion trajectories, we are able to compute expectations of observable averages. These multi-basin potential energy problems capture the essence of the challenges with using MLMC, namely, maintaining correspondence of sample paths as time-resolution is varied. Addressing this challenge properly can lead to MLMC significantly outperforming standard Monte Carlo path sampling. We describe the essence of this problem and suggest strategies that circumvent diverging multilevel sample paths for an important class of problems. In the tests we also compare the computational cost of several, “adaptive,” variants of MLMC. Our results demonstrate that MLMC overcomes the collision, time scale limitation of the more familiar Brownian path MC samplers, and our implementation provides tunable error thresholds, making MLMC a promising candidate for application to larger and more complex molecular systems.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗