Search NASA⌕ Search

SEARCH · Search NASA

Results for “sequential updates”

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 19 records

A rigorous sequential update strategy for parallel kinetic Monte Carlo simulation

The kinetic Monte Carlo (kMC) method is used in many scientific fields in applications involving rare-event transitions. Due to its discrete stochastic nature, efforts to parallelize kMC approaches often produce unbalanced time evolutions requiring complex implementations to ensure correct statistics. In the context of parallel kMC, the sequential update technique has shown promise by generating high quality distributions with high relative efficiencies for short-range systems. In this work, we provide an extension of the sequential update method in a parallel context that rigorously obeys detailed balance, which guarantees exact equilibrium statistics for all parallelization settings. Furthermore, our approach also preserves nonequilibrium dynamics with minimal error for many parallelization settings, and can be used to achieve highly precise sampling.

36 MATERIALS SCIENCE↗

A sequential Attacker-Defender game for distribution systems resilience enhancement against extreme weather events

Improving distribution system resilience against frequent extreme weather events is important for reliable power system operations. Especially when dealing with events such as hurricanes that have short-term predictions, proactive pre-event preparedness plays a vital role in system resilience performance. In this paper, we propose a novel approach to construct pre-event resource allocation plans for system operators to cope with upcoming threats through a sequential attacker-defender game framework. The sequential attacker-defender game is designed to model the interaction between the extreme weather and the system operator. In each round of the game, the attacker and the defender sequentially update their current strategies by accounting for the opponent’s action set. The attacker model is formulated as a bi-level problem to identify the severe outage scenarios, and the defender model is formulated as a two-stage optimization problem to determine the allocation of restoration resources including mobile responsive resources and repair crews. Two scale-reduction strategies are proposed to ensure the scalability of the game scheme. Finally, case studies on the IEEE 33-bus and a 7149-node practical utility system validate the effectiveness of the proposed sequential game and the efficiency of the scale-reduction strategies.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Sequentially calibrating a Bayesian microsimulation model to incorporate new information and assumptions

Background: Microsimulation models are mathematical models that simulate event histories for individual members of a population. They are useful for policy decisions because they simulate a large number of individuals from an idealized population, with features that change over time, and the resulting event histories can be summarized to describe key population-level outcomes. Model calibration is the process of incorporating evidence into the model. Calibrated models can be used to make predictions about population trends in disease outcomes and effectiveness of interventions, but calibration can be challenging and computationally expensive. Methods: This paper develops a technique for sequentially updating models to take full advantage of earlier calibration results, to ultimately speed up the calibration process. A Bayesian approach to calibration is used because it combines different sources of evidence and enables uncertainty quantification which is appealing for decision-making. We develop this method in order to re-calibrate a microsimulation model for the natural history of colorectal cancer to include new targets that better inform the time from initiation of preclinical cancer to presentation with clinical cancer (sojourn time), because model exploration and validation revealed that more information was needed on sojourn time, and that the predicted percentage of patients with cancers detected via colonoscopy screening was too low. Results: The sequential approach to calibration was more efficient than recalibrating the model from scratch. Incorporating new information on the percentage of patients with cancers detected upon screening changed the estimated sojourn time parameters significantly, increasing the estimated mean sojourn time for cancers in the colon and rectum, providing results with more validity. Conclusions: A sequential approach to recalibration can be used to efficiently recalibrate a microsimulation model when new information becomes available that requires the original targets to be supplemented with additional targets.

60 APPLIED LIFE SCIENCES↗

An intermediate-scale model for thermal hydrology in low-relief permafrost-affected landscapes

Integrated surface/subsurface models for simulating the thermal hydrology of permafrost-affected regions in a warming climate have recently become available, but computational demands of those new process-rich simu- lation tools have thus far limited their applications to one-dimensional or small two-dimensional simulations. We present a mixed-dimensional model structure for efficiently simulating surface/subsurface thermal hydrology in low-relief permafrost regions at watershed scales. The approach replaces a full three-dimensional system with a two-dimensional overland thermal hydrology system and a family of one-dimensional vertical columns, where each column represents a fully coupled surface/subsurface thermal hydrology system without lateral flow. The system is then operator split, sequentially updating the overland flow system without sources and the one-dimensional columns without lateral flows. We show that the app- roach is highly scalable, supports subcycling of different processes, and compares well with the corresponding fully three-dimensional representation at significantly less computational cost. Those advances enable recently developed representations of freezing soil physics to be coupled with thermal overland flow and surface energy balance at scales of 100s of meters. Furthermore developed and demonstrated for permafrost thermal hydrology, the mixed-dimensional model structure is applicable to integrated surface/subsurface thermal hydrology in general.

54 ENVIRONMENTAL SCIENCES↗

Physics-informed State-space Neural Networks for transport phenomena

This work introduces Physics -informed State -space neural network Models (PSMs), a novel solution to achieving real-time optimization, flexibility, and fault tolerance in autonomous systems, particularly in transportdominated systems such as chemical, biomedical, and power plants. Traditional data -driven methods fall short due to a lack of physical constraints like mass conservation; PSMs address this issue by training deep neural networks with sensor data and physics -informing using components' Partial Differential Equations (PDEs), resulting in a physics -constrained, end -to -end differentiable forward dynamics model. Further, through two in silico experiments - a heated channel and a cooling system loop - we demonstrate that PSMs offer a more accurate approach than a purely data -driven model. In the former experiment, PSMs demonstrated significantly lower average root -mean -square errors across test datasets compared to a purely data -driven neural network, with reductions of 44 %, 48 %, and 94 % in predicting pressure, velocity, and temperature, respectively. Beyond accuracy, PSMs demonstrate a compelling multitask capability, making them highly versatile. In this work, we showcase two: supervisory control of a nonlinear system through a sequentially updated state -space representation and the proposal of a diagnostic algorithm using residuals from each of the PDEs. The former demonstrates PSMs' ability to handle constant and time -dependent constraints, while the latter illustrates their value in system diagnostics and fault detection.

42 ENGINEERING↗

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↗

An adaptive Hessian approximated stochastic gradient MCMC method

Bayesian approaches have been successfully integrated into training deep neural networks. One popular family is stochastic gradient Markov chain Monte Carlo methods (SG-MCMC), which have gained increasing interest due to their ability to handle large datasets and the potential to avoid overfitting. Although standard SG-MCMC methods have shown great performance in a variety of problems, they may be inefficient when the random variables in the target posterior densities have scale differences or are highly correlated. Here, we present an adaptive Hessian approximated stochastic gradient MCMC method to incorporate local geometric information while sampling from the posterior. The idea is to apply stochastic approximation (SA) to sequentially update a preconditioning matrix at each iteration. The preconditioner possesses second-order information and can guide the random walk of a sampler efficiently. Instead of computing and saving the full Hessian of the log posterior, we use limited memory of the samples and their stochastic gradients to approximate the inverse Hessian-vector multiplication in the updating formula. Moreover, by smoothly optimizing the preconditioning matrix via SA, our proposed algorithm can asymptotically converge to the target distribution with a controllable bias under mild conditions. To reduce the training and testing computational burden, we adopt a magnitude-based weight pruning method to enforce the sparsity of the network. Our method is user-friendly and demonstrates better learning results compared to standard SG-MCMC updating rules. The approximation of inverse Hessian alleviates storage and computational complexities for large dimensional models. Numerical experiments are performed on several problems, including sampling from 2D correlated distribution, synthetic regression problems, and learning the numerical solutions of heterogeneous elliptic PDE. The numerical results demonstrate great improvement in both the convergence rate and accuracy.

97 MATHEMATICS AND COMPUTING↗

ICON-A, the Atmosphere Component of the ICON Earth System Model: I. Model Description

ICON–A is the new icosahedral nonhydrostatic (ICON) atmospheric general circulation model in a configuration using the Max Planck Institute physics package, which originates from the ECHAM6 general circulation model, and has been adapted to account for the changed dynamical core framework. The coupling scheme between dynamics and physics employs a sequential updating by dynamics and physics, and a fixed sequence of the physical processes similar to ECHAM6. To allow a meaningful initial comparison between ICON–A and the established ECHAM6–LR model, a setup with similar, low resolution in terms of number of grid points and levels is chosen. The ICON–A model is tuned on the base of the Atmospheric Model Intercomparison Project (AMIP) experiment aiming primarily at a well balanced top–of atmosphere energy budget to make the model suitable for coupled climate and Earth system modeling. The tuning addresses first the moisture and cloud distribution to achieve the top–of–atmosphere energy balance, followed by the tuning of the parameterized dynamic drag aiming at reduced wind errors in the troposphere. The resulting version of ICON–A has overall biases, which are comparable to those of ECHAM6. Problematic specific biases remain in the vertical distribution of clouds and in the stratospheric circulation, where the winter vortices are too weak. Biases in precipitable water and tropospheric temperature are, however, reduced compared to the ECHAM6. As a result, ICON–A will serve as the basis of further development and as the atmosphere component to the coupled model, ICON–Earth system model (ESM).

54 ENVIRONMENTAL SCIENCES↗

Galerkin Neural Networks: A Framework for Approximating Variational Equations with Error Control

Herein, we present a new approach to using neural networks to approximate the solutions of variational equations, based on the adaptive construction of a sequence of finite-dimensional sub-spaces whose basis functions are realizations of a sequence of neural networks. Here, the finite-dimensional subspaces are then used to define a standard Galerkin approximation of the variational equation. This approach enjoys a number of advantages, including: the sequential nature of the algorithm offers a systematic approach to enhancing the accuracy of a given approximation; the sequential enhancements provide a useful indicator for the error that can be used as a criterion for terminating the sequential updates; the basic approach is largely oblivious to the nature of the partial differential equation under consideration; and, some basic theoretical results are presented regarding the convergence (or otherwise) of the method which are used to formulate basic guidelines for applying the method.

97 MATHEMATICS AND COMPUTING↗

Parameter estimation by implicit sampling

© 2015 Mathematical Sciences Publishers. Implicit sampling is a weighted sampling method that is used in data assimilation to sequentially update state estimates of a stochastic model based on noisy and incomplete data. Here we apply implicit sampling to sample the posterior probability density of parameter estimation problems. The posterior probability combines prior information about the parameter with information from a numerical model, e.g., a partial differential equation (PDE), and noisy data. The result of our computations are parameters that lead to simulations that are compatible with the data. We demonstrate the usefulness of our implicit sampling algorithm with an example from subsurface flow. For an efficient implementation, we make use of multiple grids, BFGS optimization coupled to adjoint equations, and Karhunen-Loève expansions for dimensional reduction. Several difficulties of Markov chain Monte Carlo methods, e.g., estimation of burn-in times or correlations among the samples, are avoided because the implicit samples are independent.

Morzfeld, Matthias↗

Sequential estimation and satellite data assimilation in meteorology and oceanography

The role of dynamics in estimating the state of the atmosphere and ocean from incomplete and noisy data is discussed and the classical applications of four-dimensional data assimilation to large-scale atmospheric dynamics are presented. It is concluded that sequential updating of a forecast model with continuously incoming conventional and remote-sensing data is the most natural way of extracting the maximum amount of information from the imperfectly known dynamics, on the one hand, and the inaccurate and incomplete observations, on the other.

Ghil, M.↗

A Framework to Debug Diagnostic Matrices

Diagnostics is an important concept in system health and monitoring of space operations. Many of the existing diagnostic algorithms utilize system knowledge in the form of diagnostic matrix (D-matrix, also popularly known as diagnostic dictionary, fault signature matrix or reachability matrix) gleaned from physical models. But, sometimes, this may not be coherent to obtain high diagnostic performance. In such a case, it is important to modify this D-matrix based on knowledge obtained from other sources such as time-series data stream (simulated or maintenance data) within the context of a framework that includes the diagnostic/inference algorithm. A systematic and sequential update procedure, diagnostic modeling evaluator (DME) is proposed to modify D-matrix and wrapper logic considering least expensive solution first. This iterative procedure includes conditions ranging from modifying 0s and 1s in the matrix, or adding/removing the rows (failure sources) columns (tests). We will experiment this framework on datasets from DX challenge 2009.

Model-based↗

Comparison of EKF and UKF for Robotic Missions to Mars

The batched Kalman lter works well for a wide variety of orbit determination scenarios but requires linearized approximations to the underlying dynamical system. Furthermore, implementation depends on the computation of partial derivatives for all measurements and parameters used in the lter, a non-trivial task even when analytical derivations are possible. To address these limitations, many extensions and modi - cations to the linear Kalman lter have been proposed over the years since Kalman's initial publication. Our investigation examines two popular variants of the Kalman lter, namely the Extended Kalman Filter (EKF) and Unscented Kalman Filter (UKF), within the context of spacecraft missions to Mars. The EKF relies on the same mathematical basis as the classic version of the lter, however it sequentially updates the linearization as the ltering process is conducted. In contrast, the UKF is built upon the unscented transform which samples the nearby solution space and numerically propagates perturbed trajectories as part of the update / estimation process. We assess the performance of the ltering algorithms under a variety of mission scenarios with the goal of establishing decision criteria for which implementation to use under di ering circumstances.

Ely, Todd↗

Update on Bayesian Blocks: Segmented Models for Sequential Data

The Bayesian Block algorithm, in wide use in astronomy and other areas, has been improved in several ways. The model for block shape has been generalized to include other than constant signal rate - e.g., linear, exponential, or other parametric models. In addition the computational efficiency has been improved, so that instead of O(N**2) the basic algorithm is O(N) in most cases. Other improvements in the theory and application of segmented representations will be described.

Scargle, Jeff↗

AIF for Vis (Active Inference for simulating human interpretation of data visualization) [SWR-26-084]

AIF for Vis contains the Active Inference models and analysis scripts used to study a simple visualization-interpretation task: estimating the average value of two bars in a bar chart. The work is a proof of concept for translating hypothesized cognitive strategies into executable, inspectable process models. We implement two idealized strategies inspired by dual-process accounts of visualization-aided decision making: *Fast model: a compressed, heuristic strategy that estimates the visual midpoint of the two bars and maintains a single belief over their average. *Slow model: a sequential, analytic strategy that estimates the two bar heights separately and maintains them in working memory before computing an average. Both models use a common Active-Inference-inspired framework for sequential perception, belief updating, action selection, and reporting. Their different internal representations produce distinct predicted vulnerabilities: *the Fast model is more susceptible to tick-salience bias; *the Slow model is more susceptible to working-memory decay. The repository includes the model implementations, scripts used for the experiments reported in the paper, precomputed trial-level results, and plotting scripts.

Goldwyn, Harrison [National Laboratory of the Rock↗

Multiplexed Predictive Control of a Large Commercial Turbofan Engine

Model predictive control is a strategy well-suited to handle the highly complex, nonlinear, uncertain, and constrained dynamics involved in aircraft engine control problems. However, it has thus far been infeasible to implement model predictive control in engine control applications, because of the combination of model complexity and the time allotted for the control update calculation. In this paper, a multiplexed implementation is proposed that dramatically reduces the computational burden of the quadratic programming optimization that must be solved online as part of the model-predictive-control algorithm. Actuator updates are calculated sequentially and cyclically in a multiplexed implementation, as opposed to the simultaneous optimization taking place in conventional model predictive control. Theoretical aspects are discussed based on a nominal model, and actual computational savings are demonstrated using a realistic commercial engine model.

Richter, hanz↗