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 1,297 records · Page 72

Transferable Dynamic Molecular Charge Assignment Using Deep Neural Networks

We report that the ability to accurately and efficiently compute quantum-mechanical partial atomistic charges has many practical applications, such as calculations of IR spectra, analysis of chemical bonding, and classical force field parametrization. Machine learning (ML) techniques provide a possible avenue for the efficient prediction of atomic partial charges. Modern ML advances in the prediction of molecular energies [i.e., the hierarchical interacting particle neural network (HIP-NN)] has provided the necessary model framework and architecture to predict transferable, extensible, and conformationally dynamic atomic partial charges based on reference density functional theory (DFT) simulations. Utilizing HIP-NN, we show that ML charge prediction can be highly accurate over a wide range of molecules (both small and large) across a variety of charge partitioning schemes such as the Hirshfeld, CM5, MSK, and NBO methods. To demonstrate transferability and size extensibility, we compare ML results with reference DFT calculations on the COMP6 benchmark, achieving errors of 0.004e – (elementary charge). This is remarkable since this benchmark contains two proteins that are multiple times larger than the largest molecules in the training set. An application of our atomic charge predictions on nonequilibrium geometries is the generation of IR spectra for organic molecules from dynamical trajectories on a variety of organic molecules, which show good agreement with calculated IR spectra with reference method. Critically, HIP-NN charge predictions are many orders of magnitude faster than direct DFT calculations. Lastly, these combined results provide further evidence that ML (specifically HIP-NN) provides a pathway to greatly increase the range of feasible simulations while retaining quantum-level accuracy.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Sensor placement algorithm development to maximize the efficiency of acid gas removal unit for integrated gasifiction combined sycle (IGCC) power plant with CO2 capture

Future integrated gasification combined cycle (IGCC) power plants with CO{sub 2} capture will face stricter operational and environmental constraints. Accurate values of relevant states/outputs/disturbances are needed to satisfy these constraints and to maximize the operational efficiency. Unfortunately, a number of these process variables cannot be measured while a number of them can be measured, but have low precision, reliability, or signal-to-noise ratio. In this work, a sensor placement (SP) algorithm is developed for optimal selection of sensor location, number, and type that can maximize the plant efficiency and result in a desired precision of the relevant measured/unmeasured states. In this work, an SP algorithm is developed for an selective, dual-stage Selexol-based acid gas removal (AGR) unit for an IGCC plant with pre-combustion CO{sub 2} capture. A comprehensive nonlinear dynamic model of the AGR unit is developed in Aspen Plus Dynamics® (APD) and used to generate a linear state-space model that is used in the SP algorithm. The SP algorithm is developed with the assumption that an optimal Kalman filter will be implemented in the plant for state and disturbance estimation. The algorithm is developed assuming steady-state Kalman filtering and steady-state operation of the plant. The control system is considered to operate based on the estimated states and thereby, captures the effects of the SP algorithm on the overall plant efficiency. The optimization problem is solved by Genetic Algorithm (GA) considering both linear and nonlinear equality and inequality constraints. Due to the very large number of candidate sets available for sensor placement and because of the long time that it takes to solve the constrained optimization problem that includes more than 1000 states, solution of this problem is computationally expensive. For reducing the computation time, parallel computing is performed using the Distributed Computing Server (DCS®) and the Parallel Computing® toolbox from Mathworks®. In this presentation, we will share our experience in setting up parallel computing using GA in the MATLAB® environment and present the overall approach for achieving higher computational efficiency in this framework.

97 MATHEMATICS AND COMPUTING↗

High-Resolution South American Wind Resource Data Downscaled with Generative Machine Learning Conditioned on Near-Surface Observations

High-resolution historical wind data was developed for the entirety of South America using the innovative Super-Resolution for Renewable Resource Data (sup3r) machine learning framework. The publicly available Sup3rWind South America dataset represents a significant advancement in wind resource data generation, leveraging generative machine learning conditioned on near-surface observations from the Meteorological Assimilation Data Ingest System (MADIS) to efficiently and accurately downscale coarse reanalysis data from the European Centre for Medium-Range Weather Forecasts (ERA5). This approach produces fine-scale, spatially and temporally coherent wind and meteorological fields hundreds of times more computationally efficient than traditional numerical weather modeling methods, enabling access to high-fidelity wind information across both continental and offshore regions. Sup3rWind South America builds on the earlier Sup3rWind Ukraine dataset through improvements in model architecture and outputs conditioned on near-surface observation inputs. As with the Ukraine data release, this dataset includes wind speed, wind direction, temperature, relative humidity, and pressure at a horizontal resolution of ~2 km, representing a 15x spatial enhancement relative to the 31 km ERA5 grid. Wind speed and direction are provided at 5-minute resolution, a 12x temporal refinement compared to the hourly ERA5 data, while temperature, relative humidity, and pressure remain at hourly resolution. The data covers all years from 2005 to 2024. Before downscaling, ERA5 inputs were bias-corrected using long-term monthly means and a limited number of quality-controlled observations to align large-scale statistics with regional conditions. The resulting dataset is the first publicly available high-resolution timeseries wind record that provides full spatial coverage of South America. Model validation demonstrates strong agreement with observations across several statistical metrics, consistent with other state-of-the-art high-resolution wind resource datasets. The potential applications of Sup3rWind South America span renewable energy resource assessment, energy system modeling, and grid resilience analysis. The 20-year record and high spatial and temporal resolution support accurate estimation of long-term energy yield and the economic feasibility of potential wind development sites. Continuous coverage across both continental and offshore regions enables comprehensive site prospecting within exclusive economic zones. The 2 km, 5-minute resolution data provide the spatial and temporal variability required for power system simulation, operational planning, and regional risk assessments.

17 WIND ENERGY↗

Model's sparse representation based on reduced mixed GMsFE basis methods

In this paper, we propose a model's sparse representation based on reduced mixed generalized multiscale finite element (GMsFE) basis methods for elliptic PDEs with random inputs. A typical application for the elliptic PDEs is the flow in heterogeneous random porous media. Mixed generalized multiscale finite element method (GMsFEM) is one of the accurate and efficient approaches to solve the flow problem in a coarse grid and obtain the velocity with local mass conservation. When the inputs of the PDEs are parameterized by the random variables, the GMsFE basis functions usually depend on the random parameters. This leads to a large number degree of freedoms for the mixed GMsFEM and substantially impacts on the computation efficiency. In order to overcome the difficulty, we develop reduced mixed GMsFE basis methods such that the multiscale basis functions are independent of the random parameters and span a low-dimensional space. To this end, a greedy algorithm is used to find a set of optimal samples from a training set scattered in the parameter space. Reduced mixed GMsFE basis functions are constructed based on the optimal samples using two optimal sampling strategies: basis-oriented cross-validation and proper orthogonal decomposition. Although the dimension of the space spanned by the reduced mixed GMsFE basis functions is much smaller than the dimension of the original full order model, the online computation still depends on the number of coarse degree of freedoms. To significantly improve the online computation, we integrate the reduced mixed GMsFE basis methods with sparse tensor approximation and obtain a sparse representation for the model's outputs. The sparse representation is very efficient for evaluating the model's outputs for many instances of parameters. To illustrate the efficacy of the proposed methods, we present a few numerical examples for elliptic PDEs with multiscale and random inputs. In particular, a two-phase flow model in random porous media is simulated by the proposed sparse representation method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

The multi-stream flows and the dynamics of the cosmic web

A new numerical technique to identify the cosmic web is proposed. It is based on locating multi-stream flows, i.e. the places where the velocity field is multi-valued. The method is local in Eulerian space, simple and computationally efficient. This technique uses the velocities of particles and thus takes into account the dynamical information. This is in contrast with the majority of standard methods that use the coordinates of particles only. Two quantities are computed in every mesh cell: the mean and variance of the velocity field. Ideally in the cells where the velocity is single-valued the variance must be equal to zero exactly, therefore the cells with non-zero variance are identified as multi-stream flows. The technique has been tested in the Zel'dovich approximation and in the N-body simulation of the ΛCDM model. The effect of numerical noise is discussed. The web identified by the new method has been compared with the web identified by the standard technique using only the particle coordinates. The comparison has shown overall similarity of two webs as expected, however they by no means are identical. For example, the isocontours of the corresponding fields have significantly different shapes and some density peaks of similar heights exhibit significant differences in the velocity variance and vice versa. This suggests that the density and velocity variance have a significant degree of independence. The shape of the two-dimensional pdf of density and velocity variance confirms this proposition. Thus, we conclude that the dynamical information probed by this technique introduces an additional dimension into analysis of the web.

79 ASTRONOMY AND ASTROPHYSICS↗

Fréchet kernels based on a fractional viscoacoustic wave equation

Incorporating the seismic attenuation into the waveform inversion framework could not only improve the accuracy of the velocity model but also provide an additional Q model. Recently, we proposed a viscoacoustic wave equation assisted by the fractional Laplacian operators to accurately model the wave propagation in heterogeneous attenuating media with computational efficiency. The explicit presence of Q as a coefficient in this equation suggests the potential to conveniently develop its full waveform inversion scheme. In this study, we utilize the adjoint-state method to formulate the computation of the Fréchet kernels with respect to both velocity and attenuation based on this wave equation. These kernels will play a fundamental role in the viscoacoustic multiparameter waveform inversion.

Xing, Guangchi↗

The Containment Assurance Risk Framework of the Mars Sample Return Program

The Mars Sample Return campaign aims at bringing rock and atmospheric samples from Mars to Earth through a series of robotic missions. These missions would collect the samples being cached and deposited on Martian soil by the Perseverance rover, place them in a container, and launch them into Martian orbit for subsequent capture by an orbiter that would bring them back. Given there exists a non-zero probability that the samples contain biological material, precautions are being taken to design systems that would break the chain of contact between Mars and Earth. These include techniques such as sterilization of Martian particles, redundant containment vessels, and a robust reentry capsule capable of accurate landings without a parachute. Requirements exist that the probability of containment not assured of Martian-contaminated material into Earth’s biosphere be less than one in a million. To demonstrate compliance with this strict requirement, a statistical framework was developed to assess the likelihood of containment loss during each sample return phase and make a statement about the total combined mission probability of containment not assured. The work presented here describes this framework, which considers failure modes or fault conditions that can initiate failure sequences ultimately leading to containment not assured. Reliability estimates are generated from databases, design heritage, component specifications, or expert opinion in the form of probability density functions or point estimates and provided as inputs to the mathematical models that simulate the different failure sequences. The probabilistic outputs are then combined following the logic of several fault trees to compute the ultimate probability of containment not assured. Given the multidisciplinary nature of the problem and the different types of mathematical models used, the statistical tools needed for analysis are required to be computationally efficient. While standard Monte Carlo approaches are used for fast models, a multi-fidelity approach to rare event probabilities is proposed for expensive models. In this paradigm, inexpensive low-fidelity models are developed for computational acceleration purposes while the expensive high-fidelity model is kept in the loop to retain accuracy in the results. This work presents an example of end-to-end application of this framework highlighting the computational benefits of a multi-fidelity approach.

Giuseppe Cataldo↗

A Comparison of Model Predictive Control Architectures for Application to Electrified Aircraft Propulsion Systems

As electrified aircraft propulsion (EAP) systems continue to mature, more sophisticated hardware and software are being developed to balance operations among electric machines and gas-turbine engines. In hybrid-electric propulsion systems, the increased complexity resulting from integrating turbine-engine shafts with electric machines necessitates control methodologies to account for various physical domains. Ideal controllers for hybrid-electric engines manage systems, subsystems, and their interactions in a coordinated fashion, able to account for safety and performance goals while being computationally efficient. In a previous work, linear model predictive control (MPC) schemes were implemented in centralized and distributed frameworks on a nonlinear turbofan engine model as a proof of concept. However, these schemes were not evaluated for computational complexity, prompting further study. The research presented here develops hierarchical MPC schemes to reduce the computational burden of the previous MPC schemes. A two-tier framework is implemented, where a slower sampling MPC controls electric machines and determines fan-speed tracking goals for a faster sampling controller, which is either a MPC or a proportional-integral (PI) controller. The proposed designs are compared to the centralized MPC investigated previously, and performance is measured via fan speed tracking error, energy storage state-of-charge, and computation time. Results reveal that the hierarchical MPC scheme employing a lower-level PI controller improves computation time while maintaining comparable tracking and state-of-charge regulation to the centralized scheme.

model predictive control↗

A Comparison of Model Predictive Control Architectures for Application to Electrified Aircraft Propulsion Systems

As electrified aircraft propulsion (EAP) systems continue to mature, more sophisticated hardware and software are being developed to balance operations among electric machines and gas-turbine engines. In hybrid-electric propulsion systems, the increased complexity resulting from integrating turbine-engine shafts with electric machines necessitates control methodologies to account for various physical domains. Ideal controllers for hybrid-electric engines manage systems, subsystems, and their interactions in a coordinated fashion, able to account for safety and performance goals while being computationally efficient. In a previous work, linear model predictive control (MPC) schemes were implemented in centralized and distributed frameworks on a nonlinear turbofan engine model as a proof of concept. However, these schemes were not evaluated for computational complexity, prompting further study. The research presented here develops hierarchical MPC schemes to reduce the computational burden of the previous MPC schemes. A two-tier framework is implemented, where a slower sampling MPC controls electric machines and determines fan-speed tracking goals for a faster sampling controller, which is either a MPC or a proportional-integral (PI) controller. The proposed designs are compared to the centralized MPC investigated previously, and performance is measured via fan speed tracking error, energy storage state-of-charge, and computation time. Results reveal that the hierarchical MPC scheme employing a lower-level PI controller improves computation time while maintaining comparable tracking and state-of-charge regulation to the centralized scheme.

model predictive control↗

Energy-Efficient Cruise Control Using Optimal Control for a Hybrid Electric Vehicle

Increasing connectivity in passenger vehicles provides for a large amount of look-ahead information about driving conditions. An intelligent control algorithm is presented that takes advantage of this information to obtain the operation strategy for the powertrain of a parallel hybrid electric vehicle, in an uncongested highway cruising situation. In order to guarantee sufficient computational efficiency to meet future online requirements, the algorithm is based on Pontryagin’s Minimum Principle. The whole driving/operation strategy is composed of a series of solutions to the optimal control sub-problem for each separate route segment. The control sequence computed offline is then evaluated in Autonomie. The simulation result shows 6% fuel savings compared to a baseline rule-based controller with no speed optimization.

Shen, Daliang↗

Polarized radiance fields under a dynamic ocean surface: a three-dimensional radiative transfer solution

The hybrid matrix operator, Monte Carlo (HMOMC) method previously reported [Appl. Opt.47, 1063-1071 (2008)APOPAI0003-693510.1364/AO.47.001063] is improved by neglecting higher-order terms in the coupling of the matrix operators and by introducing a dual grid scheme. The computational efficiency for solving the vector radiative transfer equation in a full 3D coupled atmosphere-surface-ocean system is substantially improved, and, thus, large-scale simulations of the radiance distribution become feasible. The improved method is applied to the computation of the polarized radiance field under realistic surface waves simulated by the power spectral density method. To the authors' best knowledge, this is the first time that the polarized radiance field under a dynamic ocean surface and the underwater image of an object above such an ocean surface have been reported.

58 GEOSCIENCES↗

A stochastic asymptotic-preserving scheme for a kinetic-fluid model for disperse two-phase flows with uncertainty

In this paper we consider a kinetic-fluid model for disperse two-phase flows with uncertainty. We propose a stochastic asymptotic-preserving (s-AP) scheme in the generalized polynomial chaos stochastic Galerkin (gPC-sG) framework, which allows the efficient computation of the problem in both kinetic and hydrodynamic regimes. The s-AP property is proved by deriving the equilibrium of the gPC version of the Fokker–Planck operator. The coefficient matrices that arise in a Helmholtz equation and a Poisson equation, essential ingredients of the algorithms, are proved to be positive definite under reasonable and mild assumptions. The computation of the gPC version of a translation operator that arises in the inversion of the Fokker–Planck operator is accelerated by a spectrally accurate splitting method. Numerical examples illustrate the s-AP property and the efficiency of the gPC-sG method in various asymptotic regimes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Characterizing the performance of node-aware strategies for irregular point-to-point communication on heterogeneous architectures

Supercomputer architectures are trending toward higher computational throughput due to the inclusion of heterogeneous compute nodes. These multi-GPU nodes increase on-node computational efficiency, while also increasing the amount of data to be communicated and the number of potential data flow paths. In this work, we characterize the performance of irregular point-to-point communication with MPI on heterogeneous compute environments through performance modeling, demonstrating the limitations of standard communication strategies for both device-aware and staging-through-host communication techniques. Presented models suggest staging communicated data through host processes then using node-aware communication strategies for high inter-node message counts. Notably, the models also predict that node-aware communication utilizing all available CPU cores to communicate inter-node data leads to the most performant strategy when communicating with a high number of nodes. Furthermore, model validation is provided via a case study of irregular point-to-point communication patterns in distributed sparse matrix–vector products. Importantly, we include a discussion on the implications model predictions have on communication strategy design for emerging supercomputer architectures.

97 MATHEMATICS AND COMPUTING↗

An efficient implementation of the localized operator partitioning method for electronic energy transfer

The localized operator partitioning method [Y. Khan and P. Brumer, J. Chem. Phys. 137, 194112 (2012)] rigorously defines the electronic energy on any subsystem within a molecule and gives a precise meaning to the subsystem ground and excited electronic energies, which is crucial for investigating electronic energy transfer from first principles. However, an efficient implementation of this approach has been hindered by complicated one- and two-electron integrals arising in its formulation. Using a resolution of the identity in the definition of partitioning, we reformulate the method in a computationally efficient manner that involves standard one- and two-electron integrals. We apply the developed algorithm to the 9 − ((1 − naphthyl) − methyl) − anthracene (A1N) molecule by partitioning A1N into anthracenyl and CH{sub 2} − naphthyl groups as subsystems and examine their electronic energies and populations for several excited states using configuration interaction singles method. The implemented approach shows a wide variety of different behaviors amongst the excited electronic states.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A Hybrid-Learning Algorithm for Online Dynamic State Estimation in Multimachine Power Systems

With the increasing penetration of distributed generators in the smart grids, having knowledge of rapid real-time electromechanical dynamic states has become crucial to system stability control. Conventional Supervisory Control and Data Acquisition (SCADA)-based dynamic state estimation (DSE) techniques are limited by the slow sampling rates, while the emerging phasor measurement units (PMUs) technology enables rapid real-time measurements at network nodes. Using generator bus terminal voltages, we propose a hybrid-learning DSE (HL-DSE) algorithm to estimate the synchronous machine rotor angle and speed in real time. The HL-DSE takes the power system model into account and trains neuroestimators with real-time data in an online manner. Compared with traditional DSE methods, the HL-DSE overcomes limitations by using a data-driven approach in conjunction with the physical power system model. The time efficiency, accuracy, convergence, and robustness of the proposed algorithm are tested under noises and fault conditions in both small- and large-scale test systems. Simulation results show that the proposed HL-DSE is much more computationally efficient than widely used Kalman filter (KF)-based methods while maintaining comparable accuracy and robustness. In particular, HL-DSE is over 100 times faster than square-root unscented KF (SR-UKF) and 80 times faster than extended KF (EKF). The advantages and challenges of the HL-DSE are also discussed.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Accurate and Accelerated Neuromorphic Network Design Leveraging A Bayesian Hyperparameter Pareto Optimization Approach

Neuromorphic systems allow for extremely efficient hardware implementations for neural networks (NNs). In recent years, several algorithms have been presented to train spiking NNs (SNNs) for neuromorphic hardware. However, SNNs often provide lower accuracy than their artificial NNs (ANNs) counterparts or require computationally expensive and slow training/inference methods. To close this gap, designers typically rely on reconfiguring SNNs through adjustments in the neuron/synapse model or training algorithm itself. Nevertheless, these steps incur significant design time, while still lacking the desired improvement in terms of training/inference times (latency). Designing SNNs that can mimic the accuracy of ANNs with reasonable training times is an exigent challenge in neuromorphic computing. In this work, we present an alternative approach that looks at such designs as an optimization problem rather than algorithm or architecture redesign. We develop a versatile multiobjective hyperparameter optimization (HPO) for automatically tuning HPs of two state-of-the-art SNN training algorithms, SLAYER and HYBRID. We emphasize that, to the best of our knowledge, this is the first work trying to improve SNNs’ computational efficiency, accuracy, and training time using an efficient HPO. We demonstrate significant performance improvements for SNNs on several datasets without the need to redesign or invent new training algorithms/architectures. Our approach results in more accurate networks with lower latency and, in turn, higher energy efficiency than previous implementations. In particular, we demonstrate improvement in accuracy and more than 5× reduction in the training/inference time for the SLAYER algorithm on the DVS Gesture dataset. In the case of HYBRID, we demonstrate 30% reduction in timesteps while surpassing the accuracy of the state-of-the-art networks on CIFAR10. Further, our analysis suggests that even a seemingly minor change in HPs could change the accuracy by 5 - 6×.

Parsa, Maryam↗

Elucidating the formation mechanisms of zeolites using data-driven modelling and in-situ characterization

Zeolites are the main solid catalysts used by the chemical industry. The use of zeolites in separations and as shape selective catalysts requires control of the width and connectivity of their pores. 235 distinct zeolite frameworks have been synthesized to date, of over 2 million that have been proposed. Recent work indicates that the limitation is in large part kinetic: new synthetic pathways are required to access new zeolites. Organic cations are used to direct the synthesis towards specific zeolites. However, the molecular mechanisms by which cations direct the nucleation towards specific zeolites is not known. Elucidating these mechanisms is key to realize new zeolites for catalysis and separations, and is the focus of this project. This project developed and implemented a synergistic, data-driven computational and experimental approach to resolve the molecular pathways of nucleation, growth, and polymorph selection of zeolites and the role of organic cations in directing their formation. The project developed computationally efficient and accurate models for the study of the nucleation and growth of pure silica zeolites in molecular simulations, using machine learning with data from experiments. Simulations with these models were integrated with scanning tunneling electron microscopy, computer vision, and deep learning to unveil the molecular pathways of formation of a zeolite. Of particular interest in this project was to elucidate the role of amorphous precursors in the nucleation of the zeolite. Previous experiments indicate that zeolites are born within non-crystalline aggregates in which the silicates and organic cations have local and medium range order similar to that of the zeolite. The organic cations that direct the formation of zeolites and those that direct the formation of ordered mesoporous silicas are similar. We hypothesized that the frustrated attraction that for large organic cations leads to the formation of stable mesophases that direct the synthesis of mesoporous silicas, could promote the formation of metastable mesophases that can assist in the nucleation and polymorph selection of zeolites. The simulations resolved how structure directing agents build crystalline order and showed that mesoscopic pre-ordering occurs is not required to facilitate the nucleation of zeolites, because the synthesis occurs at high driving forces, where the barriers for nucleation are negligible. This project unveiled that polymorph selection in zeolite synthesis occurs after nucleation, opening a distinct area of control through the kinetics of growth and not through nucleation barriers.

36 MATERIALS SCIENCE↗