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 793 records · Page 44

Efficient sampling of constrained high-dimensional theoretical spaces with machine learning

Abstract Models of physics beyond the Standard Model often contain a large number of parameters. These form a high-dimensional space that is computationally intractable to fully explore. Experimental results project onto a subspace of parameters that are consistent with those observations, but mapping these constraints to the underlying parameters is also typically intractable. Instead, physicists often resort to scanning small subsets of the full parameter space and testing for experimental consistency. We propose an alternative approach that uses generative models to significantly improve the computational efficiency of sampling high-dimensional parameter spaces. To demonstrate this, we sample the constrained and phenomenological Minimal Supersymmetric Standard Models subject to the requirement that the sampled points are consistent with the measured Higgs boson mass. Our method achieves orders of magnitude improvements in sampling efficiency compared to a brute force search.

Hollingsworth, Jacob↗

Power System Frequency Dynamics Modeling, State Estimation, and Control using Neural Ordinary Differential Equations (NODEs) and Soft Actor-Critic (SAC) Machine Learning Approaches

With the global energy transition of the electric power system, grid control, supervision, and protection is becoming more challenging. With the increasing integration of renewable energy sources (RES), the system dynamics are changing, causing traditional power system dynamic modeling with swing equation-based modeling approaches to fail. Additionally, the converter-dominated power grid is decreasing the system inertia, making the power system more fragile to the frequency swings. This paper first investigates and compares the application of a model-based Kalman filter state estimation approach with (i) a model-free machine learning approach --- neural ordinary differential equations (NODEs) --- and (ii) a data-driven system identification (SysId) approach to model and infer critical state values of the power system frequency dynamics. Then a model predictive control (MPC) framework is compared to a model-free Soft Actor-Critic (SAC) reinforcement learning (RL) control algorithm in providing efficient fast frequency response (FFR) to the power system frequency dynamics. The approaches are compared in terms of their performance goals as well as their per-timestep computational efficiency. Furthermore, the comparative study for state estimation shows that for the model-free requirement, both NODEs and SysId can provide accurate state estimates; however, with increasing model complexity, NODEs can be a better choice for model identification. Similarly, the results from the FFR comparative study show that the SAC RL-based FFR, once trained, outperforms MPC with better control signals and faster computation time, making the SAC RL-based FFR better option for providing FFR to the power system.

97 MATHEMATICS AND COMPUTING↗

Complexity Reduction Methods for Large-Scale Spatially Explicit Biofuels Network Design

The size and complexity of energy system optimization models have increased significantly in recent years, driven by the availability of high-resolution spatial data. We present complexity reduction and solution methods that enable us to efficiently represent high-resolution spatial data in the network design of large-scale energy systems. We aim to reduce the size and enhance the computational efficiency of network design models without sacrificing solution accuracy. Specifically, we first present how to aggregate highly granular data into larger resolutions without averaging out their specific properties through a composite-curve-based approach and then develop a method to linearly represent these curves. Second, we utilize a general clustering method to determine groups of geographically proximate biomass fields and establish a single transportation arc for all of them, reducing the number of transportation-related variables while maintaining an accurate representation of the system. Finally, we introduce a two-step algorithm that decomposes large-scale network design problems into two smaller, more manageable subproblems. We demonstrate the application of our methods using a case study of switchgrass-to-biofuels network design in the eight states of the U.S. Midwest, using realistic and highly explicit spatial data.

09 BIOMASS FUELS↗

Parallel projection—An improved return mapping algorithm for finite element modeling of shape memory alloys

Here, we present a novel finite element analysis of inelastic structures containing Shape Memory Alloys (SMAs). Phenomenological constitutive models for SMAs lead to material nonlinearities, that require substantial computational effort to resolve. Finite element analysis methods, which rely on Gauss quadrature integration schemes, must solve two sets of coupled differential equations: one at the global level and the other at the local, i.e. Gauss point level. In contrast to the conventional return mapping algorithm, which solves these two sets of coupled differential equations separately using a nested Newton procedure, we propose a scheme to solve the local and global differential equations simultaneously. In the process we also derive closed-form expressions used to update the internal/constitutive state variables, and unify the popular closest-point and cutting plane methods with our formulas. Numerical testing indicates that our method allows for larger thermomechanical loading steps and provides increased computational efficiency, over the standard return mapping algorithm.

42 ENGINEERING↗

Differentiable lagrangian shock hydrodynamics with application to stable shock acceleration of density interfaces

We develop a gradient based optimization approach for the equations of compressible, Lagrangian hydrodynamics and demonstrate how it can be employed to automatically uncover strategies to control hydrodynamic instabilities arising from shock acceleration of density interfaces. Strategies for controlling the Richtmyer-Meshkov instability (RMI) are of great benefit for inertial confinement fusion (ICF) where shock interactions with many small imperfections in the density interface lead to instabilities which rapidly grow over time. These instabilities lead to mixing which, in the case of laser driven ICF, quenches the runaway fusion process ruining the potential for positive energy return. Here, we demonstrate that control of these instabilities can be achieved by optimization of initial conditions with ( > 100) parameters. Optimizing over a large parameter space like this is not possible with gradient-free optimization strategies. This requires computation of the gradient of the outputs of a numerical solution to the equations of Lagrangian hydrodynamics with respect to the inputs. We show that the efficient computation of these gradients is made possible via a judicious application of (i) adjoint methods, the exact formal representation of sensitivities involving partial differential equations, and (ii) automatic differentiation (AD), the algorithmic calculation of derivatives of functions. Careful regularization of multiple operators including artificial viscosity and timestep control is required. We perform design optimization of > 100 parameter energy field driving the Richtmyer Meshkov instability showing significant suppression while simultaneously enhancing the acceleration of the interface relative to a nominal baseline case.

Hydrophysics↗

Noise propagation in hybrid models of nonlinear systems: The Ginzburg–Landau equation

Every physical phenomenon can be described by multiple models with varying degrees of fidelity. The computational cost of higher fidelity models (e.g., molecular dynamics simulations) is invariably higher than that of their lower fidelity counterparts (e.g., a continuum model based on differential equations). While the former might not be suitable for large-scale simulations, the latter are not universally valid. Hybrid algorithms provide a compromise between the computational efficiency of a coarse-scale model and the representational accuracy of a fine-scale description. This is achieved by conducting a fine-scale computation in subdomains where it is absolutely required (e.g., due to a local breakdown of a continuum model) and coupling it with a coarse-scale computation in the rest of a computational domain. We analyze the effects of random fluctuations generated by the fine-scale component of a nonlinear hybrid on the hybrid's overall accuracy and stability. Two variants of the time-dependent Ginzburg–Landau equation (GLE) and their discrete representations provided by a nearest-neighbor Ising model serve as a computational testbed. Our analysis shows that coupling these descriptions in a one-dimensional simulation leads to erroneous results. Adding a random source term to the GLE provides accurate prediction of the mean behavior of the quantity of interest (magnetization). It also allows the two GLE variants to correctly capture the strength of the microscale fluctuations. Our work demonstrates the importance of fine-scale noise in hybrid simulations, and suggests the need for replacing an otherwise deterministic coarse-scale component of the hybrid with its stochastic counterpart.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Personal reflections on the highlights and changes in radiation and radioisotope measurement applications

Here, this paper describes the recent changes that the authors have perceived in the use of radiation and radioisotope measurement applications. The first change is that due to the increased use of Monte Carlo simulation which has occurred from a normal evolutionary process. This is due in large part to the increased accuracy that is being obtained by the use of detector response functions (DRFs) and the simultaneous increased computational efficiency that has become available with these DRFs, the availability of a greatly improved weight windows variance reduction method, and the availability of in-expensive computer clusters. This first change is a happy one. The other change that is occurring is in response to recent terrorist activities. That change is the replacement or major change in the use of long-lived radioisotopes in radioisotope measurement and other radioisotope source applications. In general this can be done by improving the security of these radioisotope sources or by replacing them altogether by using machine sources of radiation. In either case one would like to preclude altogether or at least minimize the possibility of terrorists being able to obtain radioisotopes and use them for clandestine purposes.

07 ISOTOPE AND RADIATION SOURCES↗

MoorPy (Quasi-Static Mooring Analysis in Python)

MoorPy is a quasi-static mooring model and a suite of associated functions for mooring system analysis. The core model supports quasi-static analysis of moored floating systems including any arrangement of mooring lines and floating platforms. It solves the distributed position and tension of each mooring line segment using standard catenary equations. Floating platforms can be represented with linear hydrostatic characteristics. MoorPy automatically computes a floating system's equilibrium state and can be queried to identify a mooring system's nonlinear force-displacement relationships. Linearized stiffness matrices are efficiently computed using semi-analytic Jacobians. MoorPy also includes plotting functions and a library of mooring component property and cost coefficients. MoorPy can be used directly from Python scripts to perform mooring design and analysis tasks, or it can be coupled with other tools to compute quasi-static mooring reactions as part of a larger simulation.

Hall, Mathew↗

Improving climate model coupling through a complete mesh representation: a case study with E3SM (v1) and MOAB (v5.x)

One of the fundamental factors contributing to the spatiotemporal inaccuracy in climate modeling is the mapping of solution field data between different discretizations and numerical grids used in the coupled component models. The typical climate computational workflow involves evaluation and serialization of the remapping weights during the preprocessing step, which is then consumed by the coupled driver infrastructure during simulation to compute field projections. Tools like Earth System Modeling Framework (ESMF) and TempestRemap offer capability to generate conservative remapping weights, while the Model Coupling Toolkit (MCT) that is utilized in many production climate models exposes functionality to make use of the operators to solve the coupled problem. However, such multistep processes present several hurdles in terms of the scientific workflow and impede research productivity. In order to overcome these limitations, we present a fully integrated infrastructure based on the Mesh Oriented datABase (MOAB) library, which allows for a complete description of the numerical grids and solution data used in each submodel. Through a scalable advancing-front intersection algorithm, the supermesh of the source and target grids are computed, which is then used to assemble the high-order, conservative, and monotonicity-preserving remapping weights between discretization specifications. The Fortran-compatible interfaces in MOAB are utilized to directly link the submodels in the Energy Exascale Earth System Model (E3SM) to enable online remapping strategies in order to simplify the coupled workflow process. We demonstrate the superior computational efficiency of the remapping algorithms in comparison with other state-of-the-science tools and present strong scaling results on large-scale machines for computing remapping weights between the spectral element atmosphere and finite volume discretizations on the polygonal ocean grids.

58 GEOSCIENCES↗

Graph Neural Network-based Tracking as a Service

Recent studies have shown promising results for track finding in dense environments using Graph Neural Network (GNN)-based algorithms. However, GNN-based track finding is computationally slow on CPUs, necessitating the use of coprocessors to accelerate the inference time. Additionally, the large input graph size demands a large device memory for efficient computation, a requirement not met by all computing facilities used for particle physics experiments, particularly those lacking advanced GPUs. Furthermore, deploying the GNN-based track-finding algorithm in a production environment requires the installation of all dependent software packages, exclusively utilized by this algorithm. These computing challenges must be addressed for the successful implementation of GNN-based track-finding algorithm into production settings. In response, we introduce a ``GNN-based tracking as a service'' approach, incorporating a custom backend within the NVIDIA Triton inference server to facilitate GNN-based tracking. This paper presents the performance of this approach using the Perlmutter supercomputer at NERSC.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

rBahadur: efficient simulation of structured high-dimensional genotype data with applications to assortative mating

Existing methods for generating synthetic genotype data are ill-suited for replicating the effects of assortative mating (AM). We propose rb_dplr, a novel and computationally efficient algorithm for generating high-dimensional binary random variates that effectively recapitulates AM-induced genetic architectures using the Bahadur order-2 approximation of the multivariate Bernoulli distribution. The rBahadur R library is available through the Comprehensive R Archive Network at https://CRAN.R-project.org/package=rBahadur.

59 BASIC BIOLOGICAL SCIENCES↗

Anisotropic yield models for lattice unit cell structures exploiting orthotropic symmetry

We report numerical homogenization enables efficient computational analysis and design of multiscale structures made of micro-architected materials including lattice unit cells. However, predicting yield is nontrivial because it requires accurate and efficient predictions of the maximum stress inside the homogenized unit cells. To address this challenge, we develop a macroscale anisotropic yield function for micro-architected materials. The yield function depends on the three-dimensional macroscale stress state and the parameters describing a family of micro-architectures, such as the radii of the struts in a lattice unit cell. To ensure accuracy, we determine the maximum stress using three-dimensional continuum finite-element analysis. To ensure efficiency, we construct surrogate models from the aforementioned high-fidelity results for yield prediction. To reduce simulation costs and surrogate modeling complexity, we leverage orthotropic symmetry commonly found in lattice unit cells. In this paper, we provide a thorough presentation of group representations and the systematic procedure to exploit orthotropic domain symmetry in homogenization and surrogate modeling. We illustrate the use of linear homogenization results to predict yield in specific unit cells without further simulations. We furthermore show that surrogate modeling presents a viable option for anisotropic yield prediction in a continuously parametrized family of micro-architectures. More specifically, despite the dimensionality and degree of nonlinearity in the maximum micro von Mises stress within the unit cell, the surrogate models can predict it with less than 5% error at least 90% of the time. Moreover, the largest under-prediction error, which is more critical than the over-prediction error, is typically less than 10%.

42 ENGINEERING↗

Ambient and Initial Temperature Effects on Energy Consumption Rate Modeled in FASTSim

Ambient and initial temperatures significantly impact the energy consumption rate (ECR) of battery electric vehicles (BEVs) due to auxiliary loads and the temperature dependence of battery efficiency. This study introduces a streamlined, physics-based thermal modeling approach within the FASTSim tool that bridges the gap between oversimplified constant-load models and computationally expensive high-fidelity simulations. By employing a lumped thermal mass framework, the model captures fundamental energy balances and critical non-linear energy penalties while maintaining the computational efficiency required for expansive sensitivity studies. The simulations evaluated a compact BEV hatchback with a resistive heater over city (UDDS) and highway (HWFET) test cycles. Compared to a 22 degrees Celsius initial and ambient temperature baseline, a -7 degrees Celsius initial/ambient temperature resulted in a 221% increase in the ECR for the city cycle and a 100% increase for the highway cycle. Conversely, a 45 degrees Celsius initial / 40 degrees Celsius ambient temperature resulted in a 40% increase for UDDS and an 18% increase for HWFET. These results demonstrate that while cold conditions impose the most severe energy penalties due to resistive heating, the impact is consistently more pronounced in city driving where auxiliary loads represent a larger proportion of total energy. This lightweight yet robust framework enables researchers to rapidly quantify BEV thermal sensitivity across diverse climates without the need for high-overhead simulation environments.

33 ADVANCED PROPULSION SYSTEMS↗

Techniques in performance and efficiency improvements of processors in a cooling system

Embodiments of the present disclosure describe methods, apparatuses, storage media, and systems for Thermal Design Power (TDP) rebalancing among thermally-coupled processors and non-thermally-coupled processors, providing computing efficiency or homogeneity with respect to, including but not limited to, thermal requirements, power consumption, and processor operations. The TDP rebalancing may include implementing management circuitry and configuration control circuitry. Other embodiments may be described and claimed.

Keceli, Fuat↗

Deep Koopman learning of nonlinear time-varying systems

Here this paper presents a data-driven approach to approximate the dynamics of a nonlinear time-varying system (NTVS) by a linear time-varying system (LTVS), which results from the Koopman operator and deep neural networks. Analysis of the approximation error between states of the NTVS and the resulting LTVS is presented. Simulations on a representative NTVS show that the proposed method achieves small approximation errors, even when the system changes rapidly. Furthermore, simulations in an example of quadcopters demonstrate the computational efficiency of the proposed approach.

97 MATHEMATICS AND COMPUTING↗

Parallel exponential time differencing methods for geophysical flow simulations

Two ocean models are considered for geophysical flow simulations: the multilayer shallow water equations and the multilayer primitive equations. For the former, we investigate the parallel performance of exponential time differencing (ETD) methods, including exponential Rosenbrock–Euler, ETD2wave, and B-ETD2wave. For the latter, we take advantage of the splitting of barotropic and baroclinic modes and propose a new two-level method in which an ETD method is applied to solve the fast barotropic mode. Furthermore, these methods could improve the computational efficiency of numerical simulations because ETD methods allow for much larger time step sizes than traditional explicit time-stepping techniques that are commonly used in existing computational ocean models. Several standard benchmark tests for ocean modeling are performed and comparison of the numerical results demonstrates a great potential of applying the parallel ETD methods for simulating real-world geophysical flows.

54 ENVIRONMENTAL SCIENCES↗

Generalized parton distributions from lattice QCD with asymmetric momentum transfer: Axial-vector case

Recently, we made significant advancements in improving the computational efficiency of lattice QCD calculations for generalized parton distributions (GPDs). This progress was achieved by adopting calculations of matrix elements in asymmetric frames, deviating from the computationally-expensive symmetric frame typically used, and allowing freedom in the choice for the distribution of the momentum transfer between the initial and final states. A crucial aspect of this approach involves the adoption of a Lorentz covariant parametrization for the matrix elements, introducing Lorentz-invariant amplitudes. This approach also allows us to propose an alternative definition of quasi-GPDs, ensuring frame independence and potentially reduce power corrections in matching to light cone GPDs. In our previous work, we presented lattice QCD results for twist-2 unpolarized GPDs ( H and E ) of quarks obtained from calculations performed in asymmetric frames at zero skewness. Building upon this work, we now introduce a novel Lorentz covariant parametrization for the axial-vector matrix elements. We employ this parametrization to compute the axial-vector GPD H ˜ at zero skewness, using an N f = 2 + 1 + 1 ensemble of twisted mass fermions with clover improvement. The light-quark masses employed in our calculations correspond to a pion mass of approximately 260 MeV. Published by the American Physical Society 2024

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Eigenvector centrality for geometric and topological characterization of porous media

Solving flow and transport through complex geometries such as porous media is computationally difficult. Such calculations usually involve the solution of a system of discretized differential equations, which could lead to extreme computational cost depending on the size of the domain and the accuracy of the model. Geometric simplifications like pore-networks, where the pores are represented by nodes and pore throats by edges connecting pores, have been proposed. These models, despite their ability to preserve the connectivity of the medium, have difficulties in capturing preferential paths (high velocity) and stagnation zones (low velocity) as they do not consider the specific relations between nodes. Nonetheless, network theory approaches, where a complex network is a graph, can help to simplify and better understand fluid dynamics and transport in porous media. Here we present a novel method to address these issues based on eigenvector centrality, which has been corrected to overcome the centralization problem, and modified to introduce a bias in the centrality distribution along a particular direction to address the flow and transport anisotropy in porous media. We compare the model predictions with millifluidic transport experiments, which shows that, albeit simple, this technique is computationally efficient and has potential for predicting preferential paths and stagnation zones for flow and transport in porous media. We propose to use eigenvector centrality probability distribution to compute entropy as an indicator of the ‘mixing capacity’ of the system.

58 GEOSCIENCES↗