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 1,711 records · Page 95

LDRD Abbreviated report: High-Order General-Discrete-Ordinates Method Enabling Efficient Deterministic Transport in Hydrodynamic Simulations

Deterministic transport simulations for national-security and energy applications often operate in high-dimensional phase-space, where accuracy and cost both become major challenges. A common numerical artifact in such problems is the “ray-effect,” which appears as unphysical streaks. Beyond misinterpretation, these artifacts can contaminate tightly coupled physics, such as fluid dynamics, radiation-hydrodynamics, and laser-plasma interactions, eroding the predictive capability of entire multiphysics workflows. Our objective was to make high-dimension studies practical on modern hardware while mitigating the ray-effect without relying on prohibitively expensive sampling approaches such as Monte Carlo methods. We developed the Generic Discretization Library (GenDiL), a Graphics Processing Unit (GPU)-first framework that uses high-order Discontinuous Galerkin (DG) methods and matrix-free algorithms to reduce memory usage and improve computational efficiency, critical for phase-space simulations. GenDiL supports phase-space adaptivity in both mesh size and polynomial order (hp-adaptivity) to place resolution only where it is needed. A central capability is Local Dimensional Refinement (LDR), which couples lower-dimension continuum models to higher-dimension kinetic models through stable and conservative interfaces, so that high-fidelity physics is applied only in regions where it is essential. Building on the GenDiL framework, we developed the General SN (GSN) family of algorithms as a true generalization of the polar SN approach (discrete ordinates, often denoted SN). Rather than tying discrete ordinates to a specific polar change of coordinates, GSN formulates transport on an arbitrary change of coordinates chosen to reduce ray-effect. We studied two complementary variants: an analytic variant, where the coordinate map is prescribed in advance by a closed-form function; and a data-driven variant, where a quantity of interest, such as the net flux, guides the coordinate system. GenDiL provides the library infrastructure for efficient GPU execution, but the GSN concept is algorithmic and independent of any one library. Across representative high-dimension tests, including non-symmetric solutions, both variants delivered strong ray-effect mitigation at practical cost, moving four- to six-dimensional analysis toward repeatable, routine studies.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Convex quadratic relaxations for mixed-integer nonlinear programs in power systems

Here, this paper presents a set of new convex quadratic relaxations for nonlinear and mixed-integer nonlinear programs arising in power systems. The considered models are motivated by hybrid discrete/continuous applications where existing approximations do not provide optimality guarantees. The new relaxations offer computational efficiency along with minimal optimality gaps, providing an interesting alternative to state-of-the-art semidefinite programming relaxations. Finally, three case studies in optimal power flow, optimal transmission switching and capacitor placement demonstrate the benefits of the new relaxations.

42 ENGINEERING↗

Effective Gaps Are Not Effective: Quasipolynomial Classical Simulation of Obstructed Stoquastic Hamiltonians

All known examples suggesting an exponential separation between classical simulation algorithms and stoquastic adiabatic quantum computing (StoqAQC) exploit symmetries that constrain adiabatic dynamics to effective, symmetric subspaces. The symmetries produce large effective eigenvalue gaps, which in turn make adiabatic computation efficient. We present a classical algorithm to subexponentially sample from an effective subspace of any k -local stoquastic Hamiltonian H , without a priori knowledge of its symmetries (or near symmetries). Our algorithm maps any k -local Hamiltonian to a graph G = ( V , E ) with | V | = O (poly (n)) , where n is the number of qubits. Given the well-known result of Babai [Graph isomorphism in quasipolynomial time, in Proceedings of the Forty-Eighth Annual ACM Symposium on Theory of Computing (2016), pp. 684–697], we exploit graph isomorphism to study the automorphisms of G and arrive at an algorithm quasipolynomial in | V | for producing samples from effective subspace eigenstates of H . Our results rule out exponential separations between StoqAQC and classical computation that arise from hidden symmetries in k -local Hamiltonians. Our graph representation of H is not limited to stoquastic Hamiltonians and may rule out corresponding obstructions in nonstoquastic cases, or be useful in studying additional properties of k -local Hamiltonians.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Simplified Phased-Mission System Analysis for Systems with Independent Component Repairs

Accurate analysis of reliability of system requires that it accounts for all major variations in system's operation. Most reliability analyses assume that the system configuration, success criteria, and component behavior remain the same. However, multiple phases are natural. We present a new computationally efficient technique for analysis of phased-mission systems where the operational states of a system can be described by combinations of components states (such as fault trees or assertions). Moreover, individual components may be repaired, if failed, as part of system operation but repairs are independent of the system state. For repairable systems Markov analysis techniques are used but they suffer from state space explosion. That limits the size of system that can be analyzed and it is expensive in computation. We avoid the state space explosion. The phase algebra is used to account for the effects of variable configurations, repairs, and success criteria from phase to phase. Our technique yields exact (as opposed to approximate) results. We demonstrate our technique by means of several examples and present numerical results to show the effects of phases and repairs on the system reliability/availability.

Somani, Arun K.↗

An Efficient Bayesian Approach to Learning Droplet Collision Kernels: Proof of Concept Using “Cloudy,” a New n -Moment Bulk Microphysics Scheme

The small-scale microphysical processes governing the formation of precipitation particles cannot be resolved explicitly by cloud resolving and climate models. Instead, they are represented by microphysics schemes that are based on a combination of theoretical knowledge, statistical assumptions, and fitting to data (“tuning”). Historically, tuning was done in an ad hoc fashion, leading to parameter choices that are not explainable or repeatable. Recent work has treated it as an inverse problem that can be solved by Bayesian inference. The posterior distribution of the parameters given the data—the solution of Bayesian inference—is found through computationally expensive sampling methods, which require over $\mathcal{O}$(10 5 ) evaluations of the forward model; this is prohibitive for many models. We present a proof of concept of Bayesian learning applied to a new bulk microphysics scheme named “Cloudy,” using the recently developed Calibrate-Emulate-Sample (CES) algorithm. Cloudy models collision-coalescence and collisional breakup of cloud droplets with an adjustable number of prognostic moments and with easily modifiable assumptions for the cloud droplet mass distribution and the collision kernel. The CES algorithm uses machine learning tools to accelerate Bayesian inference by reducing the number of forward evaluations needed to $\mathcal{O}$(10 2 ). It also exhibits a smoothing effect when forward evaluations are polluted by noise. In a suite of perfect-model experiments, we show that CES enables computationally efficient Bayesian inference of parameters in Cloudy from noisy observations of moments of the droplet mass distribution. In an additional imperfect-model experiment, a collision kernel parameter is successfully learned from output generated by a Lagrangian particle-based microphysics model.

54 ENVIRONMENTAL SCIENCES↗

Route-Optimized Energy Management of Connected and Automated Multi-Mode Plug-In Hybrid Electric Vehicle Using Dynamic Programming

This paper presents a methodology to optimize the blending of charge-depleting (CD) and charge-sustaining (CS) modes in a multi-mode plug-in hybrid electric vehicle (PHEV) that reduces overall energy consumption when the selected route cannot be completely driven in all-electric mode. The PHEV used in this investigation is the second-generation Chevrolet Volt and as many as four instrumented vehicles were utilized simultaneously on road to acquire validation data. The optimization method used is dynamic programming (DP) paired with a reduced-order powertrain model to enable onboard embedded controller compatibility and computational efficiency in optimally blending CD, CS modes over the entire drive route. The objective of the optimizer is to enable future Connected and Automated Vehicles (CAVs) to best utilize onboard energy for minimum overall energy consumption based on speed and elevation profile information from Intelligent Transportation Systems (ITS), Internet of Things (IoT), High-definition Mapping, and onboard sensing technologies. Emphasis is placed on runtime minimization to quickly react and plan an optimal mode scheme in highly dynamic road conditions with minimal computational resources. On-road performance of the optimizer paired with automated CD and CS mode selection is evaluated on a fleet of four instrumented Chevrolet Volts in a variety of driving scenarios. Here, the results indicate variable energy savings depending on the drive route and initial battery SOC with potential ranging between 2 to 12% and less than 7 seconds initial optimization for a 24-mile drive cycle.

33 ADVANCED PROPULSION SYSTEMS↗

Efficient and Optimal Attitude Determination Using Recursive Global Positioning System Signal Operations

In this paper, a new and efficient algorithm is developed for attitude determination from Global Positioning System signals. The new algorithm is derived from a generalized nonlinear predictive filter for nonlinear systems. This uses a one time-step ahead approach to propagate a simple kinematics model for attitude determination. The advantages of the new algorithm over previously developed methods include: it provides optimal attitudes even for coplanar baseline configurations; it guarantees convergence even for poor initial conditions; it is a non-iterative algorithm; and it is computationally efficient. These advantages clearly make the new algorithm well suited to on-board applications. The performance of the new algorithm is tested on a dynamic hardware simulator. Results indicate that the new algorithm accurately estimates the attitude of a moving vehicle, and provides robust attitude estimates even when other methods, such as a linearized least-squares approach, fail due to poor initial starting conditions.

Crassidis, John L.↗

Alternative Modal Basis Selection Procedures For Reduced-Order Nonlinear Random Response Simulation

Three procedures to guide selection of an efficient modal basis in a nonlinear random response analysis are examined. One method is based only on proper orthogonal decomposition, while the other two additionally involve smooth orthogonal decomposition. Acoustic random response problems are employed to assess the performance of the three modal basis selection approaches. A thermally post-buckled beam exhibiting snap-through behavior, a shallowly curved arch in the auto-parametric response regime and a plate structure are used as numerical test articles. The results of a computationally taxing full-order analysis in physical degrees of freedom are taken as the benchmark for comparison with the results from the three reduced-order analyses. For the cases considered, all three methods are shown to produce modal bases resulting in accurate and computationally efficient reduced-order nonlinear simulations.

Przekop, Adam↗

Four-dimensional cone beam CT reconstruction and enhancement using a temporal nonlocal means method

Purpose: Four-dimensional cone beam computed tomography (4D-CBCT) has been developed to provide respiratory phase-resolved volumetric imaging in image guided radiation therapy. Conventionally, it is reconstructed by first sorting the x-ray projections into multiple respiratory phase bins according to a breathing signal extracted either from the projection images or some external surrogates, and then reconstructing a 3D CBCT image in each phase bin independently using FDK algorithm. This method requires adequate number of projections for each phase, which can be achieved using a low gantry rotation or multiple gantry rotations. Inadequate number of projections in each phase bin results in low quality 4D-CBCT images with obvious streaking artifacts. 4D-CBCT images at different breathing phases share a lot of redundant information, because they represent the same anatomy captured at slightly different temporal points. Taking this redundancy along the temporal dimension into account can in principle facilitate the reconstruction in the situation of inadequate number of projection images. In this work, the authors propose two novel 4D-CBCT algorithms: an iterative reconstruction algorithm and an enhancement algorithm, utilizing a temporal nonlocal means (TNLM) method. Methods: The authors define a TNLM energy term for a given set of 4D-CBCT images. Minimization of this term favors those 4D-CBCT images such that any anatomical features at one spatial point at one phase can be found in a nearby spatial point at neighboring phases. 4D-CBCT reconstruction is achieved by minimizing a total energy containing a data fidelity term and the TNLM energy term. As for the image enhancement, 4D-CBCT images generated by the FDK algorithm are enhanced by minimizing the TNLM function while keeping the enhanced images close to the FDK results. A forward-backward splitting algorithm and a Gauss-Jacobi iteration method are employed to solve the problems. The algorithms implementation on GPU is designed to avoid redundant and uncoalesced memory access, in order to ensure a high computational efficiency. Our algorithms have been tested on a digital NURBS-based cardiac-torso phantom and a clinical patient case. Results: The reconstruction algorithm and the enhancement algorithm generate visually similar 4D-CBCT images, both better than the FDK results. Quantitative evaluations indicate that, compared with the FDK results, our reconstruction method improves contrast-to-noise-ratio (CNR) by a factor of 2.56-3.13 and our enhancement method increases the CNR by 2.75-3.33 times. The enhancement method also removes over 80% of the streak artifacts from the FDK results. The total computation time is 509-683 s for the reconstruction algorithm and 524-540 s for the enhancement algorithm on an NVIDIA Tesla C1060 GPU card. Conclusions: By innovatively taking the temporal redundancy among 4D-CBCT images into consideration, the proposed algorithms can produce high quality 4D-CBCT images with much less streak artifacts than the FDK results, in the situation of inadequate number of projections.

60 APPLIED LIFE SCIENCES↗

Unsteady Aerodynamic Models for Turbomachinery Aeroelastic and Aeroacoustic Applications

Theoretical analyses and computer codes are being developed for predicting compressible unsteady inviscid and viscous flows through blade rows of axial-flow turbomachines. Such analyses are needed to determine the impact of unsteady flow phenomena on the structural durability and noise generation characteristics of the blading. The emphasis has been placed on developing analyses based on asymptotic representations of unsteady flow phenomena. Thus, high Reynolds number flows driven by small amplitude unsteady excitations have been considered. The resulting analyses should apply in many practical situations and lead to a better understanding of the relevant flow physics. In addition, they will be efficient computationally, and therefore, appropriate for use in aeroelastic and aeroacoustic design studies. Under the present effort, inviscid interaction and linearized inviscid unsteady flow models have been formulated, and inviscid and viscid prediction capabilities for subsonic steady and unsteady cascade flows have been developed. In this report, we describe the linearized inviscid unsteady analysis, LINFLO, the steady inviscid/viscid interaction analysis, SFLOW-IVI, and the unsteady viscous layer analysis, UNSVIS. These analyses are demonstrated via application to unsteady flows through compressor and turbine cascades that are excited by prescribed vortical and acoustic excitations and by prescribed blade vibrations. Recommendations are also given for the future research needed for extending and improving the foregoing asymptotic analyses, and to meet the goal of providing efficient inviscid/viscid interaction capabilities for subsonic and transonic unsteady cascade flows.

Verdon, Joseph M.↗

Resilience Enhancement of Distribution Grids Against Extreme Weather Events

This paper proposes a resilience-oriented design (ROD) technique to protect distribution grids against high-impact but low-probability extreme weather events. The problem is formulated as a two-stage stochastic mixed integer problem. The first stage is to make ROD decisions, i.e., hardening existing distribution lines and deploying ROD resources such as back-up distributed generators and automatic switches. The second stage evaluates the system operation cost during a realized extreme weather event and repair cost after the event. A novel modeling strategy is proposed to deal with the decision-dependent uncertainty of distribution line damage status, which is affected by the first-stage hardening decisions. As both stages have binary variables, a modified and computationally efficient progressive hedging algorithm with scenario bundling is introduced. The algorithm performance is evaluated by calculating lower bounds of solutions. In conclusion, the proposed model and algorithms are demonstrated on 34-bus and 123-bus test feeders.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Automated Variance Reduction Applied to Nuclear Well-Logging Problems

The Monte Carlo method enables detailed, explicit geometric, energy and angular representations, and hence is considered to be the most accurate method available for solving complex radiation transport problems. Because of its associated accuracy, the Monte Carlo method is widely used in the petroleum exploration industry to design, benchmark, and simulate nuclear well-logging tools. Nuclear well-logging tools, which contain neutron and/or gamma sources and two or more detectors, are placed in boreholes that contain water (and possibly other fluids) and that are typically surrounded by a formation (e.g., limestone, sandstone, calcites, or a combination). The response of the detectors to radiation returning from the surrounding formation is used to infer information about the material porosity, density, composition, and associated characteristics. Accurate computer simulation is a key aspect of this exploratory technique. However, because this technique involves calculating highly precise responses (at two or more detectors) based on radiation that has interacted with the surrounding formation, the transport simulations are computationally intensive, requiring significant use of variance reduction techniques, parallel computing, or both. Because of the challenging nature of these problems, nuclear well-logging problems have frequently been used to evaluate the effectiveness of variance reduction techniques (e.g., Refs. 1-4). The primary focus of these works has been on improving the computational efficiency associated with calculating the response at the most challenging detector location, which is typically the detector furthest from the source. Although the objective of nuclear well-logging simulations is to calculate the response at multiple detector locations, until recently none of the numerous variance reduction methods/techniques has been well-suited to simultaneous optimization of multiple detector (tally) regions. Therefore, a separate calculation is typically performed for each desired detector response. This paper summarizes recent work to apply and evaluate the effectiveness of deterministic-adjoint-based variance reduction methods, including a recently developed method for simultaneous optimization of multiple detectors, for two simple nuclear well-logging tool problems that have been widely used in the variance reduction literature. The computational effectiveness of the method for simultaneous optimization is also compared to the use of multiple, individually optimized simulations for these simple well-logging problems.

02 PETROLEUM↗

6D large charge and 2D Virasoro blocks

We compute observables in the interacting rank-one 6D 𝒩 =(2,0) superconformal field theory (SCFT) at large 𝑅-charge. We focus on correlators involving Φ 𝑛 , namely symmetric products of the bottom component of the supermultiplet containing the stress tensor. By using the moduli space effective action and methods from the large-charge expansion, we compute the operator product expansion coefficients ⟨Φ 𝑛 ⁢Φ 𝑚 ⁢Φ 𝑛+𝑚 ⟩ in an expansion in 1/𝑛. The coefficients of the expansion are only partially determined from the 6D perspective, but we manage to fix them order-by-order in 1/𝑛 numerically by utilizing the 6⁢D/2⁢D correspondence. This is made possible by the fact that this 6D observable can be extracted in 2D from a specific double-scaling limit of the vacuum Virasoro block, which can be efficiently computed numerically. We also extend the computation to higher-rank SCFTs, and discuss various applications of our results to 6D as well as 2D.

classical solutions in field theory↗

A simplified parameterization of isoprene-epoxydiol-derived secondary organic aerosol (IEPOX-SOA) for global chemistry and climate models: a case study with GEOS-Chem v11-02-rc

Secondary organic aerosol derived from isoprene epoxydiols (IEPOX-SOA) is thought to contribute the dominant fraction of total isoprene SOA, but the current volatility-based lumped SOA parameterizations are not appropriate to represent the reactive uptake of IEPOX onto acidified aerosols. A full explicit modeling of this chemistry is however computationally expensive owing to the many species and reactions tracked, which makes it difficult to include it in chemistry–climate models for long-term studies. Here we present three simplified parameterizations (version 1.0) for IEPOX-SOA simulation, based on an approximate analytical/fitting solution of the IEPOX-SOA yield and formation timescale. The yield and timescale can then be directly calculated using the global model fields of oxidants, NO, aerosol pH and other key properties, and dry deposition rates. The advantage of the proposed parameterizations is that they do not require the simulation of the intermediates while retaining the key physicochemical dependencies. We have implemented the new parameterizations into the GEOS-Chem v11-02-rc chemical transport model, which has two empirical treatments for isoprene SOA (the volatility-basis-set, VBS, approach and a fixed 3% yield parameterization), and compared all of them to the case with detailed fully explicit chemistry. The best parameterization (PAR3) captures the global tropospheric burden of IEPOX-SOA and its spatiotemporal distribution ( R 2 =0.94 ) vs. those simulated by the full chemistry, while being more computationally efficient ( ~5 times faster), and accurately captures the response to changes in NO x and SO 2 emissions. On the other hand, the constant 3 % yield that is now the default in GEOS-Chem deviates strongly ( R 2 =0.66 ), as does the VBS ( R 2 =0.47 , 49% underestimation), with neither parameterization capturing the response to emission changes. With the advent of new mass spectrometry instrumentation, many detailed SOA mechanisms are being developed, which will challenge global and especially climate models with their computational cost. The methods developed in this study can be applied to other SOA pathways, which can allow including accurate SOA simulations in climate and global modeling studies in the future.

58 GEOSCIENCES↗

Formulation and solution approach for calibrating activity-based travel demand model-system via microsimulation

This study addresses the problem of calibrating utility-maximizing nested logit activity-based travel demand model-systems. After estimation, it is common practice to use aggregate measurements to calibrate the estimated model-system’s parameters prior to their application in transportation planning, policy making, and operations. However, calibration of activity-based model-systems has received much less attention. Existing calibration approaches are myopic heuristics in the sense that they do not consider the fundamental inter-dependencies among choice-models and do not have a systematic way to adjust model parameters. Also, other purely simulation-based approaches do not perform well in large-scale applications. In this study, we focus on utility-maximizing nested logit activity-based model-systems and calibrating aggregate statistics such as activity shares, mode shares, time-dependent & mode-specific OD flows, and time-dependent & mode-specific sensor counts. We formulate the calibration problem as a simulation-based optimization problem and propose a stochastic gradient-based solution procedure to solve it. The solution procedure relies on microsimulation to calculate expectations of the aggregate statistics of interest to the calibration problem. Additionally, we derive approximate analytical expressions for the gradient of the objective function —that are evaluated through microsimulation on mini-batches of the population. The proposed solution procedure is sensitive to the fundamental structure of the activity-based model-system and is non-myopic in considering the dependencies across its model components. The formulated optimization problem is non-convex, highly nonlinear, and potentially has multiple-minima. Lastly, we show —through a real-world application— that the proposed solution procedure outperforms other state-of-the-art purely simulation-based optimization approaches in terms of computational efficiency, stability, and convergence. We also compare various gradient-based solution algorithms to determine the best algorithm to update the parameters. This work has the potential to facilitate wider and easier application of activity-based model-systems.

97 MATHEMATICS AND COMPUTING↗

AutonomieAI: An efficient and deployable vehicle energy consumption estimation toolkit

Here, this paper presents AutonomieAI, a novel toolkit designed for efficient energy estimation of vehicles across diverse trip scenarios, routes, and drive cycles, applicable to a broad range of vehicle powertrain technologies. It leverages state-of-the-art Machine Learning techniques to deliver real-time energy prediction of vehicles, enabling co-simulation with transportation level system tools and opening doors for large-scale optimization at city, network or national level. Benchmark results show that AutonomieAI achieves high accuracy, with an average percentage error below 2% for most powertrain types, and computational efficiency capable of processing over 10,000 trips per second. Applications of AutonomieAI have potential to offer the flexibility to assist in solving eco-routing problems, optimize for vehicle and powertrain selection, study charging decision behavior, and optimize for charging station placement. AutonomieAI is the result of large neural network based model architectures, trained on very large and unique high fidelity vehicle simulation data. It is lightweight, deployable, efficient and has accuracy comparable to specialized and complex physics based simulation softwares.

Autonomie↗

Comparative Analysis for the Chicago Energy Retrofit Project: Project Report

For the Chicago Loop Energy Efficiency Retrofit project, Argonne is developing and piloting analytic methods that capture the energy performance of individual commercial buildings; can be scaled to communities; and appropriately evaluate retrofit options in real contexts. The decision tools under development span and integrate building energy performance calculations, uncertainty analysis, and financial risk assessment. A key outcome from this project is an energy calculator, EECalc, developed in collaboration with the Georgia Institute of Technology. The energy modeling methodology used in EECalc was chosen specifically because it (1) is computationally efficient, (2) uses only observable building data that take a relatively low level of effort to compile, and (3) requires minimal modeling expertise and judgment from the user. These features expand the possibilities for EECalc’s widespread, large-scale use in retrofit and uncertainty analysis.

Guzowski, Leah B.↗