Search NASA⌕ Search

SEARCH · Search NASA

Results for “stochastic methods”

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,063 records · Page 59

A Hybrid Stochastic-Interval Operation Strategy for Multi-Energy Microgrids

Increasing deployment of distributed energy resources intensifies interactions among electric, gas, heating, and cooling systems. Inherent uncertainties ranging from internal parameters to external inputs also impose significant challenges on system operation. A coordinated scheduling method is, therefore, desired for facilitating efficient operation of multi-energy microgrids under multiple uncertainties. In this paper, a deterministic coordinated scheduling model is developed first with detailed modeling of system dynamics and device parameters to fully characterize complex interactions among multi-energy carriers. Then, a hybrid stochastic-interval method is proposed to account for heterogeneous uncertainties in decisions of operational strategies. Specifically, performance and efficiency uncertainties of distributed energy resources, and injection uncertainty of renewable sources and multienergy demands are characterized by interval-based uncertain operation regions and probability distributions, respectively. A scenario-based two-stage algorithm is developed to solve the problem so that multiple uncertainties are preserved in the entire decision-making process. Moreover, adjustable operational strategies are determined to hedge uncertainty by considering operators’ risk preferences. The validity of the proposed method is verified by comprehensive case studies on a test system.

hybrid stochastic-interval approach↗

A feasibility study of dynamic adaptive radiotherapy for nonsmall cell lung cancer

Purpose: The final state of the tumor at the end of a radiotherapy course is dependent on the doses given in each fraction during the treatment course. This study investigates the feasibility of using dynamic adaptive radiotherapy (DART) in treating lung cancers assuming CBCT is available to observe midtreatment tumor states. DART adapts treatment plans using a dynamic programming technique to consider the expected changes of the tumor in the optimization process. Methods: DART is constructed using a stochastic control formalism framework. It minimizes the total expected number of tumor cells at the end of a treatment course, which is equivalent to maximizing tumor control probability, subject to the uncertainty inherent in the tumor response. This formulation allows for nonstationary dose distributions as well as nonstationary fractional doses as needed to achieve a series of optimal plans that are conformal to the tumor over time, i.e., spatiotemporally optimal plans. Sixteen phantom cases with various sizes and locations of tumors and organs-at-risk (OAR) were generated using in-house software. Each case was planned with DART and conventional IMRT prescribing 60 Gy in 30 fractions. The observations of the change in the tumor volume over a treatment course were simulated using a two-level cell population model. Monte Carlo simulations of the treatment course for each case were run to account for uncertainty in the tumor response. The same OAR dose constraints were applied for both methods. The frequency of replanning was varied between 1, 2, 5 (weekly), and 29 times (daily). The final average tumor dose and OAR doses have been compared to quantify the potential dosimetric benefits of DART. Results: The average tumor max, min, mean, and D95 doses using DART relative to these using conventional IMRT were 124.0%–125.2%, 102.1%–114.7%, 113.7%–123.4%, and 102.0%–115.9% (range dependent on the frequency of replanning). The average relative maximum doses for the cord and esophagus, mean doses for the heart and lungs, and D05 for the unspecified tissue resulting 84%–102.4%, 99.8%–106.9%, 66.9%–85.6%, 58.2%–78.8%, and 85.2%–94.0%, respectively. Conclusions: It is feasible to apply DART to the treatment of NSCLC using CBCT to observe the midtreatment tumor state. Potential increases in the tumor dose and reductions in the OAR dose, particularly for parallel OARs with mean or dose–volume constraints, could be achieved using DART compared to nonadaptive IMRT.

60 APPLIED LIFE SCIENCES↗

A hybrid approach to the neutron transport K-eigenvalue problem using NDA-based algorithms

In order to provide more physically accurate solutions to the neutron transport equation it has become increasingly popular to use Monte Carlo simulation to model nuclear reactor dynamics. These Monte Carlo methods can be extremely expensive, so we turn to a class of methods known as hybrid methods, which combine known deterministic and stochastic techniques to solve the transport equation. In our work, we show that we can simulate the action of a transport sweep using a Monte Carlo simulation in order to solve the k-eigenvalue problem. We'll accelerate the solution using nonlinear diffusion acceleration (NDA) as in [1,2]. Our work extends the results in [1] to use Monte Carlo simulation as the high-order solver. (authors)

97 MATHEMATICS AND COMPUTING↗

Kinetics of State Switching in Quasi-One-Dimensional Nanosystems. Statistical Model of the Influence of Defects

The role of native and radiation-induced defects in the state switching kinetics for one-dimensional systems (nanowires, molecular single-chain magnets, biological macromolecules, and many others) has been studied. An analytical approach to the description of the influence of randomly located defects on the dynamics of new-phase domains is developed using an analogy with stochastic processes in queueing theory. This method makes it possible to calculate threshold phenomena and the dependence of switching fields on material parameters.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Weak second-order splitting schemes for Lagrangian Monte Carlo particle methods for the composition PDF/FDF transport equations

We study a class of methods for the numerical solution of the system of stochastic differential equations (SDEs) that arises in the modeling of turbulent combustion, specifically in the Monte Carlo particle method for the solution of the model equations for the composition probability density function (PDF) and the filtered density function (FDF). This system consists of an SDE for particle position and a random differential equation for particle composition. The numerical methods considered advance the solution in time with (weak) second-order accuracy with respect to the time step size. The four primary contributions of the paper are: (i) establishing that the coefficients in the particle equations can be frozen at the mid-time (while preserving second-order accuracy), (ii) examining the performance of three existing schemes for integrating the SDEs, (iii) developing and evaluating different splitting schemes (which treat particle motion, reaction and mixing on different sub-steps), and (iv) developing the method of manufactured solutions (MMS) to assess the convergence of Monte Carlo particle methods. Tests using MMS confirm the second-order accuracy of the schemes. In general, the use of frozen coefficients reduces the numerical errors. Otherwise no significant differences are observed in the performance of the different SDE schemes and splitting schemes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Disease mapping based on stochastic SIR-SI model for Dengue and Chikungunya in Malaysia

This paper describes and demonstrates a method for relative risk estimation which is based on the stochastic SIR-SI vector-borne infectious disease transmission model specifically for Dengue and Chikungunya diseases in Malaysia. Firstly, the common compartmental model for vector-borne infectious disease transmission called the SIR-SI model (susceptible-infective-recovered for human populations; susceptible-infective for vector populations) is presented. This is followed by the explanations on the stochastic SIR-SI model which involve the Bayesian description. This stochastic model then is used in the relative risk formulation in order to obtain the posterior relative risk estimation. Then, this relative estimation model is demonstrated using Dengue and Chikungunya data of Malaysia. The viruses of these diseases are transmitted by the same type of female vector mosquito named Aedes Aegypti and Aedes Albopictus. Finally, the findings of the analysis of relative risk estimation for both Dengue and Chikungunya diseases are presented, compared and displayed in graphs and maps. The distribution from risk maps show the high and low risk area of Dengue and Chikungunya diseases occurrence. This map can be used as a tool for the prevention and control strategies for both diseases.

60 APPLIED LIFE SCIENCES↗

Inferring HIV Escape Rates from Multi-Locus Genotype Data

Cytotoxic T-lymphocytes (CTLs) recognize viral protein fragments displayed by major histocompatibility complex molecules on the surface of virally infected cells and generate an anti-viral response that can kill the infected cells. Virus variants whose protein fragments are not efficiently presented on infected cells or whose fragments are presented but not recognized by CTLs therefore have a competitive advantage and spread rapidly through the population. We present a method that allows a more robust estimation of these escape rates from serially sampled sequence data. The proposed method accounts for competition between multiple escapes by explicitly modeling the accumulation of escape mutations and the stochastic effects of rare multiple mutants. Applying our method to serially sampled HIV sequence data, we estimate rates of HIV escape that are substantially larger than those previously reported. The method can be extended to complex escapes that require compensatory mutations. We expect our method to be applicable in other contexts such as cancer evolution where time series data is also available.

60 APPLIED LIFE SCIENCES↗

Underlying Fundamentals of Kalman Filtering for River Network Modeling

The grand challenge of producing hydrometeorological estimates every time and everywhere has motivated the fusion of sparse observations with dense numerical models, with a particular interest on discharge in river modeling. Ensemble methods are largely preferred as they enable the estimation of error properties, but at the expense of computational load and generally with underestimations. These imperfect stochastic estimates motivate the use of correction methods, that is, error localization and inflation, although the physical justifications for their optimality are limited. The purpose of this study is to use one of the simplest forms of data assimilation when applied to river modeling and reveal the underlying mechanisms impacting its performance. Our framework based on assimilating daily averaged in situ discharge measurements to correct daily averaged runoff was tested over a 4-yr case study of two rivers in Texas. Results show that under optimal conditions of inflation and localization, discharge simulations are consistently improved such that the mean values of Nash–Sutcliffe efficiency are enhanced from211.32 to 0.55 at observed gauges and from212.24 to21.10 at validation gauges. Yet, parameters controlling the inflation and the localization have a large impact on the performance. Further investigations of these sensitivities showed that optimal inflation occurs when compensating exactly for discrepancies in the magnitude of errors while optimal localization matches the distance traveled during one assimilation window. These results may be applicable to more advanced data assimilation methods as well as for larger applications motivated by upcoming river-observing satellite missions, such as NASA’s Surface Water and Ocean Topography mission.

Streamflow↗

Efficient Generalizable Deep Learning

Stochastic optimization is a fundamental field of research for machine learning. Stochastic gradient descent (SGD) and related methods provide a feasible means to train complicated prediction models over large datasets. SGD, however, does not explicitly address the problem of overfitting, which can lead to predictions that perform poorly on new data. This difference between loss performance on unseen testing data verses that of training data defines the generalization gap of a model. We introduce a new computational kernel called Stochastic Hessian Projection (SHP) that uses a maximum likelihood framework to simultaneously estimate gradient noise covariance and local curvature of the loss function. Our analysis illustrates that these quantities affect the evolution of parameter uncertainty and therefore generalizability. We show how these computations allow us to predict the generalization gap without requiring holdout data. Explicitly assessing this metric for generalizability during training may improve machine learning predictions when data is scarce and understanding prediction variability is critical.

42 ENGINEERING↗

Stochastic responses of Van der Pol vibro-impact system with fractional derivative damping excited by Gaussian white noise

This paper focuses on the study of the stochastic Van der Pol vibro-impact system with fractional derivative damping under Gaussian white noise excitation. The equations of the original system are simplified by non-smooth transformation. For the simplified equation, the stochastic averaging approach is applied to solve it. Then, the fractional derivative damping term is facilitated by a numerical scheme, therewith the fourth-order Runge-Kutta method is used to obtain the numerical results. And the numerical simulation results fit the analytical solutions. Therefore, the proposed analytical means to study this system are proved to be feasible. In this context, the effects on the response stationary probability density functions (PDFs) caused by noise excitation, restitution condition, and fractional derivative damping are considered, in addition the stochastic P-bifurcation is also explored in this paper through varying the value of the coefficient of fractional derivative damping and the restitution coefficient. These system parameters not only influence the response PDFs of this system but also can cause the stochastic P-bifurcation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Whitepaper on Uncertainty Quantification for MPACT

The MPACT code provides the ability to perform high-fidelity deterministic calculations to obtain a wide variety of detailed results for very complex reactor core models. However, MPACT currently does not have the capability to propagate the effects of input data uncertainties to provide uncertainties in the calculated results. This white paper discusses a potential method for MPACT uncertainty quantification (UQ) based on stochastic sampling.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Random Process Simulation for stochastic fatigue analysis

A simulation technique is described which directly synthesizes the extrema of a random process and is more efficient than the Gaussian simulation method. Such a technique is particularly useful in stochastic fatigue analysis because the required stress range moment E(R sup m), is a function only of the extrema of the random stress process. The family of autoregressive moving average (ARMA) models is reviewed and an autoregressive model is presented for modeling the extrema of any random process which has a unimodal power spectral density (psd). The proposed autoregressive technique is found to produce rainflow stress range moments which compare favorably with those computed by the Gaussian technique and to average 11.7 times faster than the Gaussian technique. The autoregressive technique is also adapted for processes having bimodal psd's. The adaptation involves using two autoregressive processes to simulate the extrema due to each mode and the superposition of these two extrema sequences. The proposed autoregressive superposition technique is 9 to 13 times faster than the Gaussian technique and produces comparable values for E(R sup m) for bimodal psd's having the frequency of one mode at least 2.5 times that of the other mode.

Larsen, Curtis E.↗

Gradient-based Optimization for Regression in the Functional Tensor-Train Format

We consider the task of low-multilinear-rank functional regression, i.e., learning a low-rank parametric representation of functions from scattered real-valued data. Our first contribution is the development and analysis of gradient-based optimization procedures, including stochastic gradient descent and quasi-Newton methods, for learning the parameters of a functional tensor-train (FT) that yields improved accuracy over standard alternating least squares methods. The functional tensor-train uses the tensor-train (TT) representation of low-rank arrays as an ansatz for a class of low-multilinear-rank functions. The FT is represented by a set of matrix-valued functions that contain a set of univariate functions, and the regression task is to learn the parameters of these univariate functions. Our second contribution demonstrates that using nonlinearly parameterized univariate functions, e.g., symmetric kernels with moving centers, within each core can outperform the standard approach of using a linear expansion of basis functions. Our final contributions are new rank adaptation and group-sparsity regularization procedures to minimize overfitting. We use several benchmark problems to demonstrate at least an order of magnitude lower accuracy with gradient-based optimization methods than ALS in the low-sample number regime. We also demonstrate an order of magnitude reduction in accuracy on a test problem resulting from nonlinear parameterizations over linear parameterizations. Finally we compare regression performance with 22 other nonparametric and parametric regression methods on 10 real-world data sets. We achieve top-five accuracy for seven of the data sets and best accuracy for two of the data sets. These rankings are the best amongst parametric models and competetive with the best non-parametric methods.

97 MATHEMATICS AND COMPUTING↗

Discontinuity detection in multivariate space for stochastic simulations

Edge detection has traditionally been associated with detecting physical space jump discontinuities in one dimension, e.g. seismic signals, and two dimensions, e.g. digital images. Hence most of the research on edge detection algorithms is restricted to these contexts. High dimension edge detection can be of significant importance, however. For instance, stochastic variants of classical differential equations not only have variables in space/time dimensions, but additional dimensions are often introduced to the problem by the nature of the random inputs. The stochastic solutions to such problems sometimes contain discontinuities in the corresponding random space and a prior knowledge of jump locations can be very helpful in increasing the accuracy of the final solution. Traditional edge detection methods typically require uniform grid point distribution. They also often involve the computation of gradients and/or Laplacians, which can become very complicated to compute as the number of dimensions increases. The polynomial annihilation edge detection method, on the other hand, is more flexible in terms of its geometric specifications and is furthermore relatively easy to apply. This paper discusses the numerical implementation of the polynomial annihilation edge detection method to high dimensional functions that arise when solving stochastic partial differential equations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Large Deviations for Stochastic Tamed 3D Navier-Stokes Equations

In this paper, using weak convergence method, we prove a large deviation principle of Freidlin-Wentzell type for the stochastic tamed 3D Navier-Stokes equations driven by multiplicative noise, which was investigated in (Roeckner and Zhang in Probab. Theory Relat. Fields 145(1-2), 211-267, 2009).

97 MATHEMATICS AND COMPUTING↗

Efficient calibration for imperfect computer models

Many computer models contain unknown parameters which need to be estimated using physical observations. Furthermore, the calibration method based on Gaussian process models may lead to unreasonable estimate for imperfect computer models. In this work, we extend their study to calibration problems with stochastic physical data. We propose a novel method, called the L 2 calibration, and show its semiparametric efficiency. The conventional method of the ordinary least squares is also studied. Theoretical analysis shows that it is consistent but not efficient. Here, numerical examples show that the proposed method outperforms the existing ones.

97 MATHEMATICS AND COMPUTING↗

Stochastic Inversion of Gaussian Random Media Using Transverse Coherence Functions for Reflected Waves: Theory and Method

The transverse coherence functions (TCFs) of phase and amplitude fluctuations of a seismic wave are powerful to estimate the spatial distribution, length scales, and strength of random heterogeneities. However, TCFs have been formulated for transmitted waves only, not for reflected waves. In this paper, we derive reflection TCFs for Gaussian random media. Furthermore, we propose to invert for Gaussian random media using the reflection TCFs based on the grid search. We validate the new reflection TCF formulas using 2D finite-difference numerical experiments. The numerical example also illustrates the feasibility and efficiency of the inversion. The stochastic inversion using reflected waves can be used in both exploration and global seismology.

58 GEOSCIENCES↗

An Improved Discrete Least-Squares/Reduced-Basis Method for Parameterized Elliptic PDEs

It is shown that the computational efficiency of the discrete least-squares (DLS) approximation of solutions of stochastic elliptic PDEs is improved by incorporating a reduced-basis method into the DLS framework. In particular, we consider stochastic elliptic PDEs with an affine dependence on the random variable. The goal is to recover the entire solution map from the parameter space to the finite element space. To this end, first, a reduced-basis solution using a weak greedy algorithm is constructed, then a DLS approximation is determined by evaluating the reduced-basis approximation instead of the full finite element approximation. The main advantage of the new approach is that one only need apply the DLS operator to the coefficients of the reduced-basis expansion, resulting in huge savings in both the storage of the DLS coefficients and the online cost of evaluating the DLS approximation. In addition, the recently developed quasi-optimal polynomial space is also adopted in the new approach, resulting in superior convergence rates for a wider class of problems than previous analyzed. Numerical experiments are provided that illustrate the theoretical results.

97 MATHEMATICS AND COMPUTING↗