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 127 records · Page 7
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Matrix Approach to Accelerate Spin-Up of CLM5

Numerical models have been developed to investigate and understand responses of biogeochemical cycle to global changes. Steady state, when a system is in dynamic equilibrium, is generally required to initialize these model simulations. However, the spin-up process that is used to achieve steady state pose a great burden to computational resources, limiting the efficiency of global modeling analysis on biogeochemical cycles. This study introduces a new Semi-Analytical Spin-Up (SASU) to tackle this grand challenge. We applied SASU to Community Land Model version 5 and examined its computational efficiency and accuracy. At the Brazil site, SASU is computationally 7 times more efficient than (or saved up to 86% computational cost in comparison with) the traditional native dynamics (ND) spin-up to reach the same steady state. Globally, SASU is computationally 8 times more efficient than the accelerated decomposition spin-up and 50 times more efficient than ND. In summary, SASU achieves the highest computational efficiency for spin-up on site and globally in comparison with other spin-up methods. It is generalizable to wide biogeochemical models and thus makes computationally costly studies (e.g., parameter perturbation ensemble analysis and data assimilation) possible for a better understanding of biogeochemical cycle under climate change.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2022

B-DeepONet: An enhanced Bayesian DeepONet for solving noisy parametric PDEs using accelerated replica exchange SGLD

Here, the Deep Operator Network (DeepONet) is a neural network architecture used to approximate operators, including the solution operator of parametric PDEs. DeepONets have shown remarkable approximation ability. However, the performance of DeepONets deteriorates when the training data is polluted with noise, a scenario that occurs in practice. To handle noisy data, we propose a Bayesian DeepONet based on replica exchange Langevin diffusion (reLD). Replica exchange uses two particles. The first particle trains a DeepONet to exploit the loss landscape and make predictions. The other particle trains a different DeepONet to explore the loss landscape and escape local minima via swapping. Compared to DeepONets trained with state-of-the-art gradient-based algorithms (e.g., Adam), the proposed Bayesian DeepONet greatly improves the training convergence for noisy scenarios and accurately estimates the uncertainty. To further reduce the high computational cost of the reLD training of DeepONets, we propose (1) an accelerated training framework that exploits the DeepONet's architecture to reduce its computational cost up to 25% without compromising performance and (2) a transfer learning strategy that accelerates training DeepONets for PDEs with different parameter values. Finally, we illustrate the effectiveness of the proposed Bayesian DeepONet using four parametric PDE problems.

97 MATHEMATICS AND COMPUTING↗
NASA NTRSDate not supplied

The Effect of Fiber-Angle Fidelity on the Linear Response of Tow-steered Composite Plates

Composite laminate tailoring is traditionally performed by uniformly changing the in-plane ply orientation to obtain the desired mechanical performance. The emergence of tow-steered plies, where the fibers follow a prescribed curvilinear path, have increased the tailorability of composite laminates. However, characterizing the behavior of tow-steered laminates using finite element analysis is challenging because additional, and often numerous, orientation definitions may be required. The additional orientation definitions detrimentally increase the computational cost and hinder the use of advanced analysis techniques, such as Monte Carlo or uncertainty quantification, in the design process. To reduce computational cost without adversely affecting mechanics-based performance, the results of a parametric study that was used to investigate the effects of fiber-angle fidelity, element size, and tow-steered radius-of-curvature on various loading scenarios for tow-steered composite plates are presented. The three loading scenarios that were analyzed using finite element analysis included an axial tension load, an applied constant through-thickness-direction pressure load, and an axial compression load. Results for mechanics-based metrics of interest are presented and discussed for each loading scenario. Little sensitivity (less than one percent difference) to the effect of fiber-angle fidelity is observed in the mechanics-based metrics until the coarse-end of the considered range. Sensitivity to element size generally dominates the observed results for the mechanics-based metrics. Notable reductions in the preprocessing time are observed for increasingly coarse element size and fiber-rounding parameters. The preprocessing times decreased up to three orders of magnitude from a few thousand seconds to a few seconds without loss of accuracy in the mechanics-based metrics. Such increased computational performance is of particular interest to the structural design and analysis communities that may be conducting large counts of finite-element analyses, such as in other parametric studies, Monte-Carlo analyses, uncertainty quantification, or tow-steered optimization.

tow-steered composites↗
DOE OSTI2022

Development of Numerical Model of Metal Foam with PCM for the Estimation of Effective Thermal Conductivity

Global warming due to climate change is a threat to humankind. Nuclear energy is one of the promising solutions to reduce fossil fuel usage. Nuclear energy can handle the base load, compensating for the volatility of renewable energy. If nuclear energy could achieve load following capability, the combination with renewable energy would be more suitable. Thermal energy storage (TES) is one of the options for enabling load following of nuclear reactors. The TES makes it possible to store surplus nuclear thermal energy and release it later as needed. In Idaho National Laboratory (INL), a new concept of latent heat TES integrated with high-temperature heat pipe has been proposed and is under development, which is called Heat pipe-Integrated Thermal Battery (HITB). HITB exchanges thermal energy between the reactor system and TES via heat pipe. The heat transferred to TES medium, made of phase change material (PCM), stores energy as sensible heat and/or latent heat. As PCM typically has poor thermal conductivity, however, various heat transfer enhancement techniques are required to achieve a rapid charging cycle. There are many techniques to enhance the heat transfer ability of TES medium such as disk, fin, and metal foam. Among them, metal foam is an appropriate option to enhance the heat transfer because it maximizes the heat transfer area through metal wicks. Metal foam is a lightweight metal structure that has a high porosity of over 0.9. The typical materials for metal foam are Aluminum, Copper, Nickel, and Silicon Carbide (SiC). Metal foam not only enhances heat transfer via conduction but also increases contact surface area. In the HITB design , the metal foam is being considered as one of the options to enhance the heat transfer of TES medium (PCM) [1]. To predict the enhanced thermal performance of TES, one should properly estimate the effective thermal conductivity of metal foam combined with PCM material or calculate heat transfer in distributed model. There are many experimental works that provides effective thermal conductivity of metal foam with various PCM [2,3]. Also, many theoretical models were developed based on the unit cell model of metal foam [4,5]. With a distributed model, on the other hand, detail heat transfer characteristics between metal foam and PCM material can be analyzed considering the geometry or buoyancy effect. However, due to the complex geometry of metal foam pores, the computational cost for three-dimensional modeling highly increases. Therefore, if metal foam structure can be modeled in simple and repetitive design, the computational cost would decrease Among the various metal foam models [2], lattice model is one of the simple and extendable design. The porosity and pores per inch (PPI) can be characterized by the size and spatial distance of lattice structure. If the three-dimensional metal foam model consists of lattice structure could properly estimate the heat transfer, which is characterized by effective thermal conductivity, it would be a good option to assess the thermal performance of metal foam with PCM. In this study, a three-dimensional numerical model was developed to simulate conductive heat transfer between metal foam and PCM. The three-dimensional lattice structure of square pillars was selected as a basic structure of the metal foam. The calculation result was characterized by the effective thermal conductivity of the whole domain. A sensitivity study was conducted for mesh size, domain size, and PPI to check whether the calculation result gives a converged result or not. Lastly, the effective thermal conductivity from the lattice model was compared with existing experimental data to validate the model result

25 ENERGY STORAGE↗
DOE OSTI2021

Nonoverlapping block smoothers for the Stokes equations

Overlapping block smoothers efficiently damp the error contributions from highly oscillatory components within multigrid methods for the Stokes equations but they are computationally expensive. This paper is concentrated on the development and analysis of new block smoothers for the Stokes equations that are discretized on staggered grids. These smoothers are nonoverlapping and therefore desirable due to reduced computational costs. Traditional geometric multigrid methods are based on simple pointwise smoothers. However, using multigrid methods to efficiently solve more difficult problems such as the Stokes equations leads to computationally more expensive smoothers, for example, overlapping block smoothers. Nonoverlapping smoothers are less expensive, but have been considered less efficient in the literature. In this paper, we develop new nonoverlapping smoothers, the so-called triad-wise smoothers, and show their efficiency within multigrid methods to solve the Stokes equations. In addition, we compare overlapping and nonoverlapping smoothers by measuring their computational costs and analyzing their behavior by the use of local Fourier analysis.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Modern Monte Carlo methods for efficient uncertainty quantification and propagation: A survey

Uncertainty quantification (UQ) includes the characterization, integration, and propagation of uncertainties that result from stochastic variations and a lack of knowledge or data in the natural world. Monte Carlo (MC) method is a sampling-based approach that has widely used for quantification and propagation of uncertainties. However, the standard MC method is often time-consuming if the simulation-based model is computationally intensive. This article gives an overview of modern MC methods to address the existing challenges of the standard MC in the context of UQ. Specifically, multilevel Monte Carlo (MLMC) extending the concept of control variates achieves a significant reduction of the computational cost by performing most evaluations with low accuracy and corresponding low cost, and relatively few evaluations at high accuracy and corresponding high cost. Multifidelity Monte Carlo (MFMC) accelerates the convergence of standard Monte Carlo by generalizing the control variates with different models having varying fidelities and varying computational costs. Multimodel Monte Carlo method (MMMC), having a different setting of MLMC and MFMC, aims to address the issue of UQ and propagation when data for characterizing probability distributions are limited. Multimodel inference combined with importance sampling is proposed for quantifying and efficiently propagating the uncertainties resulting from small data sets. All of these three modern MC methods achieve a significant improvement of computational efficiency for probabilistic UQ, particularly uncertainty propagation. Finally, an algorithm summary and the corresponding code implementation are provided for each of the modern MC methods. The extension and application of these methods are discussed in detail.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Real-time signal detection for Cyclotron Radiation Emission Spectroscopy measurements using antenna arrays

Cyclotron Radiation Emission Spectroscopy (CRES) is a technique for precision measurement of the energies of charged particles, which is being developed by the Project 8 Collaboration to measure the neutrino mass using tritium beta-decay spectroscopy. Project 8 seeks to use the CRES technique to measure the neutrino mass with a sensitivity of 40 meV, requiring a large supply of tritium atoms stored in a multi-cubic meter detector volume. Antenna arrays are one potential technology compatible with an experiment of this scale, but the capability of an antenna-based CRES experiment to measure the neutrino mass depends on the efficiency of the signal detection algorithms. Here, in this paper, we develop efficiency models for three signal detection algorithms and compare them using simulations from a prototype antenna-based CRES experiment as a case-study. The algorithms include a power threshold, a matched filter template bank, and a neural network based machine learning approach, which are analyzed in terms of their average detection efficiency and relative computational cost. It is found that significant improvements in detection efficiency and, therefore, neutrino mass sensitivity are achievable, with only a moderate increase in computation cost, by utilizing either the matched filter or machine learning approach in place of a power threshold, which is the baseline signal detection algorithm used in previous CRES experiments by Project 8.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2023

Spectral-partitioned Kohn-Sham density functional theory

Here we introduce a general, variational scheme for systematic approximation of a given Kohn-Sham free-energy functional by partitioning the density matrix into distinct spectral domains, each of which may be spanned by an independent diagonal representation without requirement of mutual orthogonality. It is shown that by generalizing the entropic contribution to the free energy to allow for independent representations in each spectral domain, the free energy becomes an upper bound to the exact (unpartitioned) Kohn-Sham free energy, attaining this limit as the representations approach Kohn-Sham eigenfunctions. A numerical procedure is devised for calculation of the generalized entropy associated with spectral partitioning of the density matrix. The result is a powerful framework for Kohn-Sham calculations of systems whose occupied subspaces span multiple energy regimes. As a case in point, we apply the proposed framework to warm- and hot-dense matter described by finite-temperature density functional theory, where at high energies the density matrix is represented by that of the free-electron gas, while at low energies it is variationally optimized. We derive expressions for the spectral-partitioned Kohn-Sham Hamiltonian, atomic forces, and macroscopic stresses within the projector-augmented wave (PAW) and the norm-conserving pseudopotential methods. It is demonstrated that at high temperatures, spectral partitioning facilitates accurate calculations at dramatically reduced computational cost. Moreover, as temperature is increased, fewer exact Kohn-Sham states are required for a given accuracy, leading to further reductions in computational cost. Finally, it is shown that standard multiprojector expansions of electronic orbitals within atomic spheres in the PAW method lack sufficient completeness at high temperatures. Spectral partitioning provides a systematic solution for this fundamental problem.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
NASA NTRS1989

Integrated aerodynamic-structural design of a transport wing

The integrated aerodynamic-structural design of a subsonic transport wing for minimum weight subject to required range is formulated and solved. The problem requires large computational resources, and two methods are used to alleviate the computational burden. First, a modular sensitivity method that permits the usage of black-box disciplinary software packages, is used to reduce the cost of sensitivity derivatives. In particular, it is shown that derivatives of the aeroelastic response and divergence speed can be calculated without the costly computation of derivatives of aerodynamic influence coefficient and structural stiffness matrices. A sequential approximate optimization is used to further reduce computational cost. The optimization procedure is shown to require a relatively small number of analysis and sensitivity calculations.

Grossman, B.↗
NASA NTRS1990

Catalytic ignition model in a monolithic reactor with in-depth reaction

Two transient models have been developed to study the catalytic ignition in a monolithic catalytic reactor. The special feature in these models is the inclusion of thermal and species structures in the porous catalytic layer. There are many time scales involved in the catalytic ignition problem, and these two models are developed with different time scales. In the full transient model, the equations are non-dimensionalized by the shortest time scale (mass diffusion across the catalytic layer). It is therefore accurate but is computationally costly. In the energy-integral model, only the slowest process (solid heat-up) is taken as nonsteady. It is approximate but computationally efficient. In the computations performed, the catalyst is platinum and the reactants are rich mixtures of hydrogen and oxygen. One-step global chemical reaction rates are used for both gas-phase homogeneous reaction and catalytic heterogeneous reaction. The computed results reveal the transient ignition processes in detail, including the structure variation with time in the reactive catalytic layer. An ignition map using reactor length and catalyst loading is constructed. The comparison of computed results between the two transient models verifies the applicability of the energy-integral model when the time is greater than the second largest time scale of the system. It also suggests that a proper combined use of the two models can catch all the transient phenomena while minimizing the computational cost.

Tien, Ta-Ching↗
NASA NTRS2011

Reynolds-Averaged Navier-Stokes Solutions to Flat Plate Film Cooling Scenarios

The predictions of several Reynolds-Averaged Navier-Stokes solutions for a baseline film cooling geometry are analyzed and compared with experimental data. The Fluent finite volume code was used to perform the computations with the realizable k-epsilon turbulence model. The film hole was angled at 35 to the crossflow with a Reynolds number of 17,400. Multiple length-to-diameter ratios (1.75 and 3.5) as well as momentum flux ratios (0.125 and 0.5) were simulated with various domains, boundary conditions, and grid refinements. The coolant to mainstream density ratio was maintained at 2.0 for all scenarios. Computational domain and boundary condition variations show the ability to reduce the computational cost as compared to previous studies. A number of grid refinement and coarsening variations are compared for further insights into the reduction of computational cost. Liberal refinement in the near hole region is valuable, especially for higher momentum jets that tend to lift-off and create a recirculating flow. A lack of proper refinement in the near hole region can severely diminish the accuracy of the solution, even in the far region. The effects of momentum ratio and hole length-to-diameter ratio are also discussed.

Johnson, Perry L.↗
DOE OSTI2023

Machine learning–assisted prediction of heat fluxes through thermally anisotropic building envelopes

Thermally anisotropic building envelope (TABE) is a novel active building envelope that can save energy use to maintain thermal comfort in buildings by redirecting heat and coolness from building envelopes to thermal loops. Finite element models (FEMs) can be used to compute the heat fluxes through TABEs, but the high computational cost of finite element simulations has prevented parametric studies and design optimizations. This paper proposes a domain knowledge–informed, finite element–based machine learning framework to reduce the computation cost for the energy management of buildings installed with TABE that uses a ground thermal loop. First, the training heat flux data set was generated by FEM simulations with different thermal loop schedules. Then, both shallow learning models (i.e., multivariate linear regression and eXtreme Gradient Boost, or XGBoost) and a deep learning model (i.e., deep neural network, or DNN) were trained to predict the heat fluxes. Domain knowledge was used for data preprocessing and feature selection. Finally, the suitability of the selected machine learning model was tested under different thermal loop schedules. Herein, the case study results showed that: (1) XGBoost can be as accurate as DNN (coefficient of determination equal to 0.81) with much less training time; (2) the annual energy cost savings for different thermal loop schedules obtained by the XGBoost-predicted and FEM-calculated heat fluxes are consistent, having a difference of only 4%; and (3) XGBoost can reduce the computation time for the annual energy analysis of the case study building with a given thermal loop schedule from around 12 h by using FEM to less than 1 min.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2023

Probabilistic-learning-based stochastic surrogate model from small incomplete datasets for nonlinear dynamical systems

We consider a high-dimensional nonlinear computational model of a dynamical system, parameterized by a vector-valued control parameter, in the presence of uncertainties represented by an uncontrolled parameter modeled by a vector-valued random variable, and possibly with stochastic excitation. The objective is to construct a statistical surrogate model where the input is any deterministic value of the control parameter, and the output is a vector-valued observation of the computational model, which is a random vector whose probability measure is updated using a target dataset. To construct this statistical surrogate model, the stochastic response of the computational model must be built, which is a vector-valued time-discretized stochastic process in high dimension, depending on the control parameter. It is assumed that the computational cost of a single evaluation of the deterministic model is high. For the probabilistic updating, we consider a subset of the components of the observation of the computational model, defined as the “identification observation” of the computational model, for which a small target dataset is available. Therefore, the target dataset is associated with partial observability, corresponding to an incomplete data case. Given a prior probability model of the random control and uncontrolled parameters, a training dataset is constructed, consisting of realizations of the random triplet composed of the stochastic response, the random identification observation, and the random control parameter. Since the computational cost of a single evaluation of the deterministic model is assumed to be large, the training dataset is also of small size. The main challenges in this problem are the high dimensionality, partial observability leading to incomplete data in the target dataset for the identification observation of the computational model (which is not sufficient to identify the computational stochastic responses), and the availability of a small training dataset. To address these challenges, we propose a methodology based on statistical methods for constructing necessary reduced representations, direct probabilistic learning under constraints using probabilistic learning on manifolds (PLoM) constrained by the target dataset, and the use of a weak formulation of the Fourier transform of probability measures. Statistical conditioning is also employed to explore the learned dataset. The constructed predictive statistical surrogate model can be implemented in the context of online computation. Here, we apply this approach to a problem of nonlinear stochastic dynamics in high dimensions within the framework of deformable solids mechanics.

Engineering↗
DOE OSTI2022

Effect of Packing Nonuniformity at the Fiber Bundle–Case Interface on Performance of Hollow Fiber Membrane Gas Separation Modules

High-fidelity simulations of momentum and mass transfer within a hollow fiber gas separation membrane module are here reported. The simulations capture the potential detrimental effects of poor fiber packing at the bundle–case interface on fluid distribution and performance. Results are presented for both circular and planar fiber bundles. The length over which bundle–case gaps affects flow is determined. The length increases dramatically with increasing fiber packing fraction. As the packing fraction approaches 0.6, the impact extends over the entire bundle diameter for small modules (<1000 fibers). The results clearly demonstrate the detrimental effect of poor packing along the case and can be used to develop module manufacturing guidelines. To reduce computational costs, an equivalent planar bundle module approximation is developed. The approximate simulations agree well with results from full 3-D simulations and can reduce computational costs without sacrificing fidelity.

42 ENGINEERING↗
DOE OSTI2020

Threadsafe Dynamic Neighbor Lists for Monte Carlo Ray Tracing

Monte Carlo (MC) transport codes offer high-fidelity modeling of particle transport physics, but their high computational cost makes them impractical for many applications. For some applications such as multiphysics and depletion that use finely discretized geometries, a large portion of this computational cost is attributable to ray tracing. Neighbor lists are a well-known method for accelerating ray-tracing calculations in a MC code, but despite their prevalence, little work has been published on the details of their implementation. The fine details can have a significant impact on performance, particularly when using shared-memory parallelism. This paper addresses these details of implementation with a discussion of different neighbor list schemes and their impact on software runtime. Performance tests were run by using OpenMC on a pin-cell problem discretized with up to 200 axial regions. The results demonstrate that switching from surface-based to cell-based neighbor lists leads to a 10 faster calculation rate for the most fine discretization. Finally, using a threadsafe shared-memory data structure results in a 20% faster calculation rate versus simple threadprivate neighbor lists. Results here show that a data structure that is contiguous in memory improves performance by only 1% to 2% over noncontiguous linked lists.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
NASA NTRSDate not supplied

Impact of Analytic Derivatives on Optimization of N-Impulse Orbit Transfer

Several formulations are possible for the optimization of N-impulse two-body orbit transfers. One formulation that assumes the firstN−1impulses are design variables and implements Lambert’s algorithm in the final leg is here considered. This paper presents a derivation for the analytic expressions of the gradients needed to optimize this formulation. The impact of using these analytic expressions on the optimization computational cost is also presented. A linear system of equations is developed that approximates the Lambert’s problem solution in a way that is suitable for computing the analytic gradients. The derivations of the analytic gradients, as well as numerical case studies for 2-impulse and 3-impulse orbit transfers, are presented. The numerical case studies highlights a significant reduction in the computational cost, measured in terms of the number of function calls.

Ahmed Ellithy↗
DOE OSTI2023

Physics-informed machine learning for fault-leakage reduced-order modeling

Geologic carbon storage (GCS) is a promising technology for mitigating CO 2 emissions. The overall success of GCS depends on safe operations that are informed by risk assessment and have proper mitigation plans in place. Performing quantitative probabilistic risk assessment for a GCS site using traditional reservoir simulators can be challenging due to the high computational costs. To overcome this challenge, the US Department of Energy’s National Risk Assessment Partnership (NRAP) project has developed an integrated assessment modeling approach that utilizes computationally efficient reduced-order models (ROM) for simulating various parts of a GCS storage site to quantify uncertainty. Here, in this study, we develop a reduced-order model for fault leakage risk assessment. We use a deep learning approach to build the reduced-order model. We perform a sensitivity analysis and find that the deep learning model yields high accuracy with a much smaller computational cost than full-physics simulation. We also evaluate the performance of the model in scenarios where simulations are not possible to run, providing analysis not previously performed in fault-leakage ROM analyses. Based on a sensitivity analysis of the model, we suggest a simplified conceptual model for fault leakage and site monitoring.

58 GEOSCIENCES↗
NASA NTRSDate not supplied

Derivatives Across Adaptive-Step Integration Accurately and Efficiently

The numerical integration of ordinary differential equations (ODEs) is common in trajectory optimization. Previous studies have shown that the use of adaptive-step Runge-Kutta integration schemes can introduce errors in the derivatives due to non-differentiable behavior within the integration scheme itself. The authors previously demonstrated the use of an implicit adaptation to the Runge-Kutta methods to mitigate this issue, but at a significant computational cost. In this work, the authors demonstrate an explicit adaptation to the Runge-Kutta methods to address the issue that does not incur a significant computational cost.

Kaushik Ponnapalli↗