Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “computational costs”

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 271 records · Page 15
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Machine learning accelerated discrete element modeling of granular flows

Granular flows are widely encountered in many industrial processes and natural phenomena. Discrete Element Modeling (DEM) is a useful tool for understanding and troubleshooting devices, which handle granular materials. However, its applicability is significantly limited by the huge computational cost associated with detecting and computing collisions. In this research, the computation speed of DEM was accelerated by orders of magnitude using a convolutional neural network to replace the direct calculation of particle-particle and particle-boundary collisions. The MFiX software was used to generate the training and testing dataset. Additionally, a GPU accelerated TensorFlow model was used to train the neural network and test the results. The model fluctuations caused by different training steps were reduced with a multi-scale loss function. The accuracy was improved with more frames within one training step. The modeling of a rotating drum and a hopper demonstrated the accuracy and efficiency of this machine learning accelerated DEM in the simulation of granular flows.

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

Multifidelity methods for uncertainty quantification of a nonlocal model for phase changes in materials

This study is devoted to the construction of a multifidelity Monte Carlo (MFMC) method for the uncertainty quantification of a nonlocal, non-mass-conserving Cahn-Hilliard model for phase transitions with an obstacle potential. Here, we are interested in estimating the expected value of an output of interest (OoI) that depends on the solution of the nonlocal Cahn-Hilliard model. As opposed to its local counterpart, the nonlocal model captures sharp interfaces without the need for significant mesh refinement. However, the computational cost of the nonlocal Cahn-Hilliard model is higher than that of its local counterpart with similar mesh refinement, inhibiting its use for outer-loop applications such as uncertainty quantification. The MFMC method augments the desired high-fidelity, high-cost OoI with a set of lower-fidelity, lower-cost OoIs to alleviate the computational burden associated with nonlocality. Most of the computational budget is allocated to sampling the cheap surrogate models to achieve speedup, whereas the high-fidelity model is sparsely sampled to maintain accuracy. For the non-mass-conserving nonlocal Cahn-Hilliard model, the use of the MFMC method results in, for a given computational budget, about an order of magnitude reduction in the mean-squared error of the expected value of the OoI relative to that of the Monte Carlo method.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Molecular Viscosity and Diffusivity Effects in Transitional and Shock-Driven Mixing Flows

Here, this paper investigates the importance of molecular viscosity and diffusivity for the prediction of transitional and shock-driven mixing flows featuring high and low Reynolds and Mach number regions. Two representative problems are computed with implicit large-eddy simulations using the inviscid Euler equations (EE) and viscous Navier-Stokes equations (NSE): the Taylor-Green vortex at Reynolds number Re = 3000 and initial Mach number Ma = 0.28, and an air- SF 6 -air gas curtain subjected to two shock waves at Ma = 1.2. The primary focus is on differences between NSE and EE predictions due to viscous effects. The outcome of the paper illustrates the advantages of utilizing NSE. In contrast to the EE, where the effective viscosity decreases upon grid refinement, NSE predictions can be assessed for simulations of flows with transition to turbulence at prescribed constant Re. The NSE can achieve better agreement between solutions and reference data, and the results converge upon grid refinement. On the other hand, the EE predictions do not converge with grid refinement, and can only exhibit similarities with the NSE results at coarse grid resolutions. We also investigate the effect of viscous effects on the dynamics of the coherent and turbulent fields, as well as on the mechanisms contributing to the production and diffusion of vorticity. The results show that nominally inviscid calculations can exhibit significantly varying flow dynamics driven by changing effective resolution-dependent Reynolds number, and highlight the role of viscous processes affecting the vorticity field. These tendencies become more pronounced upon grid refinement. The discussion of the results concludes with the assessment of the computational cost of inviscid and viscous computations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS2022

Flows in Enthalpy-based Thermal Evolution of Loops

Plasma-filled loop structures are common in the solar corona. Because detailed modeling of the dynamical evolution of these structures is computationally costly, an efficient method for computing approximate but quick physics-based solutions is to rely on space-integrated 0D simulations. The enthalpy-based thermal evolution of loops (EBTEL) framework is a commonly used method to study the exchange of mass and energy between the corona and transition region. EBTEL solves for density, temperature, and pressure, averaged over the coronal part of the loop, velocity at coronal base, and the instantaneous differential emission measure distribution in the transition region. The current single-fluid version of the code, EBTEL2, assumes that at all stages the flows are subsonic. However, sometimes the solutions show the presence of supersonic flows during the impulsive phase of heat input. It is thus necessary to account for this effect. Here, we upgrade EBTEL2 to EBTEL3 by including the kinetic energy term in the Navier–Stokes equation. We compare the solutions from EBTEL3 with those obtained using EBTEL2, as well as the state-of-the-art field-aligned hydrodynamics code HYDRAD. We find that the match in pressure between EBTEL3 and HYDRAD is better than that between EBTEL2 and HYDRAD. Additionally, the velocities predicted by EBTEL3 are in close agreement with those obtained with HYDRAD when the flows are subsonic. However, EBTEL3 solutions deviate substantially from HYDRAD’s when the latter predicts supersonic flows. Using the mismatches in the solution, we propose a criterion to determine the conditions under which EBTEL can be used to study flows in the system.

Solar coronal heating↗
DOE OSTI2024

Multilevel Monte Carlo Estimators For Derivative-Free Optimization Under Uncertainty

Optimization is a key tool for scientific and engineering applications; however, in the presence of models affected by uncertainty, the optimization formulation needs to be extended to consider statistics of the quantity of interest. Optimization under uncertainty (OUU) deals with this endeavor and requires uncertainty quantification analyses at several design locations; i.e., its overall computational cost is proportional to the cost of performing a forward uncertainty analysis at each design location. An OUU workflow has two main components: an inner loop strategy for the computation of statistics of the quantity of interest, and an outer loop optimization strategy tasked with finding the optimal design, given a merit function based on the inner loop statistics. Here, in this work, we propose to alleviate the cost of the inner loop uncertainty analysis by leveraging the so-called multilevel Monte Carlo (MLMC) method, which is able to allocate resources over multiple models with varying accuracy and cost. The resource allocation problem in MLMC is formulated by minimizing the computational cost given a target variance for the estimator. We consider MLMC estimators for statistics usually employed in OUU workflows and solve the corresponding allocation problem. For the outer loop, we consider a derivative-free optimization strategy implemented in the SNOWPAC library; our novel strategy is implemented and released in the Dakota software toolkit. We discuss several numerical test cases to showcase the features and performance of our approach with respect to its Monte Carlo single fidelity counterpart.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Ensemble Kalman filter for data assimilation coupled with low-resolution computations techniques applied in fluid dynamics

This paper presents an innovative Reduced-order model (ROM) for merging experimental and simulation data using data assimilation (DA) to estimate the "True" state of a fluid dynamics system, leading to more accurate predictions. Our methodology introduces a novel approach by implementing the ensemble Kalman filter (EnKF) within a reduced-dimensional framework, grounded in a robust theoretical foundation and applied to fluid dynamics. To address the substantial computational demands of DA, the proposed ROM employs low-resolution (LR) techniques to drastically reduce computational costs. This innovative approach involves downsampling datasets for DA computations, followed by an advanced reconstruction technique based on low-cost singular value decomposition (lcSVD). The lcSVD method, a key innovation in this paper, has never been applied to DA before and offers a highly efficient way to enhance resolution with minimal computational resources. Our results demonstrate significant reductions in both computation time and RAM usage through these LR techniques without compromising the accuracy of the estimations. For instance, in a turbulent test case, for a data compression rate of 15.9, the LR approach can achieve a speed-up of 13.7 and a RAM compression of 90.9% while maintaining a low relative root mean square error (RRMSE) of 2.6%, compared to 0.8% in the high-resolution (HR) reference. Furthermore, we highlight the effectiveness of the EnKF in estimating and predicting the state of fluid flow systems based on limited observations and given low-fidelity numerical data. This paper highlights the potential of the proposed DA method in fluid dynamics applications, particularly for improving computational efficiency in CFD and related fields. Its ability to balance accuracy with low computational and memory costs makes it especially suitable for large-scale and real-time applications, such as environmental monitoring or engineering design. This method will be incorporated into ModelFLOWs-app.

Data Assimilation↗
DOE OSTI2026

Sparsity Applications for Gradient‐Based Optimization of Wind Farms

Optimizing wind farms is essential for designing efficient energy systems, especially as farms grow larger and span multiple sites. However, this optimization becomes increasingly challenging due to the rising computational cost associated with more turbines. Gradient‐based optimization methods scale better than gradient‐free approaches for large problems, but the most computationally expensive component remains the calculation of gradients for the objective function and constraint Jacobians. To address this, we propose leveraging sparsity to accelerate gradient evaluations and reduce the size of the constraint Jacobian. Wind farms naturally exhibit sparsity—many turbines do not influence each other under certain wind directions. However, unlike traditional sparse problems with fixed patterns, wind farm sparsity is dynamic, requiring new strategies to handle changing interactions efficiently. This paper presents a study of sparsity in wind farm optimization and introduces several methods to exploit it. These strategies are tested on multiple farms using the analytic Cumulative Curl model, with gradients computed via automatic differentiation (AD). The same sparsity‐aware techniques are also applicable to finite difference (FD) methods, where they can yield even greater speedups due to the high cost of directional evaluations. Results show that sparse methods achieve up to a 10x speedup with less than ± 5% variance in optimized wake losses compared to traditional methods. These findings suggest that sparsity‐aware optimization not only maintains solution quality but also scales efficiently with farm size, enabling more comprehensive design exploration at reduced computational cost.

17 WIND ENERGY↗
DOE OSTI2023

Active Learning Framework

Machine learning (ML) of interatomic potentials show great promise to accelerate scientific simulation, e.g., by emulating expensive computations at a high accuracy but much reduced computational cost. Training datasets are calculated from computationally expensive ab initio quantum mechanics methods, density functional theory (DFT). Trained on this data, an ML model can be very successful in predicting energy and forces for new atomic configurations. A critical factor is the quality and diversity of the training dataset. Thus, a highly automated approach to dataset construction based on active learning framework is designed suitable for material physics. The active learning scheme begins with fully randomized atomic configurations. Then, many Molecular Dynamics (MD) trajectories are simulated using current ML potentials, where each MD trajectory is initialized to a random disordered configuration. The temperature is varied in order to diversify the sampled configuration during these simulations. The variance of predictions for eight neural networks within an ensemble is analyzed to determine whether the model is operating as expected. This helps in determining whether collecting more data would be helpful to the model by checking the ensemble variance is greater than the threshold. In this case, the MD trajectory is terminated and the final atomic configuration is placed on a queue (SQL database) for DFT calculations and added to training dataset. Periodically, ML model is retrained to the updated training model. This Active Learning loop is iterated until the cost of MD simulations becomes prohibitively expensive. The MD simulations will hopefully be sufficiently robust to support nucleation after many active learning iterations. In this sense, active learning scheme must automatically discover the important low energy and nonequilibrium physics.

Nebgen, Benjamin↗
DOE OSTI2022

Machine-Learning Accelerated Studies of Materials with High Performance and Edge Computing

In the studies of materials, experimental measurements often serve as the reference to verify physics theory and modeling; while theory and modeling provide a fundamental understanding of the physics and principles behind. However, the interactions and cross validation between them have long been a challenge even to-date. Not only that inferring a physics model from experimental data is itself a difficult inverse problem, another major challenge is the orders-of-magnitude longer wall-clock time required to carry out high-fidelity computer modeling to match the timescale of experiments. We envisage that by combining high performance computing, data science, and edge computing technology, the current predicament can be alleviated, and a new paradigm of data-driven physics research will open up. For example, we can accelerate computer simulations by first performing the large-scale modeling on high performance computers and train a machine-learned surrogate model. This computationally inexpensive surrogate model can then be transferred to the computing units residing closely to the experimental facilities to perform high-fidelity simulations at a much higher throughout. The model will also be more amenable to analyzing and validating experimental observations in comparable time scales at a much lower computational cost. Further integration of these accelerated computer simulations with an outer machine learning loop can also inform and direct future experiments, while making the inverse problem of physics model inference more tractable. We will demonstrate a proof-of-concept by using a quantum Monte Carlo application, Dynamical Cluster Approximation (DCA++), to machine-learn a surrogate model and accelerate the study of quantum correlated materials.

Li, Ying Wai↗
DOE OSTI2025

Quantum Zeno Monte Carlo for computing observables

The recent development of logical quantum processors marks a pivotal transition from the noisy intermediate-scale quantum (NISQ) era to the fault-tolerant quantum computing (FTQC) era. These devices have the potential to address classically challenging problems with polynomial computational time using quantum properties. However, they remain susceptible to noise, necessitating noise resilient algorithms. We introduce Quantum Zeno Monte Carlo (QZMC), a classical-quantum hybrid algorithm that demonstrates resilience to device noise and Trotter errors while showing polynomial computational cost for a gapped system. QZMC computes static and dynamic properties without requiring initial state overlap or variational parameters, offering reduced quantum circuit depth.

Han, Mancheon [Korea Institute for Advanced Study ↗
DOE OSTI2023

Denial of Service Attack Detection via Differential Analysis of Generalized Entropy Progressions

Denial-of-Service (DoS) attacks are one the most common and consequential cyber attacks in computer networks. While existing research offers a plethora of detection methods, the issue of achieving scalability, a low false positive rate, and high detection accuracy remains open. In this work, we address this problem by developing a differential method based on generalized entropy progression. In this method, named as DoDGE, we continuously fit the line of best fit to the entropy progression of destination addresses and check if the derivative, that is, the slope of this line is less than the negative of the dynamically computed standard deviation of the derivatives. Furthermore, to distinguish from flash events, we leverage the symmetry that when a flash event occurs, the derivative of the entropy progression of source addresses is positive. With this design, we omit the usage of the thresholds and the results with five real-world network traffic datasets confirm that DoDGE outperforms threshold-based DoS attack detection by two orders of magnitude in terms of false positives on average. When compared to ten machine learning (ML) models, DoDGE achieves a balanced accuracy of 99%, while the average balanced accuracy for the ML models is 52%. Moreover, the results show that DoDGE successfully differentiates between a flash event and a DoS attack. Furthermore, since the main computation cost of DoDGE is the entropy computation, which is linear in the volume of the unit-time network flow, uses integer only operations, and works on a small fraction of the total flow, it is lightweight and scalable.

Cybersecurity, wireless communication↗
DOE OSTI2023

A MultiGPU Performance-Portable Solution for Array Programming Based on Kokkos

Today, multiGPU nodes are widely used in high-performance computing and data centers. However, current programming models do not provide simple, transparent, and portable support for automatically targeting multiple GPUs within a node on application areas of array programming. In this paper, we describe a new application programming interface based on the Kokkos programming model to enable array computation on multiple GPUs in a transparent and portable way across both NVIDIA and AMD GPUs. We implement different variations of this technique to accommodate the exchange of stencils (array boundaries) among different GPU memory spaces, and we provide autotuning to select the proper number of GPUs, depending on the computational cost of the operations to be computed on arrays, that is completely transparent to the programmer. We evaluate our multiGPU extension on Summit (#5 TOP500), with six NVIDIA V100 Volta GPUs per node, and Crusher that contains identical hardware/software as Frontier (#1 TOP500), with four AMD MI250X GPUs, each with 2 Graphics Compute Dies (GCDs)for a total of 8 GCDs per node. We also compare the performance of this solution against the use of MPI + Kokkos, which is the cur-rent de facto solution for multiple GPUs in Kokkos. Our evaluation shows that the new Kokkos solution provides good scalability for many GPUs and a faster and simpler solution (from a programming productivity perspective) than MPI + Kokkos.

Valero Lara, Pedro↗
DOE OSTI2024

Machine-Learned Linear Structural Dynamics

The tension between accuracy and computational cost is a common thread throughout computational simulation. One such example arises in the modeling of mechanical joints. Joints are typically confined to a physically small domain and yet are computationally expensive to model with a high-resolution finite element representation. A common approach is to substitute reduced-order models that can capture important aspects of the joint response and enable the use of more computationally efficient techniques overall. Unfortunately, such reduced-order models are often difficult to use, error prone, and have a narrow range of application. In contrast, we propose a new type of reduced-order model, leveraging machine learning, that would be both user-friendly and extensible to a wide range of applications.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Cloud-Based Demonstration of the Eastern Interconnection Situational Awareness Monitoring System (ESAMS)

This report describes a cloud-based implementation and field demonstration of the Eastern Interconnection Situational Awareness and Monitoring System (ESAMS). ESAMS was developed to support the detection and source localization of forced oscillations using synchrophasor measurements from tie-lines connecting areas served by different reliability coordinators (RCs), so that RCs could better coordinate their response to wide-area events. A previous effort had identified deployment barriers associated with hosting shared situational awareness tools at a single RC. To address these barriers, ESAMS was migrated to Amazon Web Services and evaluated in a six-month field demonstration. ISO New England (ISO-NE) and PJM streamed data to the platform using AWS Direct Connect and a site-to-site VPN, respectively. The resulting multi-utility measurement footprint enabled regional source localization across major portions of the U.S. Eastern Interconnection and supported routine identification of oscillation events. During the final three months of the trial, 24 events above 2 MW/MVAR were detected. The largest detected oscillation approached a 25 MW peak-to-peak amplitude, and the longest persisted intermittently for more than 11 hours. The demonstration also assessed operational considerations—including data transfer volumes, end-to-end latency, and cloud computing costs—and found that network and compute requirements were modest relative to typical cloud capabilities while providing performance comparable to prior on-premises deployments. Overall, the results indicate that cloud hosting can provide a practical path to shared interconnection-wide oscillation monitoring. The cloud ESAMS demonstration establishes a foundation for broader utility participation and for building future wide-area analytics that leverage measurements across organizational boundaries.

Follum, James D.↗
NASA NTRS1979

A system for processing Landsat and other georeferenced data for resource management applications

The NASA Earth Resources Laboratory has developed a transferrable system for processing Landsat and disparate data with capabilities for digital data classification, georeferencing, overlaying, and data base management. This system is known as the Earth Resources Data Analysis System. The versatility of the system has been demonstrated with applications in several disciplines. A description is given of a low-cost data system concept that is suitable for transfer to one's available in-house minicomputer or to a low-cost computer purchased for this purpose. Software packages are described that process Landsat data to produce surface cover classifications and that geographically reference the data to the UTM projection. Programs are also described that incorporate several sets of Landsat derived information, topographic information, soils information, rainfall information, etc., into a data base. Selected application algorithms are discussed and sample products are presented. The types of computers on which the low-cost data system concept has been implemented are identified, typical implementation costs are given, and the source where the software may be obtained is identified.

Whitley, S. L.↗
NASA NTRS2015

Higher-Order Methods for Compressible Turbulent Flows Using Entropy Variables

Turbulent flows have a large range of spatial and temporal scales which need to be resolved in order to obtain accurate predictions. Higher-order methods can provide greater efficiency for simulations requiring high spatial and temporal resolution, allowing for solutions with fewer degrees of freedom and lower computational cost than traditional second-order computational fluid dynamics (CFD) methods.1 Higher-order methods have been widely used for turbulent flows. However, the reduced numerical stabilization present in higher-order schemes implies that special care needs to be taken in the development of numerical methods to suppress nonlinear instabilities.2–6 In this work we present the development of a higher-order space-time discontinuous Galerkin method with a focus on the aspects of our numerical scheme required for ensuring nonlinear stability for turbulent simulations at high Reynolds numbers.

Diosady, Laslo T.↗
NASA NTRS1986

Computing Benefits and Costs for Propulsion Systems

Flexible computer model developed for evaluating benefits and costs of placing large space systems into operational orbits. Model contains performance envelopes of three primary propulsion systems for orbit transfer based on three low-thrust engines. Allows for any mission model to be input into program. Model also allows user to easily vary program to examine effects of various ratings and weighting of benefit parameters for baseline engines. Program written in FORTRAN IV for use on IBM 370 computer.

Hamlyn, K.↗
DOE OSTI2020

Code-to-code-to-experiment validation of LES-ALM wind farm simulators

The aim of this work is to present a detailed code-to-code comparison of two Large-Eddy Simulation (LES) solvers. Corresponding experimental measurements are used as a reference to validate the quality of the CFD simulations. The comparison highlights the effects of solver order on the solutions, and it tries to answer the question of whether a high order solver is necessary to capture the main characteristics of a wind farm. Both solvers were used on different grids to study their convergence behavior. While both solvers show a good match with experimental measurements, it appears that the low order solver is more accurate and substantially cheaper in terms of computational cost.

17 WIND ENERGY↗