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 415 records · Page 23
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

PREEMPT: Scalable Epidemic Interventions Using Submodular Optimization on Multi-GPU Systems

Preventing and slowing the spread of epidemics is achieved through techniques such as vaccination and social distancing. Given practical limitations on the number of vaccines and cost of administration, optimization becomes a necessity. Previous approaches using mathematical programming methods have shown to be effective but are limited by computational costs. In this work, we make several contributions: First, we present a new approach for intervention via maximizing the influence of vaccinated nodes on the network. We call this method \preempt. Next, we prove submodular properties associated with the objective function of our method so that it aids in construction of an efficient greedy approximation strategy. Consequently, we present a new parallel algorithm based on greedy hill climbing for \preempt, and present an efficient parallel implementation for distributed CPU-GPU heterogeneous platforms. Our results demonstrate that \preempt{} is able to achieve a significant reduction (up to 6.75$\times$) in the percentage of people infected on a city-scale network. We also show strong scaling results of \preempt{} on 128 nodes of the Summit supercomputer. Our parallel implementation is able to significantly reduce time to solution, from hours to minutes on large networks. This work represents a first-of-its-kind effort in parallelizing greedy hill climbing and applying it toward devising effective interventions for epidemics.

Minutoli, Marco↗
DOE OSTI2020

On differentiable local bounds preserving stabilization for Euler equations

This work presents the design of nonlinear stabilization techniques for the finite element discretization of Euler equations in both steady and transient form. Implicit time integration is used in the case of the transient form. A differentiable local bounds preserving method has been developed, which combines a Rusanov artificial diffusion operator and a differentiable shock detector. Nonlinear stabilization schemes are usually stiff and highly nonlinear. This issue is mitigated by the differentiability properties of the proposed method. Moreover, in order to further improve the nonlinear convergence, we also propose a continuation method for a subset of the stabilization parameters. The resulting method has been successfully applied to steady and transient problems with complex shock patterns. Numerical experiments show that it is able to provide sharp and well resolved shocks. Furthermore, the importance of the differentiability is assessed by comparing the new scheme with its non-differentiable counterpart. Numerical experiments suggest that, for up to moderate nonlinear tolerances, the method exhibits improved robustness and nonlinear convergence behavior for steady problems. Additionally, in the case of transient problem, we also observe a reduction in the computational cost.

42 ENGINEERING↗
DOE OSTI2023

An Infinite Domain 3D Poisson Solver Based on the Barnes-Hut Algorithm

We present a domain decomposition method for the solution of the 3D Poisson equation with infinite domain boundary conditions. The method is based on an application of the Barnes-Hut tree particle scheme adapted to gridded data. Long range interactions are computed using the first two terms in the Cartesian multipole expansion of Green’s function convoluted with the charge while short range computations are performed using Hockney’s domain doubling algorithm. A standard domain decomposition strategy requires O(N 2 ) applications of Hockney’s algorithm, where N is the number of subdomains that intersect that charge support, while in the present approach only O(Nlog 2 N) such computations suffice. The discretization scheme employed is a sixth order Mehrstellen approximation of the 3D Laplace opera tor. The method exhibits satisfactory accuracy at a substantially reduced computational cost compared to the full domain decomposition Hockney’s algorithm.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

aphBO-2GP-3B: a budgeted asynchronous parallel multi-acquisition functions for constrained Bayesian optimization on high-performing computing architecture

High-fidelity complex engineering simulations are often predictive, but also computationally expensive and often require substantial computational efforts. The mitigation of computational burden is usually enabled through parallelism in high-performance cluster (HPC) architecture. Optimization problems associated with these applications is a challenging problem due to the high computational cost of the high-fidelity simulations. In this paper, an asynchronous parallel constrained Bayesian optimization method is proposed to efficiently solve the computationally expensive simulation-based optimization problems on the HPC platform, with a budgeted computational resource, where the maximum number of simulations is a constant. The advantage of this method are three-fold. Firstly, the efficiency of the Bayesian optimization is improved, where multiple input locations are evaluated parallel in an asynchronous manner to accelerate the optimization convergence with respect to physical runtime. This efficiency feature is further improved so that when each of the inputs is finished, another input is queried without waiting for the whole batch to complete. Second, the proposed method can handle both known and unknown constraints. Third, the proposed method samples several acquisition functions based on their rewards using a modified GP-Hedge scheme. The proposed framework is termed aphBO-2GP-3B, which means asynchronous parallel hedge Bayesian optimization with two Gaussian processes and three batches. The numerical performance of the proposed framework aphBO-2GP-3B is comprehensively benchmarked using 16 numerical examples, compared against other 6 parallel Bayesian optimization variants and 1 parallel Monte Carlo as a baseline, and demonstrated using two real-world high-fidelity expensive industrial applications. The first engineering application is based on finite element analysis (FEA) and the second one is based on computational fluid dynamics (CFD) simulations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Multi-site reaction dynamics through multi-fragment density matrix embedding

The practical description of disordered chemical reactions, where the reactions involve multiple species at multiple sites, is presently a challenge using correlated electronic structure methods due to their high computational cost and steep scaling. Here, we describe the gradient theory of multi-fragment density matrix embedding theory, which potentially provides a minimal computational framework to model such processes at the correlated electron level. We present the derivation and implementation of the gradient theory, its validation on model systems and chemical reactions using density matrix embedding, and its application to a molecular dynamics simulation of proton transport in a small water cluster, a simple example of multi-site reaction dynamics.

Chemistry↗
DOE OSTI2025

A kinetic line-driven radiation operator and its application to Gyrokinetics

A velocity dependent, kinetic model for line radiation is developed for continuum kinetic codes. It has been implemented in the full-f gyrokinetic code Gkeyll. The total radiation for a charge state is modeled as an advection in velocity space with a form of $\nabla_v \cdot(v\nu(v)f(v))$, guaranteeing particle conservation. The velocity dependence (in the form of an effective frequency $\nu(v)$) is found through fitting the energy loss of the operator, i.e. the second velocity moment, to the radiation data in the OpenADAS database. Therefore, each individual transition does not need to be evaluated every time step, significantly reducing the computational cost of including line radiation in a kinetic model. The dependence on velocity instead of the usual, temperature, allows the radiation to be computed from non-Maxwellian electron distribution functions: We benchmark the model against a collisional radiative model using isotropic non-Maxwellian distribution functions. A velocity dependent model of radiation can more accurately describe the radiation in the more kinetic regimes expected in reactor-scale devices. The velocity dependence qualitatively captures the quantum mechanical need for a minimum velocity before any radiation occurs.

kinetic↗
NASA NTRS1996

Near-Wall Models in Large Eddy Simulations of Flow Behind a Backward-Facing Step

Accurate large eddy simulation (LES) of a wall-bounded flow generally requires a near-wall resolution comparable to that in direct numerical simulation (DNS). As much as 50% of the total grid points and computational costs are expended in the near-wall regions in a typical simulation. This limits LES to fairly low Reynolds numbers on current computers. To perform practical flow applications at realistically high Reynolds numbers, such as flow over an airfoil, it is desirable to replace very thin, near-wall regions in the LES with easily and inexpensively computed wall models to specify the near-wall boundary conditions.

Cabot, W.↗
DOE OSTI2022

Data and scripts associated with the manuscript "Using Mutual Information for Global Sensitivity Analysis on Watershed Modeling"

This package contains the data and scripts used in "Using Mutual Information for Global Sensitivity Analysis on Watershed Modeling" (Jiang et al., 2022). The ARW_SWAT.zip file contains the SWAT simulation and the sensitivity analysis result in the American River Watershed. The Portage_SWAT.zip file contains the SWAT simulation and the sensitivity analysis result in the Portage River Watershed. The src folder contains the source code of sensitivity analysis and plotting functions. The notebooks folder contains the Jupyter notebooks for performing sensitivity analysis and other post analyses.Global Sensitivity Analysis (GSA) often is applied to assess the sensitivity of model outputs to their inputs using ensemble simulations. However, increasing model complexity and the associated computational cost have limited the use of most GSA approaches for process-based watershed models. We propose to use Mutual Information (MI) as a computationally efficient GSA method for watershed modeling. Such MI computed from several hundred realizations usually can capture nonlinear relationships between inputs and outputs of interest. We perform MI-based watershed sensitivity analyses in studies of the Portage River Watershed in Ohio and the American River Watershed in Washington. In these studies, MI is used to evaluate the sensitivity of river discharges simulated by the Soil and Water Assessment Tool to no less than 20 parameters for each watershed. Our MI-based sensitivity analyses achieved convergence with about 300~500 realizations, a small fraction of the ensemble size (i.e., several thousand) required by the Sobol method. Nevertheless, MI yields similar sensitivity ranking compared to the Sobol method, especially for sensitive parameters. Our study thus sheds new light on the use of MI as an affordable GSA method for computationally intensive models such as the hyper-resolution, watershed hydrobiogeochemical models.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2021

The curled wake model: a three-dimensional and extremely fast steady-state wake solver for wind plant flows

Abstract. Wind turbine wake models typically require approximations, such as wake superposition and deflection models, to accurately describe wake physics. However, capturing the phenomena of interest, such as the curled wake and interaction of multiple wakes, in wind power plant flows comes with an increased computational cost. To address this, we propose a new hybrid method that uses analytical solutions with an approximate form of the Reynolds-averaged Navier–Stokes equations to solve the time-averaged flow over a wind plant. We compare results from the solver to supervisory control and data acquisition data from the Lillgrund wind plant obtaining wake model predictions which are generally within 1 standard deviation of the mean power data. We perform simulations of flow over the Columbia River Gorge to demonstrate the capabilities of the model in complex terrain. We also apply the solver to a case with wake steering, which agreed well with large-eddy simulations. This new solver reduces the time – and therefore the related cost – it takes to simulate a steady-state wind plant flow (on the order of seconds using one core). Because the model is computationally efficient, it can also be used for different applications including wake steering for wind power plants and layout optimization.

17 WIND ENERGY↗
NASA NTRS2008

Spiking Neurons for Analysis of Patterns

Artificial neural networks comprising spiking neurons of a novel type have been conceived as improved pattern-analysis and pattern-recognition computational systems. These neurons are represented by a mathematical model denoted the state-variable model (SVM), which among other things, exploits a computational parallelism inherent in spiking-neuron geometry. Networks of SVM neurons offer advantages of speed and computational efficiency, relative to traditional artificial neural networks. The SVM also overcomes some of the limitations of prior spiking-neuron models. There are numerous potential pattern-recognition, tracking, and data-reduction (data preprocessing) applications for these SVM neural networks on Earth and in exploration of remote planets. Spiking neurons imitate biological neurons more closely than do the neurons of traditional artificial neural networks. A spiking neuron includes a central cell body (soma) surrounded by a tree-like interconnection network (dendrites). Spiking neurons are so named because they generate trains of output pulses (spikes) in response to inputs received from sensors or from other neurons. They gain their speed advantage over traditional neural networks by using the timing of individual spikes for computation, whereas traditional artificial neurons use averages of activity levels over time. Moreover, spiking neurons use the delays inherent in dendritic processing in order to efficiently encode the information content of incoming signals. Because traditional artificial neurons fail to capture this encoding, they have less processing capability, and so it is necessary to use more gates when implementing traditional artificial neurons in electronic circuitry. Such higher-order functions as dynamic tasking are effected by use of pools (collections) of spiking neurons interconnected by spike-transmitting fibers. The SVM includes adaptive thresholds and submodels of transport of ions (in imitation of such transport in biological neurons). These features enable the neurons to adapt their responses to high-rate inputs from sensors, and to adapt their firing thresholds to mitigate noise or effects of potential sensor failure. The mathematical derivation of the SVM starts from a prior model, known in the art as the point soma model, which captures all of the salient properties of neuronal response while keeping the computational cost low. The point-soma latency time is modified to be an exponentially decaying function of the strength of the applied potential. Choosing computational efficiency over biological fidelity, the dendrites surrounding a neuron are represented by simplified compartmental submodels and there are no dendritic spines. Updates to the dendritic potential, calcium-ion concentrations and conductances, and potassium-ion conductances are done by use of equations similar to those of the point soma. Diffusion processes in dendrites are modeled by averaging among nearest-neighbor compartments. Inputs to each of the dendritic compartments come from sensors. Alternatively or in addition, when an affected neuron is part of a pool, inputs can come from other spiking neurons. At present, SVM neural networks are implemented by computational simulation, using algorithms that encode the SVM and its submodels. However, it should be possible to implement these neural networks in hardware: The differential equations for the dendritic and cellular processes in the SVM model of spiking neurons map to equivalent circuits that can be implemented directly in analog very-large-scale integrated (VLSI) circuits.

Huntsberger, Terrance↗
NASA NTRSDate not supplied

Economical Third-Order Methods for Accurate Surface Heating Predictions on Simplex Element Meshes

A node-centered edge-based finite volume discretization of the compressible Navier-Stokes equations is presented with the heat flux reformulated as a first order system. A dissipation vector is derived for the reformulated system, such that the heat flux can be upgraded to O(h^3) on simplex element meshes in the same fashion as the inviscid fluxes. The method of manufactured solutions is used to demonstrate this uniform order property in heat flux. This new system is shown to efficiently produce accurate surface heating predictions on hypersonic hemisphere flow using an anisotropic simplex element mesh, achieving O(h^3) accuracy at relatively low computational cost compared to similar methods.

Computational Fluid Dynamics↗
DOE OSTI2020

The Adjoint Petrov–Galerkin method for non-linear model reduction

Here, we formulate a new projection-based reduced-order modeling technique for non-linear dynamical systems. The proposed technique, which we refer to as the Adjoint Petrov–Galerkin (APG) method, is derived by decomposing the generalized coordinates of a dynamical system into a resolved coarse-scale set and an unresolved fine-scale set. A Markovian finite memory assumption within the Mori–Zwanzig formalism is then used to develop a reduced-order representation of the coarse scales. This procedure leads to a closed reduced-order model that displays commonalities with the adjoint stabilization method used in finite elements. The formulation is shown to be equivalent to a Petrov–Galerkin method with a non-linear, time-varying test basis, thus sharing some similarities with the Least-Squares Petrov–Galerkin method. Theoretical analysis examining a priori error bounds and computational cost is presented. Numerical experiments on the compressible Navier–Stokes equations demonstrate that the proposed method can lead to improvements in numerical accuracy, robustness, and computational efficiency over the Galerkin method on problems of practical interest. Improvements in numerical accuracy and computational efficiency over the Least-Squares Petrov–Galerkin method are observed in most cases.

42 ENGINEERING↗
DOE OSTI2020

Dual-cone variational calculation of the two-electron reduced density matrix

The computation of strongly correlated quantum systems is challenging because of its potentially exponential scaling in the number of electron configurations. Variational calculation of the two-electron reduced density matrix (2-RDM) without the many-electron wave function exploits the pairwise nature of the electronic Coulomb interaction to compute a lower bound on the ground-state energy with polynomial computational scaling. Recently, a dual-cone formulation of the variational 2-RDM calculation was shown to generate the ground-state energy, albeit not the 2-RDM, at a substantially reduced computational cost, especially for higher $\textit{N}$-representability conditions such as the T2 constraint. Here we generalize the dual-cone variational 2-RDM method to compute not only the ground-state energy but also the 2-RDM. The central result is that we can compute the 2-RDM from a generalization of the Hellmann-Feynman theorem. Specifically, we prove that in the Lagrangian formulation of the dual-cone optimization the 2-RDM is the Lagrange multiplier. Further, we apply the method to computing the energies and properties of strongly correlated electrons—including atomic charges, electron densities, dipole moments, and orbital occupations—in an illustrative hydrogen chain and the nitrogen-fixation catalyst FeMoco. The dual variational computation of the 2-RDM with T2 or higher N -representability conditions provides a polynomially scaling approach to strongly correlated molecules and materials with significant applications in atomic and molecular and condensed-matter chemistry and physics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Improving Trustworthiness of Data-Driven Power Grid Contingency Analysis With Bayesian Residual Graph Neural Networks

The evolving energy landscape requires novel tools to efficiently perform contingency analysis and reliability assessment of power grids, potentially in real-time. The high computational cost of traditional power flow solvers limits their applicability in practice. Machine learning (ML) surrogates such as deep neural networks (NNs) accelerate power flow solvers computations, enabling high-order contingency analysis and real-time decision-making by learning highly nonlinear functions and integrating grid topology via graph architectures. However, (graph) NNs lack predictive power away from training data and do not provide predictive confidence estimates. Here, we present a Bayesian residual graph NN that integrates knowledge from low-fidelity data via residual training and embeds granular quantification of uncertainties, improving trustworthiness critical for high-consequence decision-making. Applying Bayesian concepts to NNs is challenging due to the high-dimensionality of both the parameter space, complicating derivation of a meaningful prior, and the output space in large grid systems, requiring enhanced techniques to assess the predicted high-dimensional uncertainties. Our contributions include: (1) Deriving a prior for fully connected and graph NNs that leverages low-fidelity data to guide mean predictions and appropriately control prior predictive uncertainty. (2) Integrating this prior within an ensembling with anchoring scheme for efficient approximate posterior inference. (3) Deriving enhanced metrics to assess accuracy of both the mean and uncertainty predictions in high dimensions, appropriately accounting for correlations propagated through graph layers. The resulting Bayesian residual graph NN is tested on a contingency analysis task for 14-bus and 118-bus grids.

24 - POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2021

A priori examination of reduced chemistry models derived from canonical stirred reactors using three-dimensional direct numerical simulation datasets

Data-driven approaches to construct reduced chemical kinetic models, that rely heavily on thermo-chemical datasets with full chemical kinetics, have been gaining popularity. Datasets from direct numerical simulations (DNS) under three-dimensional (3-D) realistic turbulent flow conditions are desirable but limited to carefully designed parametric conditions due to the computational cost. Constructing datasets from a large ensemble of zero-dimensional stirred reactors like perfectly stirred reactor (PSR) and partially stirred reactor (PaSR) is a computationally efficient solution to consider the turbulence-chemistry interactions and cover a broad range of parametric conditions. In this paper, we derive reduced chemistry models from solutions of a large number of PSR and PaSR reactors using autoencoder (AE) neural networks and principal component analysis (PCA), and conduct a priori examination of the reduced models in three temporally evolving 3-D DNS jet flames featuring local extinction and re-ignition. The results show that the reduced models derived from PaSR datasets, i.e., AE-PaSR and PCA-PaSR, generally show significant improvement over the ones derived from PSR datasets. Among all the reduced models, AE-PaSR shows the best agreement with DNS results on the reconstruction accuracy and the representation of temporally evolving local extinction and re-ignition events.

Zhang, Pei↗
NASA NTRS1989

Robust eigenstructure assignment by a projection method - Applications using multiple optimization criteria

A methodology for robust eigenstructure assignment for multivariable feedback systems is presented. The algorithm is based upon a pole placement technique using projections onto subspaces of admissible eigenvectors. New ideas are introduced to generate target (desired) sets of unitary eigenvectors and determine optimal feasible eigenvectors in a least-square sense. Useful connections are established between the pole-placement by independent modal space control and the method introduced in this paper. A multicriterion optimization algorithm is also presented, which takes efficient advantage of the present eigenstructure assignment method. These developments show significant improvement over an earlier version of this algorithm in both computational cost and accuracy. This optimization process appears to be numerically robust and suitable for high-dimensional multicriterion optimizations; it is especially attractive for computer-aided design of control systems.

Rew, D. W.↗
NASA NTRS1994

Large-eddy simulation of a boundary layer with concave streamwise curvature

Turbulence modeling continues to be one of the most difficult problems in fluid mechanics. Existing prediction methods are well developed for certain classes of simple equilibrium flows, but are still not entirely satisfactory for a large category of complex non-equilibrium flows found in engineering practice. Direct and large-eddy simulation (LES) approaches have long been believed to have great potential for the accurate prediction of difficult turbulent flows, but the associated computational cost has been prohibitive for practical problems. This remains true for direct simulation but is no longer clear for large-eddy simulation. Advances in computer hardware, numerical methods, and subgrid-scale modeling have made it possible to conduct LES for flows or practical interest at Reynolds numbers in the range of laboratory experiments. The objective of this work is to apply ES and the dynamic subgrid-scale model to the flow of a boundary layer over a concave surface.

Lund, Thomas S.↗