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 541 records · Page 30

Mesoscopic Traffic Flow Model for Agent-Based Simulation

Traffic simulation is a key element of agent based models as the various agents decisions impact and are impacted by the realized travel times and delays in the traffic network. Here we present the mesoscopic traffic flow model implemented in POLARIS transportation systems simulator. The model is mesoscopic in an attempt to obtain enough for applications that requires microscopic data while still inheriting the computational efficiency of macroscopic traffic flow models. The model is macroscopic at the link-level with dynamics based on the Newells Model and microscopic at the node level. We present link-level and network-level results for one mid-sized traffic network. The results show that the model can combine accuracy, level of details and computational efficiency.

Link transmission model↗

Scalable Risk Assessment of Rare Events in Power Systems With Uncertain Wind Generation and Loads

Risk assessment of rare events has become increasingly important in power system planning and operation with the increasing integration of renewable energy and the presence of system uncertainties. However, quantifying the risk posed by rare events via the traditional method, i.e., Monte Carlo sampling (MCS), incurs substantial computational expense stemming from the vast ensemble of power flow simulations. To accelerate the assessment, this paper proposes a Deep Neural Network (DNN)-kernelized vector-valued Gaussian Process (VVGP) approach with excellent computational efficiency while maintaining high accuracy. Consequently, serving as a surrogate model for the power flow solver, the DNN-kernelized VVGP enables significantly faster but accurate risk assessment compared to the power flow solver. The developed surrogate model evaluates low-order N - k events that contain more than 90% instances by adeptly capturing the topological features while the high-order N - k events are assessed via a power flow solver, thereby striking a balance between computational efficiency and uncertainty quantification accuracy. Moreover, the model incorporates a Support Vector Machine (SVM) classifier to resample concerning low-probability tail events to counteract the biases potentially introduced during the DNN-kernelized VVGP evaluations. Simulations conducted on the modified IEEE 24-bus, 118-bus, and European 1354-bus systems demonstrate that the proposed method maintains the accuracy benchmark set by MCS while significantly reducing computational demands in large-scale power systems as compared to other state-of-the-art methods.

17 WIND ENERGY↗

Assessing Mg–Sc–(rare earth) ternary phase stability via constituent binary cluster expansions

The disordered Mg–Sc body-centered cubic (bcc) phase is both lightweight and strong; however, the system is impractical for general industrial use due to the high cost of scandium. Here we propose a computationally efficient metric that assesses ternary rare earth element additions that may stabilize the bcc phase at lower Sc concentrations. We find that the bcc phase is stabilized by the ternary addition of Y or Er, but not by La, Ce, or Nd, and we validate these predictions by experimental production and characterization of Mg–Sc–(Y,Er,Nd) alloys. The results suggest a computationally efficient method to anticipate integration of ternary elements into binary systems using cluster expansions of constituent binaries.

36 MATERIALS SCIENCE↗

CFD Study of Countercurrent Flow in Triply Periodic Minimal Surfaces with CO 2 BOL Solvent

Triply periodic minimal surfaces (TPMS) are promising structures for heat exchangers and ultrafiltration due to their high heat and mass transfer efficiency compared to traditional devices. Because of this, the TPMS structures are a potential candidate for building the multifunctional, intensified devices in CO 2 capture tasks. With the Lawrence Livermore National Laboratory’s (LLNL’s) additive manufacturing (AM) capability, these complicated TPMS structures can be printed in the packed column for experimental tests. To optimize the TPMS structure and enable fast prototyping, a computationally-efficient computational fluid dynamics (CFD) framework was established to explore the TPMS structure’s hydrodynamics and mass transfer performance. The established model was able to simulate the countercurrent flows by integrating the Pacific Northwest National Laboratory (PNNL) CO 2 binding organic liquids (CO 2 BOL) solvent into the TPMS structures. Three typical TPMS structures - namely, Gyroid, Schwarz-D, and Schwarz-P - were investigated using the periodic boundary set up in all three directions. Two different unit cell size (1 cm and 2 cm) geometries are tested for each type of TPMS. The solvent flow rate in this study covered a range of [0, 0.1] m/s with an initial liquid film thickness of [0.1, 1.8] mm. These simulations provided a preliminary understanding of the TPMS structure behaviors in countercurrent flow conditions. The study also related the TPMS geometry requirement to the given CO 2 BOL solvent physical property and covered reasonable packed column operation ranges.

36 MATERIALS SCIENCE↗

Spatiotemporal Downscaling Model for Solar Irradiance Forecast Using Nearest-Neighbor Random Forest and Gaussian Process

Accurate solar photovoltaic (PV) capacity estimation requires high-resolution, site-specific solar irradiance data to account for localized variability. However, global datasets, such as the National Solar Radiation Database (NSRDB), provide regional averages that fail to capture the fine-scale fluctuations critical for large-scale grid integration. This limitation is particularly relevant in the context of increasing distributed energy resources (DERs) penetration, such as rooftop PV. Additionally, it is critical to the implementation of the U.S. Federal Energy Regulatory Commission (FERC) Order 2222, which facilitates DER participation in U.S. bulk power markets. To address this challenge, this study evaluates Nearest-Neighbor Random Forest (NNRF) and Nearest-Neighbor Gaussian Process (NNGP) models for spatiotemporal downscaling of global solar irradiance data. By leveraging historical irradiance and meteorological data, these models incorporate spatial, temporal, and feature-based correlations to enhance local irradiance predictions. The NNRF model, a machine-learning approach, prioritizes computational efficiency and predictive accuracy, while the NNGP model offers a level of interpretability and prediction uncertainty by numerically quantifying correlations and dependencies in the data. Model validation was conducted using day-ahead predictions. The results showed that the average Goodness of Fit (GoF) of the NNRF model of 90.61% across all eight sites outperformed the GoF of the NNGP of 85.88%. Additionally, the computational speed of NNRF was 2.5 times faster than the NNGP. Finally, the NNGP displayed polynomial scaling while the NNRF scaled linearly with increasing number of nearest neighbors. Additional validation of the model on five sites in Puerto Rico further confirmed the superiority of the NNRF model over the NNGP model. These findings highlight the robustness and computational efficiency of NNRF for large-scale solar irradiance downscaling, making it a strong candidate for improving PV capacity estimation and real-time electricity market integration for DERs.

Asiedu, Shadrack (ORCID:0009000646004826)↗

A Framework for Deep Learning Emulation of Numerical Models With a Case Study in Satellite Remote Sensing

Numerical models based on physics represent the state of the art in Earth system modeling and comprise our best tools for generating insights and predictions. Despite rapid growth in computational power, the perceived need for higher model resolutions overwhelms the latest generation computers, reducing the ability of modelers to generate simulations for understanding parameter sensitivities and characterizing variability and uncertainty. Thus, surrogate models are often developed to capture the essential attributes of the full-blown numerical models. Recent successes of machine learning methods, especially deep learning (DL), across many disciplines offer the possibility that complex nonlinear connectionist representations may be able to capture the underlying complex structures and nonlinear processes in Earth systems. A difficult test for DL-based emulation, which refers to function approximation of numerical models, is to understand whether they can be comparable to traditional forms of surrogate models in terms of computational efficiency while simultaneously reproducing model results in a credible manner. A DL emulation that passes this test may be expected to perform even better than simple models with respect to capturing complex processes and spatiotemporal dependencies. Here, we examine, with a case study in satellite-based remote sensing, the hypothesis that DL approaches can credibly represent the simulations from a surrogate model with comparable computational efficiency. Our results are encouraging in that the DL emulation reproduces the results with acceptable accuracy and often even faster performance. We discuss the broader implications of our results in light of the pace of improvements in high-performance implementations of DL and the growing desire for higher resolution simulations in the Earth sciences.

Bayesian Deep Learning↗

On-the-fly active learning of interpretable Bayesian force fields for atomistic rare events

Abstract Machine learned force fields typically require manual construction of training sets consisting of thousands of first principles calculations, which can result in low training efficiency and unpredictable errors when applied to structures not represented in the training set of the model. This severely limits the practical application of these models in systems with dynamics governed by important rare events, such as chemical reactions and diffusion. We present an adaptive Bayesian inference method for automating the training of interpretable, low-dimensional, and multi-element interatomic force fields using structures drawn on the fly from molecular dynamics simulations. Within an active learning framework, the internal uncertainty of a Gaussian process regression model is used to decide whether to accept the model prediction or to perform a first principles calculation to augment the training set of the model. The method is applied to a range of single- and multi-element systems and shown to achieve a favorable balance of accuracy and computational efficiency, while requiring a minimal amount of ab initio training data. We provide a fully open-source implementation of our method, as well as a procedure to map trained models to computationally efficient tabulated force fields.

36 MATERIALS SCIENCE↗

Assessing decision boundaries under uncertainty

In order to make design decisions, engineers may seek to identify regions of the design domain that are acceptable in a computationally efficient manner. A design is typically considered acceptable if its reliability with respect to parametric uncertainty exceeds the designer’s desired level of confidence. Despite major advancements in reliability estimation and in design classification via decision boundary estimation, the current literature still lacks a design classification strategy that incorporates parametric uncertainty and desired design confidence. To address this gap, this paper offers a novel interpretation of the acceptance region by defining the decision boundary as the hypersurface which isolates the designs that exceed a user-defined level of confidence given parametric uncertainty. This work addresses the construction of this novel decision boundary using computationally efficient algorithms that were developed for reliability analysis and decision boundary estimation. The approach proposed in this paper is verified on two physical examples from structural and thermal analysis using Support Vector Machines and Efficient Global Optimization-based contour estimation.

97 MATHEMATICS AND COMPUTING↗

Development of hybrid 3-D hydrological modeling for the NCAR Community Earth System Model (CESM)

This is the Final Report of our four-year (3-year plus one-year no cost extension) collaborative project between the University of Arizona (UA) and the National Center for Atmospheric Research (NCAR). The overall objective of our project is to develop and evaluate the first hybrid 3-D hydrological model with a horizontal grid spacing of 1 km for the NCAR Community Earth System Model (CESM). We have made substantial progress in model development and evaluation, computational efficiencies and software engineering, and data development and evaluation, as discussed in Sections 2-4. Section 5 presents our success in data dissemination, while Section 6 discusses the scientific impacts of our work. Section 7 discusses education and mentoring success of our project, while Section 8 lists our relevant DOE services. All peer-reviewed papers that acknowledged this project are listed in Section 9. Highlights of our achievements include: • We have finished 20 papers (most published already) on model development and evaluation, computational efficiencies and software engineering, and data development and evaluation • The global datasets developed under this project have been permanently archived and publicly available • Some of our research results have already been implemented in WRF and CLM • Patrick Broxton and Michael Brunke have received their Ph.D. • PI Zeng has served on DOE proposal review panels and DOE lab scientific focus area (SFA) review panels

58 GEOSCIENCES↗

Coarse-graining Hamiltonian systems using WSINDy

Abstract Weak form equation learning and surrogate modeling has proven to be computationally efficient and robust to measurement noise in a wide range of applications including ODE, PDE, and SDE discovery, as well as in coarse-graining applications, such as homogenization and mean-field descriptions of interacting particle systems. In this work we extend this coarse-graining capability to the setting of Hamiltonian dynamics which possess approximate symmetries associated with timescale separation. A smooth $$\varepsilon$$ ε -dependent Hamiltonian vector field $$X_\varepsilon$$ X ε possesses an approximate symmetry if the limiting vector field $$X_0=\lim _{\varepsilon \rightarrow 0}X_\varepsilon$$ X 0 = lim ε → 0 X ε possesses an exact symmetry. Such approximate symmetries often lead to the existence of a Hamiltonian system of reduced dimension that may be used to efficiently capture the dynamics of the symmetry-invariant dependent variables. Deriving such reduced systems, or approximating them numerically, is an ongoing challenge. We demonstrate that WSINDy can successfully identify this reduced Hamiltonian system in the presence of large perturbations imparted in the $$\varepsilon >0$$ ε > 0 regime, while remaining robust to extrinsic noise. This is significant in part due to the nontrivial means by which such systems are derived analytically. WSINDy naturally preserves the Hamiltonian structure by restricting to a trial basis of Hamiltonian vector fields. The methodology is computationally efficient, often requiring only a single trajectory to learn the global reduced Hamiltonian, and avoiding forward solves in the learning process. In this way, we argue that weak-form equation learning is particularly well-suited for Hamiltonian coarse-graining. Using nearly-periodic Hamiltonian systems as a prototypical class of systems with approximate symmetries, we show that WSINDy robustly identifies the correct leading-order system, with dimension reduced by at least two, upon observation of the relevant degrees of freedom. While our main contribution is computational, we also provide a contribution to the literature on averaging theory by proving that first-order averaging at the level of vector fields preserves Hamiltonian structure in nearly-periodic Hamiltonian systems. This provides theoretical justification for our approach as WSINDy’s computations occur at the level of Hamiltonian vector fields. We illustrate the efficacy of our proposed method using physically relevant examples, including coupled oscillator dynamics, the Hénon–Heiles system for stellar motion within a galaxy, and the dynamics of charged particles.

97 MATHEMATICS AND COMPUTING↗

Fast Transient Simulations for Multi-Segment Transmission Lines with a Graphical Model

This paper studies a computationally efficient algebraic graph theory engine for simulating time-domain one-dimensional waves in a multi-segment transmission line, such as for reflectometry applications. Efficient simulation of time-domain signals in multi-segment transmission lines is challenging because the number of propagation paths (and therefore the number of operations) increases exponentially with each new interface. We address this challenge through the use of a frequency-domain, algebraic graphical model of wave propagation, which is then converted to the time domain via the Fourier transform. We use this model to achieve an exact, stable, and computationally efficient (O(NQ), where N is the number of segments and Q is the bandwidth) approach for studying one-dimensional wave propagation. Our approach requires the reflection and transmission coefficients for each interface and each segment's complex propagation constant. Furthermore, we compare our simulation results with known analytical solutions.

42 ENGINEERING↗

Convection equation modeling: A non-iterative direct matrix solution algorithm for use with SINDA

The determination of the boundary conditions for a component-level analysis, applying discrete finite element and finite difference modeling techniques often requires an analysis of complex coupled phenomenon that cannot be described algebraically. For example, an analysis of the temperature field of a coldplate surface with an integral fluid loop requires a solution to the parabolic heat equation and also requires the boundary conditions that describe the local fluid temperature. However, the local fluid temperature is described by a convection equation that can only be solved with the knowledge of the locally-coupled coldplate temperatures. Generally speaking, it is not computationally efficient, and sometimes, not even possible to perform a direct, coupled phenomenon analysis of the component-level and boundary condition models within a single analysis code. An alternative is to perform a disjoint analysis, but transmit the necessary information between models during the simulation to provide an indirect coupling. For this approach to be effective, the component-level model retains full detail while the boundary condition model is simplified to provide a fast, first-order prediction of the phenomenon in question. Specifically for the present study, the coldplate structure is analyzed with a discrete, numerical model (SINDA) while the fluid loop convection equation is analyzed with a discrete, analytical model (direct matrix solution). This indirect coupling allows a satisfactory prediction of the boundary condition, while not subjugating the overall computational efficiency of the component-level analysis. In the present study a discussion of the complete analysis of the derivation and direct matrix solution algorithm of the convection equation is presented. Discretization is analyzed and discussed to extend of solution accuracy, stability and computation speed. Case studies considering a pulsed and harmonic inlet disturbance to the fluid loop are analyzed to assist in the discussion of numerical dissipation and accuracy. In addition, the issues of code melding or integration with standard class solvers such as SINDA are discussed to advise the user of the potential problems to be encountered.

Schrage, Dean S.↗

Coordinated Optimization and Control of Residential Solid State Power Substations in Electrical Distribution Network

This paper proposes a computationally efficient mixed integer linear programming (MILP) model for the coordinated optimization of solid-state power substations (SSPSs) in a feeder considering the full unbalanced three-phase structure of the distribution grid and its characteristics. The proposed model determines the optimal real and reactive power of each SSPS at the point of common coupling (PCC) that minimizes the operating cost and maximizes the system performance, e.g., voltage regulation and phase balancing. To improve the computational efficiency, an inscribed octagon is introduced to approximate the quadratic capacity constraints of components. Numerical simulation results show the effectiveness of the proposed model and significant improvements in voltage profiles and power imbalance between phases.

Liu, Guodong↗

Approximate Analysis for Interlaminar Stresses in Composite Structures with Thickness Discontinuities

An efficient, approximate analysis for calculating complete three-dimensional stress fields near regions of geometric discontinuities in laminated composite structures is presented. An approximate three-dimensional local analysis is used to determine the detailed local response due to far-field stresses obtained from a global two-dimensional analysis. The stress results from the global analysis are used as traction boundary conditions for the local analysis. A generalized plane deformation assumption is made in the local analysis to reduce the solution domain to two dimensions. This assumption allows out-of-plane deformation to occur. The local analysis is based on the principle of minimum complementary energy and uses statically admissible stress functions that have an assumed through-the-thickness distribution. Examples are presented to illustrate the accuracy and computational efficiency of the local analysis. Comparisons of the results of the present local analysis with the corresponding results obtained from a finite element analysis and from an elasticity solution are presented. These results indicate that the present local analysis predicts the stress field accurately. Computer execution-times are also presented. The demonstrated accuracy and computational efficiency of the analysis make it well suited for parametric and design studies.

Rose, Cheryl A.↗

Study of Data-Driven Mesh-Model Optimization in System Thermal-Hydraulic Simulation

Quantification of nuclear power plant safety risk requires a systematic and yet practical approach to identification of accident scenarios, assessment of their likelihood and consequences. Instrumental to this goal is risk-informed safety margin characterization (RISMC) framework, whose realization requires computationally robust and affordable methods for sufficiently accurate simulation of complex multi-dimensional physical phenomena, such as turbulent and multi-phase flow. The CFD-like correlation-based codes with 3D simulation capability (e.g., GOTHIC) ensure computational efficiency using coarse mesh size and the sub-grid phenomena in the boundary layer that can be captured by adequate constitutive correlations. However, the error sources and user effects on the selection of mesh size and models lead to unpredictable simulation error, while rich High-Fidelity (HF) data from experiments and numerical simulation using validated code or DNS are not fully explored. It would be useful to have a “smart” data-driven multi-scale framework in which the low-resolution models can be “taught” to emulate high-resolution models. The objective of this work is to develop and evaluate a physical-based data-driven mesh-model optimization approach (Optimized Mesh/Model Information System, OMIS) to estimate the simulation error and give advice on the optimized selection of coarse mesh size and Low-Fidelity (LF) models for System Thermal Hydraulic (STH) simulation to achieve accuracy comparable to that of HF models. This approach takes advantages of computational efficiency of coarse-mesh simulation and application of Machine Learning (ML) algorithms.

97 MATHEMATICS AND COMPUTING↗

Approximate Mixed-Integer Programming Solution with Machine Learning Technique and Linear Programming Relaxation

Security constrained unit commitment (SCUC) is solved in the day-ahead electricity market to determine electricity generation schedule for the following date. The associated mixed integer programming (MIP) problem is known computationally hard. Heuristics like rounding can be computationally efficient for solving large MIP problems however often produces lower quality solutions due to discrepancy between MIP solution and linear programming relaxation (LPR) solution, i.e., variables taking different discrete values between MIP and LPR solutions. In this work, we applied the machine learning-based algorithms—Classification and Regression Tree (CART) model and random forest (RF) model—to obtain an LPR-based approximation that close to an MIP solution without actually solving the MIP problem. By computing feature importance derived from the CART and RF models, we assessed the link between coefficients in the MIP model, the LPR solution, and the optimal solution of the MIP problem. We applied the CART and RF approaches to solve SCUC problems using day-ahead energy market cases from Midcontinent Independent System Operator. The results show that our method is computationally efficient and could achieve an approximation sufficiently close to the SCUC solution with <0.15% error and ~78% reduction in the discrepancies between LPR and MIP solutions.

Lin, Xinming↗

Higher-order adaptive finite-element methods for orbital-free density functional theory

In the present work, we study various numerical aspects of higher-order finite-element discretizations of the non-linear saddle-point formulation of orbital-free density-functional theory. We first investigate the robustness of viable solution schemes by analyzing the solvability conditions of the discrete problem. We find that a staggered solution procedure where the potential fields are computed consistently for every trial electron-density is a robust solution procedure for higher-order finite-element discretizations. We next study the convergence properties of higher-order finite-element discretizations of orbital-free density functional theory by considering benchmark problems that include calculations involving both pseudopotential as well as Coulomb singular potential fields. Our numerical studies suggest close to optimal rates of convergence on all benchmark problems for various orders of finite-element approximations considered in the present study. We finally investigate the computational efficiency afforded by various higher-order finite-element discretizations, which constitutes the main aspect of the present work, by measuring the CPU time for the solution of discrete equations on benchmark problems that include large Aluminum clusters. In these studies, we use mesh coarse-graining rates that are derived from error estimates and an a priori knowledge of the asymptotic solution of the far-field electronic fields. Our studies reveal a significant 100-1000 fold computational savings afforded by the use of higher-order finite-element discretization, alongside providing the desired chemical accuracy. We consider this study as a step towards developing a robust and computationally efficient discretization of electronic structure calculations using the finite-element basis.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

A 3D finite element multigrid solver for the Euler equations

A low storage, computationally efficient algorithm for the solution of the compressible Euler equations on unstructured tetrahedral meshes is developed. The algorithm takes the form of a centered scheme with the explicit addition of a high accuracy artificial viscosity and the solution is advanced to steady state by means of a multistage timestepping method. The side-based data structure which is employed enables a clear connection to be established between the proposed algorithm and upwind cell vertex schemes for unstructured meshes. The computational efficiency of the procedure is improved by incorporating an unstructured multigrid acceleration procedure. A number of flows of practical interest are analyzed to demonstrate the numerical performance of the proposed approach.

Peraire, J.↗