Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Computational Complexity”

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 523 records · Page 29
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Grey-box and ANN-based building models for multistep-ahead prediction of indoor temperature to implement model predictive control

Model-based predictive control (MPC) strategies for heating, ventilation, and air-conditioning (HVAC) systems present an opportunity to lower building energy consumption and operational costs. Such approaches rely on the development of a model to precisely forecast building thermal dynamics, such as room air temperature or heating/cooling rate, and make control-related decisions. The control-oriented modeling of building energy systems should be accurate in predicting indoor conditions and present low computational complexity. These features are the key challenge of implementing advanced control methods such as MPC. Extant studies on building modeling for MPC have focused on step-ahead forecasting techniques to forecast building thermal dynamics, while multistep-ahead forecasting is essential. Moreover, machine learning model suitable in case of the domain-based engineering expertise are also not available. To this aim, we perform a comparative analysis of the grey-box model based on a resistance-capacitance (RC) thermal network and a machine learning model composed of an artificial neural network (ANN) for multistep-ahead prediction of building thermal dynamics using current and historical data. Actual experimental data obtained from the Flexible Research Platform (FRP) in Oak Ridge National Laboratory (US) are used for estimation and validation purposes. The average root mean squared error (RMSE) of the grey-box and ANN models are 0.89 °C and 1.02°C, respectively. Finally, the results indicate that the grey-box model outperforms the ANN model in the considered validation periods in terms of accuracy and prediction stability.

42 ENGINEERING↗
DOE OSTI2024

Bayesian calibration and uncertainty quantification of a rate-dependent cohesive zone model for polymer interfaces

In this work we present a rate-dependent cohesive zone model for the fracture of polymeric interfaces and performs a Bayesian calibration, an uncertainty quantification, and a sensitivity analysis for the model. The proposed cohesive zone model accounts for both reversible elastic and irreversible rate-dependent separation sliding deformation at the interface. The viscous dissipation due to the irreversible opening at the interface is modeled using elastic-viscoplastic kinematics that incorporates the effects of strain rate. Inverse calibration of parameters for such complex models through trial and error is challenging due to the large number of parameters of the model. Moreover, the calibrated parameter values are often non-unique and uncertain when the available experimental data is limited. To tackle this challenge, we employ a Bayesian calibration approach to identify parameters from experimental data, the resulting parameters significantly enhance the accuracy of the model. To quantify the uncertainty associated with the inverse parameter estimation, a modular Bayesian approach is employed to calibrate the unknown model parameters, accounting for the parameter uncertainty of the cohesive zone model. The advantages of the Bayesian calibration over a deterministic parameter fit are demonstrated. Further, to quantify the model uncertainties, such as incorrect assumptions or missing physics, a discrepancy function is introduced, which significantly improves the model’s prediction. Finally, the total uncertainty of the model is quantified in a predictive setting. A sensitivity analysis is performed to assess how changes in the input variables of the model affect the peak load, facilitating the identification of a concise set of highly influential parameters. The present approach can be used for calibration and uncertainty quantification for other complex computational mechanics models. It should also facilitate the designing of interface materials under uncertainty.

42 ENGINEERING↗
DOE OSTI2023

Extremely rapid, Lagrangian modeling of 2D flooding: A rivulet-based approach

Estimates of potential flood inundation areas and depths are critical to informing the preparedness, response, and investment decisions of many government agencies and private sector organizations, especially under a changing climate. The standard modeling approaches, however, are often either computationally intensive or constrained in their accuracy or applicability. A novel, rivulet-based, 2D model of pluvial flooding is described in this article that is 10,000 to 10 million times less computationally complex than the full solution of the shallow water equations, yet achieves inundation area hit rates of between 0.8 and 0.9 and relative absolute mean errors of 10%-20% across a wide range of flow depths. This combination of accuracy and efficiency will enable real-time depth estimates during flood events, detailed sensitivity analyses, and the generation of large ensembles to support broad uncertainty analyses.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2024

An OpenStreetMaps based tool to study the energy demand and emissions impact of electrification of medium and heavy-duty freight trucks

In this paper, we present the mathematical formulation of an OpenStreetMaps (OSM) based tool that compares the costs and emissions of long-haul medium and heavy-duty (M&HD) electric and diesel freight trucks, and determines the spatial distribution of added energy demand due to M&HD EVs. The optimization utilizes a combination of information on routes from OSM, utility rate design data across the United States, and freight volume data, to determine these values. In order to deal with the computational complexity of this problem, we formulate the problem as a convex optimization problem that is scalable to a large geographic area. In our analysis, we further evaluate various scenarios of utility rate design (energy charges) and EV penetration rate across different geographic regions and their impact on the operating cost and emissions of the freight trucks. Our approach determines the net emissions reduction benefits of freight electrification by considering the primary energy source in different regions. Such analysis will provide insights to policy makers in designing utility rates for electric vehicle supply equipment (EVSE) operators depending upon the specific geographic region and to electric utilities in deciding infrastructure upgrades based on the spatial distribution of the added energy demand of M&HD EVs. To showcase the results, a case study for the U.S. state of Texas is conducted.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2023

An optical-input Maximum Likelihood Estimation feedback system demonstrated on tokamak horizontal equilibrium control

A readily parallelized Maximum Likelihood Estimation (MLE) algorithm with linear computational complexity is demonstrated in real time using only measurements from an extreme ultraviolet (EUV) diagnostic to control the horizontal position of a tokamak plasma. A set of trial emissivity profiles are parameterized by the control quantity of interest (R m ), and the MLE is identified from the profile which minimizes the signal reconstruction residual. The algorithm depends on an empirically determined likelihood function with exponential form. EUV emission (λ ≈ 15eV-1keV) is captured in a poloidal plane by four 16-channel AXUV diodes mounted at different poloidal angles with radial and angular resolution sufficient to discern plasma equilibrium evolution in HBT-EP. Calculations of the plasma major radius by the system are consistent within diagnostic uncertainty for the majority of the discharge with those of: a weighted average of vertical soft X-ray or EUV chords, magnetic sensors, and an equilibrium reconstruction. The feedback system corrects for a horizontal displacement of the major radius equal to 20% of the plasma minor radius by adjusting the vertical field produced from 40 in-vessel control coils in real time. The MLE calculation is performed on a GPU in a 15 μs cycle, with similar performance in this application to a simple weighted average of vertical chords. Finally, results demonstrate horizontal position control using magnetic actuators and an optical observer.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2016

A new efficient formulation of the HLLEM Riemann solver for general conservative and non-conservative hyperbolic systems

In this paper a new, simple and universal formulation of the HLLEM Riemann solver (RS) is proposed that works for general conservative and non-conservative systems of hyperbolic equations. For non-conservative PDE, a path-conservative formulation of the HLLEM RS is presented for the first time in this paper. The HLLEM Riemann solver is built on top of a novel and very robust path-conservative HLL method. It thus naturally inherits the positivity properties and the entropy enforcement of the underlying HLL scheme. However, with just the slight additional cost of evaluating eigenvectors and eigenvalues of intermediate characteristic fields, we can represent linearly degenerate intermediate waves with a minimum of smearing. For conservative systems, our paper provides the easiest and most seamless path for taking a pre-existing HLL RS and quickly and effortlessly converting it to a RS that provides improved results, comparable with those of an HLLC, HLLD, Osher or Roe-type RS. This is done with minimal additional computational complexity, making our variant of the HLLEM RS also a very fast RS that can accurately represent linearly degenerate discontinuities. Our present HLLEM RS also transparently extends these advantages to non-conservative systems. For shallow water-type systems, the resulting method is proven to be well-balanced. Several test problems are presented for shallow water-type equations and two-phase flow models, as well as for gas dynamics with real equation of state, magnetohydrodynamics (MHD & RMHD), and nonlinear elasticity. Since our new formulation accommodates multiple intermediate waves and has a broader applicability than the original HLLEM method, it could alternatively be called the HLLI Riemann solver, where the “I” stands for the intermediate characteristic fields that can be accounted for. -- Highlights: •New simple and general path-conservative formulation of the HLLEM Riemann solver. •Application to general conservative and non-conservative hyperbolic systems. •Inclusion of sub-structure and resolution of intermediate characteristic fields. •Well-balanced for single- and two-layer shallow water equations and multi-phase flows. •Euler equations with real equation of state, MHD equations, nonlinear elasticity.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2016

Polynomial meta-models with canonical low-rank approximations: Numerical insights and comparison to sparse polynomial chaos expansions

The growing need for uncertainty analysis of complex computational models has led to an expanding use of meta-models across engineering and sciences. The efficiency of meta-modeling techniques relies on their ability to provide statistically-equivalent analytical representations based on relatively few evaluations of the original model. Polynomial chaos expansions (PCE) have proven a powerful tool for developing meta-models in a wide range of applications; the key idea thereof is to expand the model response onto a basis made of multivariate polynomials obtained as tensor products of appropriate univariate polynomials. The classical PCE approach nevertheless faces the “curse of dimensionality”, namely the exponential increase of the basis size with increasing input dimension. To address this limitation, the sparse PCE technique has been proposed, in which the expansion is carried out on only a few relevant basis terms that are automatically selected by a suitable algorithm. An alternative for developing meta-models with polynomial functions in high-dimensional problems is offered by the newly emerged low-rank approximations (LRA) approach. By exploiting the tensor–product structure of the multivariate basis, LRA can provide polynomial representations in highly compressed formats. Through extensive numerical investigations, we herein first shed light on issues relating to the construction of canonical LRA with a particular greedy algorithm involving a sequential updating of the polynomial coefficients along separate dimensions. Specifically, we examine the selection of optimal rank, stopping criteria in the updating of the polynomial coefficients and error estimation. In the sequel, we confront canonical LRA to sparse PCE in structural-mechanics and heat-conduction applications based on finite-element solutions. Canonical LRA exhibit smaller errors than sparse PCE in cases when the number of available model evaluations is small with respect to the input dimension, a situation that is often encountered in real-life problems. By introducing the conditional generalization error, we further demonstrate that canonical LRA tend to outperform sparse PCE in the prediction of extreme model responses, which is critical in reliability analysis.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2017

Coupling sample paths to the thermodynamic limit in Monte Carlo estimators with applications to gene expression

Many biochemical systems appearing in applications have a multiscale structure so that they converge to piecewise deterministic Markov processes in a thermodynamic limit. The statistics of the piecewise deterministic process can be obtained much more efficiently than those of the exact process. We explore the possibility of coupling sample paths of the exact model to the piecewise deterministic process in order to reduce the variance of their difference. We then apply this coupling to reduce the computational complexity of a Monte Carlo estimator. Motivated by the rigorous results in , we show how this method can be applied to realistic biological models with nontrivial scalings.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2018

Gradient-based optimization for regression in the functional tensor-train format

Predictive analysis of complex computational models, such as uncertainty quantification (UQ), must often rely on using an existing database of simulation runs. In this paper we consider the task of performing low-multilinear-rank regression on such a database. Specifically we develop and analyze an efficient gradient computation that enables gradient-based optimization procedures, including stochastic gradient descent and quasi-Newton methods, for learning the parameters of a functional tensor-train (FT). We compare our algorithms with 22 other nonparametric and parametric regression methods on 10 real-world data sets and show that for many physical systems, exploiting low-rank structure facilitates efficient construction of surrogate models. Here, we use a number of synthetic functions to build insight into behavior of our algorithms, including the rank adaptation and group-sparsity regularization procedures that we developed to reduce overfitting. Finally we conclude the paper by building a surrogate of a physical model of a propulsion plant on a naval vessel.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Compression of tokamak boundary plasma simulation data using a maximum volume algorithm for matrix skeleton decomposition

This report demonstrates satisfactory data compression of SOLPS-ITER simulation output ranging from 2D fields, 1D profiles, and 0D scalar variables with a novel matrix decomposition approach. The singular value decomposition (SVD) scales poorly for large matrix sizes and is unsuited to the application on high dimensional data common to fusion plasma physics simulation. In this work, we employ the columns-submatrix-rows (CUR) matrix factorization technique in order to compute a low-rank approximation up to two orders of magnitude faster than the SVD, but within a nominal L2-norm relative error of ε = 10 –2 . In addition, the CUR approach maintains the original format of the data, in its extracted columns and rows, allowing for interpretable data storage at the original resolution of the simulation. We utilize an iterative algorithm to compute the CUR decomposition of simulation output by maximizing the volume, or linearly independent information content, of a low-rank submatrix contained within the data. Experiments over $\textit{n} × \textit{n}$ randomized test matrices with embedded rank-deficient features show that this maximum volume implementation of CUR matrix approximation has reduced asymptotic computational complexity on the order of n compared to the SVD, which scales approximately as $n^3$. These results show that the CUR technique can be used to effectively select time step snapshots (columns) of over 140 SOLPS-ITER output variables and the associated discretized coordinate timeseries (rows) allowing for reconstruction of the complete simulation dynamics.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2023

Predicting rare events using neural networks and short-trajectory data

Estimating the likelihood, timing, and nature of events is a major goal of modeling stochastic dynamical systems. When the event is rare in comparison with the timescales of simulation and/or measurement needed to resolve the elemental dynamics, accurate prediction from direct observations becomes challenging. In such cases a more effective approach is to cast statistics of interest as solutions to Feynman-Kac equations (partial differential equations). Here, we develop an approach to solve Feynman-Kac equations by training neural networks on short-trajectory data. Our approach is based on a Markov approximation but otherwise avoids assumptions about the underlying model and dynamics. This makes it applicable to treating complex computational models and observational data. Additionally, we illustrate the advantages of our method using a low-dimensional model that facilitates visualization, and this analysis motivates an adaptive sampling strategy that allows on-the-fly identification of and addition of data to regions important for predicting the statistics of interest. Finally, we demonstrate that we can compute accurate statistics for a 75-dimensional model of sudden stratospheric warming. This system provides a stringent test bed for our method.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Experimental validation of model predictive control for solid oxide fuel cells

Here, this paper presents implementation of a model predictive controller (MPC) for an experimental solid oxide fuel cell (SOFC) system. The MPC controller is based on a gain-scheduled predictor with block-oriented structure that can capture important non-linear effects while still keeping the computational complexity low enough to meet real time control requirements. Experimental results show the MPC is able to regulate the SOFC cathode outlet temperature in the face of startup transients and input perturbations.

30 DIRECT ENERGY CONVERSION↗
DOE OSTI2024

A variance deconvolution estimator for efficient uncertainty quantification in Monte Carlo radiation transport applications

Monte Carlo simulations are at the heart of many high-fidelity simulations and analyses for radiation transport systems. As is the case with any complex computational model, it is important to propagate sources of input uncertainty and characterize how they affect model output. Unfortunately, uncertainty quantification (UQ) is made difficult by the stochastic variability that Monte Carlo transport solvers introduce. The standard method to avoid corrupting the UQ statistics with the transport solver noise is to increase the number of particle histories, resulting in very high computational costs. In this contribution, we propose and analyze a sampling estimator based on the law of total variance to compute UQ variance even in the presence of residual noise from Monte Carlo transport calculations. Here, we rigorously derive the statistical properties of the new variance estimator, compare its performance to that of the standard method, and demonstrate its use on neutral particle transport model problems involving both attenuation and scattering physics. We illustrate, both analytically and numerically, the estimator’s statistical performance as a function of available computational budget and the distribution of that budget between UQ samples and particle histories. We show analytically and corroborate numerically that the new estimator is unbiased, unlike the standard approach, and is more accurate and precise than the standard estimator for the same computational budget.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2023

A comparison of machine learning surrogate models of street-scale flooding in Norfolk, Virginia

Low-lying coastal cities, exemplified by Norfolk, Virginia, face the challenge of street flooding caused by rainfall and tides, which strain transportation and sewer systems and can lead to personal and property damage. While high-fidelity, physics-based simulations provide accurate predictions of urban pluvial flooding, their computational complexity renders them unsuitable for real-time applications. Using data from Norfolk rainfall events between 2016 and 2018, this study compares the performance of a previous surrogate model based on a random forest algorithm with two deep learning models: Long Short-Term Memory (LSTM) and Gated Recurrent Unit (GRU). The comparison of deep learning to the random forest algorithm is motivated by the desire to utilize a machine learning architecture that allows for the future inclusion of common uncertainty quantification techniques and the effective integration of relevant, multi-modal features.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2017

Pulse shape discrimination of Cs 2 LiYCl 6 :Ce 3+ detectors at high count rate based on triangular and trapezoidal filters

Cs 2 LiYCl 6 :Ce 3+ (CLYC) detectors have demonstrated the capability to simultaneously detect γ-rays and thermal and fast neutrons with medium energy resolution, reasonable detection efficiency, and substantially high pulse shape discrimination performance. In this work, a disadvantage of CLYC detectors is the long scintillation decay times, which causes pulse pile-up at moderate input count rate. Pulse processing algorithms were developed based on triangular and trapezoidal filters to discriminate between neutrons and γ-rays at high count rate. The algorithms were first tested using low-rate data. They exhibit a pulse-shape discrimination performance comparable to that of the charge comparison method, at low rate. Then, they were evaluated at high count rate. Neutrons and γ-rays were adequately identified with high throughput at rates of up to 375 kcps. The algorithm developed using the triangular filter exhibits discrimination capability marginally higher than that of the trapezoidal filter based algorithm irrespective of low or high rate. The algorithms exhibit low computational complexity and are executable on an FPGA in real-time. Finally, they are also suitable for application to other radiation detectors whose pulses are piled-up at high rate owing to long scintillation decay times.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2021

Stochastic pre-event preparation for enhancing resilience of distribution systems

Extreme weather events are the common causes for power supply interruptions and power outages in electrical distribution systems. Improving the distribution system and enhancing its resilience is becoming crucial due to the increased frequency of extreme weather events. Preparation and allocation of multiple flexible resources, such as mobile resources, fuel resources, and labor resources before extreme weather events can mitigate the effects of extreme weather events and enhance the resilience of power distribution systems. Here, in this paper, a two-stage stochastic mixed-integer linear programming (SMILP) is proposed to optimize the preparation and resource allocation process for upcoming extreme weather events, which leads to faster and more efficient post-event restoration. The objective of the proposed two-stage SMILP is to maximize the served load and minimize the operating cost of flexible resources. The first stage in the optimization problem selects the amounts and locations of different resources. The second stage considers the operational constraints of the distribution system and repair crew scheduling constraints. The proposed stochastic pre-event preparation model is solved by a scenario decomposition method, Progressive Hedging (PH), to ease the computational complexity introduced by a large number of scenarios. Furthermore, to show the impact of solar photovoltaic (PV) generation on system resilience, three types of PV systems are considered during a power outage and the resilience improvements with different PV penetration levels are compared. Numerical results from simulations on a large-scale (more than 10,000 nodes) distribution feeder have been used to validate the effectiveness and scalability of the proposed method.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2025

Data-Efficient Strategies for Probabilistic Voltage Envelopes under Network Contingencies

This work presents an efficient data-driven method to construct probabilistic voltage envelopes (PVE) using power flow learning in grids with network contingencies. First, a network-aware Gaussian process (GP) termed Vertex-Degree Kernel (VDK-GP), developed in prior work, is used to estimate voltage–power functions for a few network configurations. The paper introduces a novel multi-task vertex degree kernel (MT-VDK) that amalgamates the learned VDK-GPs to determine power flows for unseen networks, with a significant reduction in the computational complexity and hyperparameter requirements compared to alternate approaches. Simulations on the IEEE 30-Bus network demonstrate the retention and transfer of power flow knowledge in both N-1 and N-2 contingency scenarios. The MT-VDK-GP approach achieves over 50 % reduction in mean prediction error for novel N-1 contingency network configurations in low training data regimes (50–250 samples) over VDK-GP. Additionally, MT-VDK-GP outperforms a hyper-parameter based transfer learning approach in over 75 % of N-2 contingency network structures, even without historical N-2 outage data. Furthermore, the proposed method demonstrates the ability to achieve PVEs using sixteen times fewer power flow solutions compared to Monte-Carlo sampling-based methods.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2024

Heuristic solutions to the single depot electric vehicle scheduling problem with next day operability constraints

This study focuses on the single depot electric vehicle scheduling problem (SDEVSP) within the broader context of the vehicle scheduling problem (VSP). By developing an effective scheduling model using mixed-integer linear programming, we generate bus blocks that accommodate electric vehicles (EVs), ensuring successful completion of each block while considering recharging requirements between blocks and during off-hours. Next day operability constraints are also incorporated, allowing for seamless repetition of blocks on subsequent days. The SDEVSP is known to be computationally complex, deriving optimal solutions unattainable for large-scale problems within reasonable timeframes. To address this, we propose a two-step solution approach: first solving the single depot VSP, and then addressing the block chaining problem (BCP) using the blocks generated in the first step. The BCP focuses on optimizing block combinations to facilitate recharging between consecutive blocks, considering operational constraints. Further, a case study conducted reveals that nearly 100% electrification for Chicago, IL and Austin, TX transit buses is viable yet requires 1.6 EVs at 150-mile range per diesel vehicle.

33 ADVANCED PROPULSION SYSTEMS↗