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 289 records · Page 16

Machine learning surrogate of physics-based building-stock simulator for end-use load forecasting

Building energy models are used to simulate heat and mass transfer and estimate end-use load in buildings. With the proliferation of solar photovoltaics on residential and commercial buildings, increasingly, buildings are expected to provide grid services, for which accurate and computationally efficient building energy simulations and end-use load prediction are imperative. Existing building energy simulation tools, however, have significant computational overhead that make them less practical in real-time deployment for optimization, design, uncertainty quantification and control in building energy management systems. Here this article presents a data-driven machine learning model based on light gradient boosting method (LightGBM) as a surrogate for a physics-based simulator for residential buildings to predict end-use load. The machine learning based surrogate model accounts for time-series related variables, seasonality and trend component of end-use load, and history of end-use load. The accuracy of the surrogate model is assessed on the prediction of the load profiles of 100 different houses in Cook County, Illinois, USA. The LightGBM surrogate model is shown to reduce the root-mean-squared error by 53% relative to a reference decision tree (DT) based model reported previously in the literature. Moreover, the model predicts the load spikes and high-ramp rate events throughout the year which are often the Achilles heel of other models in the literature. The machine learning based surrogate model is demonstrated to be computationally efficient, with a ten-fold reduction in the computational time compared to a physics-based building energy simulation, and suitable for uncertainty analysis and real-time control of building characteristics in response to uncertainty.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Accelerated computation of lattice thermal conductivity using neural network interatomic potentials

We report with the development of the density functional theory (DFT) and ever-increasing computational capacity, an accurate prediction of lattice thermal conductivity based on the Boltzmann transport theory becomes computationally feasible, contributing to a fundamental understanding of thermal conductivity as well as a choice of the optimal materials for specific applications. However, steep costs in evaluating third-order force constants limit the theoretical investigation to crystals with high symmetry and few atoms in the unit cell. Currently, machine learning potentials are garnering attention as a computationally efficient high-fidelity model of DFT, and several studies have demonstrated that the lattice thermal conductivity could be computed accurately via the machine learning potentials. However, test materials were mostly crystals with high symmetries, and the applicability of machine learning potentials to a wide range of materials has yet to be demonstrated. Furthermore, establishing a standard training set that provides consistent accuracy and computational efficiencies across a wide range of materials would be useful. To address these issues, herein we compute lattice thermal conductivities at 300 K using neural network interatomic potentials. As test materials, we select 25 materials with diverse symmetries and a wide range of lattice thermal conductivities between 10 -1 and 10 3 Wm -1 K -1 . Among various choices of training sets, we find that molecular dynamics trajectories at 50–700 K consistently provide results at par with DFT for the test materials. In contrast to pure DFT approaches, the computational cost in the present approach is uniform over the test materials, yielding a speed gain of 2–10 folds. When a smaller reduced training set is used, the relative efficiency increases by up to ~50 folds without sacrificing accuracy significantly. The current work will broaden the application scope of machine learning potentials by establishing a robust framework for accurately computing lattice thermal conductivity with machine learning potentials.

36 MATERIALS SCIENCE↗

An efficient Bayesian inversion of a geothermal prospect using a multivariate adaptive regression spline method

In this study, an efficient Bayesian framework equipped with a multivariate adaptive regression spline (MARS) technique is developed to alleviate computational burdens encountered in a conventional Bayesian inversion of a geothermal prospect. Fast MARS models are developed from training dataset generated by CPU-intensive hydrothermal models and used as surrogate of high-fidelity physical models in Markov Chain Monte Carlo (MCMC) sampling. This Bayesian inference with MARS-enabled MCMC method is used to reduce prior estimates of uncertainty in structural or characteristic hydrothermal flow parameters of the model to posterior distributions. A geothermal prospect near Superstition Mountain in Imperial County of California in USA is used to illustrate the proposed framework and demonstrate the computational efficiency of MARS-based Bayesian inversion. The developed MARS models are also used to efficiently drive calculation of Sobol’ total sensitivity indices. Furthermore, only top sensitive parameters are included in Bayesian inference to further improve the computational efficiency of inversion. Sensitivity analysis also confirms that water circulation through high permeable structures, rather than heat conduction through impermeable granite, is the primary heat transfer method. The presented framework is demonstrated an efficient tool to update knowledge of geothermal prospects by inversing field data. Although only thermal data is used in this study, other type of data, such as flow and transport observations, can be jointly used in this method for underground hydrocarbon reservoirs.

15 GEOTHERMAL ENERGY↗

A Sparse Tableau Formulation for Node-Breaker Representations in Security-Constrained Optimal Power Flow

Realistic representations of contingencies in AC optimal power flow (ACOPF) often challenge traditional bus-branch network models. Derived from nodal analysis, such approaches represent network constraints in terms of the familiar bus admittance matrix, Ybus. A fixed Ybus is unable to represent common circuit breaker actions such as bus splitting. Work-arounds for Ybus-based analysis typically rely on topology processing, switching between different Ybus matrices depending on breaker settings. In this paper, we propose a very general node-breaker approach, employing multi-port element models and using a sparse tableau formulation (STF) for network constraints. Instead of treating breaker action as altering network topology, and hence changing the structure of Kirchhoff’s voltage law (KVL) and Kirchhoff’s current law (KCL) equations, this approach represents a breaker’s position as impacting only constraints associated with a single component, thereby maintaining fixed structure in the KVL and KCL constraints. While larger numbers of variables are required, STF proves sparser than Ybus formulations. Numerical case studies herein demonstrate that STF provides computational efficiency comparable to a Ybus-based ACOPF at the scale of several hundred buses, and lower computational cost in an example of over one thousand buses.

Park, Byungkwon (ORCID:000000033189816X)↗

Impact of solutes on the lattice parameters and elastic stiffness coefficients of hcp Fe from first-principles calculations

The hexagonal close-packed (hcp) -martensite phase in steels nucleates from the -austenite parent phase and can undergo further transformation to the -martensite phase or exist as a metastable phase depending on temperature, mechanical loading, and alloy chemistry. The solute-dependent lattice parameters and elastic stiffness coefficients of hcp Fe influence the mechanical properties of steels containing the -martensite phase, as well as the martensitic transformations between the phases. We use density functional theory to calculate the lattice parameters and of single-crystal hcp Fe as functions of solute concentration in the dilute limit for the substitutional solutes Al, B, Cu, Mn, and Si, and the octahedral interstitial solutes C and N. Our computationally efficient methodology separates the solute dependence of the into lattice strain and chemical bonding contributions. The computed data can be used to estimate the effect of solutes on polycrystalline elastic moduli and the strain energy associated with martensitic transformations. The data can also serve as inputs to microstructure-based models of multiphase steels containing the -martensite phase.

Fellinger, Michael R.↗

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↗

Coarse-grained models using local-density potentials optimized with the relative entropy: Application to implicit solvation

Bottom-up multiscale techniques are frequently used to develop coarse-grained (CG) models for simulations at extended length and time scales but are often limited by a compromise between computational efficiency and accuracy. The conventional approach to CG nonbonded interactions uses pair potentials which, while computationally efficient, can neglect the inherently multibody contributions of the local environment of a site to its energy, due to degrees of freedom that were coarse-grained out. This effect often causes the CG potential to depend strongly on the overall system density, composition, or other properties, which limits its transferability to states other than the one at which it was parameterized. Here, we propose to incorporate multibody effects into CG potentials through additional nonbonded terms, beyond pair interactions, that depend in a mean-field manner on local densities of different atomic species. This approach is analogous to embedded atom and bond-order models that seek to capture multibody electronic effects in metallic systems. We show that the relative entropy coarse-graining framework offers a systematic route to parameterizing such local density potentials. We then characterize this approach in the development of implicit solvation strategies for interactions between model hydrophobes in an aqueous environment.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A Semi-Analytical Solution Approach for Solving Constant-Coefficient First-Order Partial Differential Equations

Simulation and control of many dynamic systems involve solving partial differential equations (PDE). This letter proposes a semi-analytical solution (SAS) approach for fast and high-quality solution of first-order PDEs. The region of interest of the studied PDE is divided into a grid, and an SAS is derived for each grid cell in the form of the multivariate polynomials, of which the coefficients are identified using initial value and boundary value conditions. The solutions are solved in a “time-stepping” manner, i.e. within one time step, the coefficients of the SAS are identified and the initial value of the next time step is evaluated. This approach achieves a significantly larger grid cell than the widely used finite difference method, and thus enhances the computational efficiency significantly. Furthermore, the simulation result on the natural gas pipeline model demonstrates the advantages of SAS in accuracy and computational efficiency.

97 MATHEMATICS AND COMPUTING↗

Depletion GPT-free sensitivity analysis for reactor eigenvalue problems

This manuscript introduces a novel approach to solving depletion perturbation theory problems without the need to set up or solve the generalized perturbation theory (GPT) equations. The approach, hereinafter denoted generalized perturbation theory free (GPT-Free), constructs a reduced order model (ROM) using methods based in perturbation theory and computes response sensitivity profiles in a manner that is independent of the number or type of responses, allowing for an efficient computation of sensitivities when many responses are required. Moreover, the reduction error from using the ROM is quantified in the GPT-Free approach by means of a Wilks' order statistics error metric denoted the K-metric. Traditional GPT has been recognized as the most computationally efficient approach for performing sensitivity analyses of models with many input parameters, e.g. when forward sensitivity analyses are computationally intractable. However, most neutronics codes that can solve the fundamental (homogenous) adjoint eigenvalue problem do not have GPT capabilities unless envisioned during code development. The GPT-Free approach addresses this limitation by requiring only the ability to compute the fundamental adjoint. This manuscript demonstrates the GPT-Free approach for depletion reactor calculations performed in SCALE6 using the 7x7 UAM assembly model. A ROM is developed for the assembly over a time horizon of 990 days. The approach both calculates the reduction error over the lifetime of the simulation using the K-metric and benchmarks the obtained sensitivities using sample calculations. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Accelerating Scientific Simulations with Bi-Fidelity Weighted Transfer Learning

High-fidelity modeling is an essential design tool for many engineering applications. However, for complex systems, computational cost can be a limiting factor. Analyzing parameter sensitivity, uncertainty quantification, and design optimization require many model evaluations. Surrogate models are often used to develop the relationship between model parameters and quantities of interest. However, in the case of complex systems, surrogate models require several degrees of freedom and, thus, a large number of data points to determine the correct dependencies. For many applications, this may be prohibitively expensive. The reduction of computational requirements can be achieved by leveraging low-fidelity models. Low-fidelity models represent the system at a coarser resolution with the advantage of computational efficiency. Therefore, a bi-fidelity modeling paradigm, which augments the accuracy of a low-fidelity model in a computationally efficient manner by invoking limited runs of a high-fidelity model, can be leveraged to sufficiently balance the accuracy and computational requirements. In this work, a bi-fidelity weighted transfer learning method using neural networks was applied to a computational fluid dynamics heat transfer modeling problem. The transfer learning advantage was investigated as a function of hyperparameters. Our main finding is that the use of a bi-fidelity modeling paradigm achieves accuracy close to that of a high-fidelity Gaussian process model while significantly reducing computational cost. The bi-fidelity model achieves comparable performance with 90 high-fidelity samples-that is, 60% less than the samples needed to achieve similar accuracy without the use of bi-fidelity modeling,

Borowiec, Katarzyna↗

Generalized Perturbation Theory-Free Sensitivity Analysis for Eigenvalue Problems

Generalized perturbation theory (GPT) has been recognized as the most computationally efficient approach for performing sensitivity analysis for models with many input parameters, which renders forward sensitivity analysis computationally overwhelming. In critical systems, GPT involves the solution of the adjoint form of the eigenvalue problem with a response-dependent fixed source. Although conceptually simple to implement, most neutronics codes that can solve the adjoint eigenvalue problem do not have a GPT capability unless envisioned during code development. We introduce in this manuscript a reduced-order modeling approach based on subspace methods that requires the solution of the fundamental adjoint equations but allows the generation of response sensitivities without the need to set up GPT equations, and that provides an estimate of the error resulting from the reduction. Moreover, the new approach solves the eigenvalue problem independently of the number or type of responses. This allows for an efficient computation of sensitivities when many responses are required. This paper introduces the theory and implementation details of the GPT-free approach and describes how the errors could be estimated as part of the analysis. The applicability is demonstrated by estimating the variations in the flux distribution everywhere in the phase space of a fast critical sphere and a high-temperature gas-cooled reactor prismatic lattice. The variations generated by the GPT-free approach are benchmarked to the exact variations generated by direct forward perturbations.

99 GENERAL AND MISCELLANEOUS↗

Analytical derivatives of the individual state energies in ensemble density functional theory. II. Implementation on graphical processing units (GPUs)

Conical intersections control excited state reactivity, and thus, elucidating and predicting their geometric and energetic characteristics are crucial for understanding photochemistry. Locating these intersections requires accurate and efficient electronic structure methods. Unfortunately, the most accurate methods (e.g., multireference perturbation theories such as XMS-CASPT2) are computationally challenging for large molecules. The state-interaction state-averaged restricted ensemble referenced Kohn–Sham (SI-SA-REKS) method is a computationally efficient alternative. The application of SI-SA-REKS to photochemistry was previously hampered by a lack of analytical nuclear gradients and nonadiabatic coupling matrix elements. We have recently derived analytical energy derivatives for the SI-SA-REKS method and implemented the method effectively on graphical processing units. We demonstrate that our implementation gives the correct conical intersection topography and energetics for several examples. Furthermore, our implementation of SI-SA-REKS is computationally efficient, with observed sub-quadratic scaling as a function of molecular size. This demonstrates the promise of SI-SA-REKS for excited state dynamics of large molecular systems.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Performance of Cloud 3D Solvers in Ice Cloud Shortwave Radiation Closure Over the Equatorial Western Pacific Ocean

Abstract For retrieving cloud optical properties from satellite images or computing these properties from climate model output, computationally efficient treatments of cloud horizontal inhomogeneity include the Monte Carlo Independent Column Approximation (McICA) and the Tripleclouds method. Computationally efficient treatment of cloud horizontal radiation exchanges includes the SPeedy Algorithm for Radiative TrAnsfer through CloUd Sides (SPARTACUS). As a test to derive properties from satellite images, we collocate Moderate Resolution Imaging Spectroradiometer (MODIS) cloud retrievals with near‐nadir Cloud and the Earth's Radiant Energy System (CERES) footprints in July 2008 over an equatorial western Pacific Ocean region to compare the performance of the McICA, Tripleclouds, and SPARTACUS solvers to the conventional plane‐parallel homogeneous (PPH) treatment. PPH overestimates cloud albedo, and the three solvers effectively reduce overestimation with root mean square error of shortwave upwelling irradiance decreasing between 15.72 and 18.53 W m −2 , or about 22%–25%. Although cloud top variability does not get fed into the simulations, all three solvers also reduce the effect of cloud top variability on cloud albedo. Entrapment (energy reflected downward from clouds) and horizontal radiation transfer have opposite effects on the SPARTACUS cloud albedo simulation. The net effect depends on the cloud vertical extent, the unawareness of which limits the performance of the SPARTACUS solver.

54 ENVIRONMENTAL SCIENCES↗

Non -degenerate marginal-likelihood calibration with application to quantum characterization

Here, we propose a marginal likelihood strategy within the Kennedy-O’Hagan (KOH) Bayesian framework, where a Gaussian process (GP) models the discrepancy between a physical system and its simulator. Our approach introduces a novel marginalized likelihood by integrating out the degenerate eigenspace of the covariance matrix, rather than approximating the original likelihood. Unlike approximation methods that compromise accuracy for computational efficiency, our method defines an exact likelihood—distinct from the original but preserving all relevant information. This formulation achieves computational efficiency and stability, even for large datasets where the covariance matrix nears degeneracy. Applied to the characterization of a superconducting quantum device at Lawrence Livermore National Laboratory, the approach enhances the predictive accuracy of the Lindblad master equations for modeling Ramsey measurement data by effectively quantifying uncertainties consistent with the quantum data.

general physics↗

The multifacet graphically contracted function method. I. Formulation and implementation

The basic formulation for the multifacet generalization of the graphically contracted function (MFGCF) electronic structure method is presented. The analysis includes the discussion of linear dependency and redundancy of the arc factor parameters, the computation of reduced density matrices, Hamiltonian matrix construction, spin-density matrix construction, the computation of optimization gradients for single-state and state-averaged calculations, graphical wave function analysis, and the efficient computation of configuration state function and Slater determinant expansion coefficients. Timings are given for Hamiltonian matrix element and analytic optimization gradient computations for a range of model problems for full-CI Shavitt graphs, and it is observed that both the energy and the gradient computation scale as O(N{sup 2}n{sup 4}) for N electrons and n orbitals. The important arithmetic operations are within dense matrix-matrix product computational kernels, resulting in a computationally efficient procedure. An initial implementation of the method is used to present applications to several challenging chemical systems, including N{sub 2} dissociation, cubic H{sub 8} dissociation, the symmetric dissociation of H{sub 2}O, and the insertion of Be into H{sub 2}. The results are compared to the exact full-CI values and also to those of the previous single-facet GCF expansion form.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Software-Hardware Co-design of Heterogeneous SmartNIC System for Recommendation Models Inference and Training

Deep Learning Recommendation Models (DLRMs) are critical applications in various domains and have evolved as one of the single largest machine learning applications. Trillions of DLRM parameters exceed the on-chip memory capacity of GPUs. Large-scale multi-node systems are required for distributed DLRM inference and training, which suffer from the all-to-all communication bottleneck, mainly limiting the scalability of ever-growing DLRMs. In recent years, SmartNICs have evolved with coupled computation and communication capabilities providing opportunities for a powerful heterogeneous device in the system. However, there isn't such a distributed system that fully leverages the abundant smartNIC resources that resolve the scalability issue of DLRMs. In this work, we proposed a software-hardware co-design of a heterogeneous smartNIC system that resolves the communication bottleneck of distributed DLRMs, mitigates the memory bandwidth pressure, and improves computation efficiency. We provide a set of smartNIC designs of cache systems (including local cache and remote cache) and smartNIC computation kernels which reduce data movement, relieve memory lookup intensity, and improve the GPU's computation efficiency. In addition, we propose a graph algorithm that improves the data locality of queries within batches which optimizes the overall system performance with higher data reuse. Our evaluation shows that our system achieves 2.1x latency speedup for inference and 1.6x throughput speedup for training.

Guo, Anqi↗

Coupled Induction Machine and HVAC Models for Simulating HVAC Performance Considering Grid Dynamics in Buildings

This paper presents the development of novel models that integrate induction machines with HVAC equipment, such as pumps, heat pumps, and chillers, to analyze the impact of electrical parameters on the operational performance of thermo-fluid systems. The proposed model employs a coupling technique that captures the dynamic interactions between induction machines and HVAC systems. By integrating electrical, thermal, and mechanical dynamics, the models provide a comprehensive framework for simulating real-world scenarios, including interactions with the electrical grid. This achievement was made possible through the development of a Computationally Efficient and Accurate Induction Machine (CEAIM) model. Implemented using the equation-based Modelica language, the CEAIM model has been validated against experimental results, manufacturer data sheets, and various operating conditions. Its performance has been compared with existing induction machine models in the Modelica Standard Library (MSL), demonstrating superior accuracy and computational efficiency. The CEAIM model predicts torque, speed, and power consumption with a coefficient of determination (R 2 ) ranging from 0.98 to 1 and a coefficient of variation of root mean square error (CVRMSE) between 0.27% and 6.67%. Additionally, CEAIM scales more efficiently than conventional MSL models, with a slower computational growth rate in large-scale simulations. After thorough validation of the CEAIM model, it was coupled with HVAC equipment as this approach provides a detailed multi-dimensional view of capturing electrical transients and mechanical performance. To support this, a case study was conducted to showcase its capabilities.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Exploring the Role of Intrinsic Nodal Activation on the Spread of Influence in Complex Networks

In many complex networked systems such as online social networks, at any given time, activity originates at certain nodes and subsequently spreads on the network through influence. To model the spread of influence in such a scenario, we consider the problem of identification of influential entities in a complex network when nodal activation can happen through two different mechanisms. The first mode of activation is due mechanisms intrinsic to the node. The second mechanism is through the influence of connected neighbors. In this work, we present a simple probabilistic formulation that models such self-evolving systems where information diffusion occurs primarily because of the intrinsic activity of users and the spread of activity occurs due to influence. We provide an algorithm to mine for the influential seeds in such a scenario by modifying the well-known influence maximization framework with the independent cascade diffusion model. We provide small motivating examples to provide an intuitive understanding of the effect of including the intrinsic activation mechanism. We sketch a proof of the submodularity of the influence function under the new formulation and demonstrate the same with larger graphs. We then show by means of additional experiments on a real-world twitter dataset how the formulation can be applied to real-world social media datasets. Finally we derive a computationally efficient centrality metric that takes into account, both the mechanisms of activation and provides for an accurate as well as computationally efficient alternative approach to the problem of identifying influencers under intrinsic activation.

Visweswara Sathanur, Arun↗