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 775 records · Page 43

Stochastic Predictions of Cell Kill During Stereotactic Ablative Radiation Therapy: Do Hypoxia and Reoxygenation Really Matter?

Purpose: To simulate stereotactic ablative radiation therapy on hypoxic and well-oxygenated in silico tumors, incorporating probabilistic parameter distributions and linear-quadratic versus linear-quadratic-cubic methodology and the evaluation of optimal fractionation schemes using biological effective dose (BED{sub α/β=10} {sub or} {sub 3}) comparisons. Methods and Materials: A temporal tumor growth and radiation therapy algorithm simulated high-dose external beam radiation therapy using stochastic methods. Realistic biological proliferative cellular hierarchy and pO{sub 2} histograms were incorporated into the 10{sup 8}-cell tumor model, with randomized radiation therapy applied during continual cell proliferation and volume-based gradual tumor reoxygenation. Dose fractions ranged from 6-35 Gy, with predictive outcomes presented in terms of the total doses (converted to BED) required to eliminate all cells that could potentially regenerate the tumor. Results: Well-oxygenated tumor control BED{sub 10} outcomes were not significantly different for high-dose versus conventional radiation therapy (BED{sub 10}: 79-84 Gy; Equivalent Dose in 2 Gy fractions with α/β of 10: 66-70 Gy); however, total treatment times decreased from 7 down to 1-3 weeks. For hypoxic tumors, an additional 28 Gy (51 Gy BED{sub 10}) was required, with BED{sub 10} increasing with dose per fraction due to wasted dose in the final fraction. Fractions of 9 Gy compromised well for total treatment time and BED, with BED{sub 10}:BED{sub 3} of 84:176 Gy for oxic and 132:278 Gy for non-reoxygenating hypoxic tumors. Initial doses of 12 Gy followed by 6 Gy further increased the therapeutic ratio. When delivering ≥9 Gy per fraction, applying reoxygenation and/or linear-quadratic-cubic cell survival both affected tumor control doses by a significant 1-2 fractions. Conclusions: The complex temporal dynamics of tumor oxygenation combined with probabilistic cell kinetics in the modeling of radiation therapy requires sophisticated stochastic modeling to predict tumor cell kill. For stereotactic ablative radiation therapy, high doses in the first week followed by doses that are more moderate may be beneficial because a high percentage of hypoxic cells could be eradicated early while keeping the required BED{sub 10} relatively low and BED{sub 3} toxicity to tolerable levels.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Coarse-grained methods for heterogeneous vesicles with phase-separated domains: Elastic mechanics of shape fluctuations, plate compression, and channel insertion

We develop coarse-grained particle approaches for studying the elastic mechanics of vesicles with heterogeneous membranes having phase-separated domains. We perform simulations both of passive shape fluctuations and of active systems where vesicles are subjected to compression between two plates or subjected to insertion into narrow channels. Analysis methods are developed for mapping particle configurations to continuum fields with spherical harmonics representations. Heterogeneous vesicles are found to exhibit rich behaviors where the heterogeneity can amplify surface two-point correlations, reduce resistance during compression, and augment vesicle transport times in channels. The developed methods provide general approaches for characterizing the mechanics of coarse-grained heterogeneous systems taking into account the roles of thermal fluctuations, geometry, and phase separation.

97 MATHEMATICS AND COMPUTING↗

A First-Passage Kinetic Monte Carlo method for reaction–drift–diffusion processes

Stochastic reaction–diffusion models are now a popular tool for studying physical systems in which both the explicit diffusion of molecules and noise in the chemical reaction process play important roles. The Smoluchowski diffusion-limited reaction model (SDLR) is one of several that have been used to study biological systems. Exact realizations of the underlying stochastic processes described by the SDLR model can be generated by the recently proposed First-Passage Kinetic Monte Carlo (FPKMC) method. This exactness relies on sampling analytical solutions to one and two-body diffusion equations in simplified protective domains. In this work we extend the FPKMC to allow for drift arising from fixed, background potentials. As the corresponding Fokker–Planck equations that describe the motion of each molecule can no longer be solved analytically, we develop a hybrid method that discretizes the protective domains. The discretization is chosen so that the drift–diffusion of each molecule within its protective domain is approximated by a continuous-time random walk on a lattice. New lattices are defined dynamically as the protective domains are updated, hence we will refer to our method as Dynamic Lattice FPKMC or DL-FPKMC. We focus primarily on the one-dimensional case in this manuscript, and demonstrate the numerical convergence and accuracy of our method in this case for both smooth and discontinuous potentials. We also present applications of our method, which illustrate the impact of drift on reaction kinetics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Communication: Embedded fragment stochastic density functional theory

We develop a method in which the electronic densities of small fragments determined by Kohn-Sham density functional theory (DFT) are embedded using stochastic DFT to form the exact density of the full system. The new method preserves the scaling and the simplicity of the stochastic DFT but cures the slow convergence that occurs when weakly coupled subsystems are treated. It overcomes the spurious charge fluctuations that impair the applications of the original stochastic DFT approach. We demonstrate the new approach on a fullerene dimer and on clusters of water molecules and show that the density of states and the total energy can be accurately described with a relatively small number of stochastic orbitals.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A Simple Stochastic Model for Generating Broken Cloud Optical Depth and Top Height Fields

A simple and fast algorithm for generating two correlated stochastic twodimensional (2D) cloud fields is described. The algorithm is illustrated with two broken cumulus cloud fields: cloud optical depth and cloud top height retrieved from Moderate Resolution Imaging Spectrometer (MODIS). Only two 2D fields are required as an input. The algorithm output is statistical realizations of these two fields with approximately the same correlation and joint distribution functions as the original ones. The major assumption of the algorithm is statistical isotropy of the fields. In contrast to fractals and the Fourier filtering methods frequently used for stochastic cloud modeling, the proposed method is based on spectral models of homogeneous random fields. For keeping the same probability density function as the (first) original field, the method of inverse distribution function is used. When the spatial distribution of the first field has been generated, a realization of the correlated second field is simulated using a conditional distribution matrix. This paper is served as a theoretical justification to the publicly available software that has been recently released by the authors and can be freely downloaded from http://i3rc.gsfc.nasa.gov/Public codes clouds.htm. Though 2D rather than full 3D, stochastic realizations of two correlated cloud fields that mimic statistics of given fields have proved to be very useful to study 3D radiative transfer features of broken cumulus clouds for better understanding of shortwave radiation and interpretation of the remote sensing retrievals.

Prigarin, Sergei M.↗

Generalized covariance analysis for partially autonomous deep space missions

A new covariance analysis method is presented that is suitable for the evaluation of multiple impulsive controllers acting on some stochastic process x. The method accommodates batch and sequential estimators with equal ease and accounts for time-delay effects in a natural manner. The formalism is developed in terms of a generalized state vector that is formed from the system state vector x, augmented by various fixed epoch estimates, and a data vector formed from discrete time observations of the system. Recursions are developed for time transition, measurement incorporation, and impulsive control updating of the generalized covariance matrix. Means of limiting the dimensional growth of the generalized state vector via the processes of estimator epoch adjustment and measurement vector deflation are described and the application of numerically stable matrix factorization methods to the generalized covariance recursions is outlined. The method is applied to the Magellan spacecraft to demonstrate the capability of ground-based optimal estimation and control of gyro/star scanner misalignment.

Boone, Jack N.↗

Stochastic search in structural optimization - Genetic algorithms and simulated annealing

An account is given of illustrative applications of genetic algorithms and simulated annealing methods in structural optimization. The advantages of such stochastic search methods over traditional mathematical programming strategies are emphasized; it is noted that these methods offer a significantly higher probability of locating the global optimum in a multimodal design space. Both genetic-search and simulated annealing can be effectively used in problems with a mix of continuous, discrete, and integer design variables.

Hajela, Prabhat↗

Identification of linear stochastic systems through projection filters

A novel method is presented for identifying a state-space model and a state estimator for linear stochastic systems from input and output data. The method is primarily based on the relationship between the state-space model and the finite-difference model of linear stochastic systems derived through projection filters. It is proved that least-squares identification of a finite difference model converges to the model derived from the projection filters. System pulse response samples are computed from the coefficients of the finite difference model.

Chen, Chung-Wen↗

Path-space variational inference for non-equilibrium coarse-grained systems

In this paper we discuss information-theoretic tools for obtaining optimized coarse-grained molecular models for both equilibrium and non-equilibrium molecular simulations. The latter are ubiquitous in physicochemical and biological applications, where they are typically associated with coupling mechanisms, multi-physics and/or boundary conditions. In general the non-equilibrium steady states are not known explicitly as they do not necessarily have a Gibbs structure. The presented approach can compare microscopic behavior of molecular systems to parametric and non-parametric coarse-grained models using the relative entropy between distributions on the path space and setting up a corresponding path-space variational inference problem. The methods can become entirely data-driven when the microscopic dynamics are replaced with corresponding correlated data in the form of time series. Furthermore, we present connections and generalizations of force matching methods in coarse-graining with path-space information methods. We demonstrate the enhanced transferability of information-based parameterizations to different observables, at a specific thermodynamic point, due to information inequalities. We discuss methodological connections between information-based coarse-graining of molecular systems and variational inference methods primarily developed in the machine learning community. However, we note that the work presented here addresses variational inference for correlated time series due to the focus on dynamics. The applicability of the proposed methods is demonstrated on high-dimensional stochastic processes given by overdamped and driven Langevin dynamics of interacting particles.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Comparison of different moment-closure approximations for stochastic chemical kinetics

In recent years, moment-closure approximations (MAs) of the chemical master equation have become a popular method for the study of stochastic effects in chemical reaction systems. Several different MA methods have been proposed and applied in the literature, but it remains unclear how they perform with respect to each other. In this paper, we study the normal, Poisson, log-normal, and central-moment-neglect MAs by applying them to understand the stochastic properties of chemical systems whose deterministic rate equations show the properties of bistability, ultrasensitivity, and oscillatory behaviour. Our results suggest that the normal MA is favourable over the other studied MAs. In particular, we found that (i) the size of the region of parameter space where a closure gives physically meaningful results, e.g., positive mean and variance, is considerably larger for the normal closure than for the other three closures, (ii) the accuracy of the predictions of the four closures (relative to simulations using the stochastic simulation algorithm) is comparable in those regions of parameter space where all closures give physically meaningful results, and (iii) the Poisson and log-normal MAs are not uniquely defined for systems involving conservation laws in molecule numbers. We also describe the new software package MOCA which enables the automated numerical analysis of various MA methods in a graphical user interface and which was used to perform the comparative analysis presented in this paper. MOCA allows the user to develop novel closure methods and can treat polynomial, non-polynomial, as well as time-dependent propensity functions, thus being applicable to virtually any chemical reaction system.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Integration of progressive hedging and dual decomposition in stochastic integer programs

We present a method for integrating the Progressive Hedging (PH) algorithm and the Dual Decomposition (DD) algorithm of Carøe and Schultz for stochastic mixed-integer programs. Based on the correspondence between lower bounds obtained with PH and DD, a method to transform weights from PH to Lagrange multipliers in DD is found. Fast progress in early iterations of PH speeds up convergence of DD to an exact solution. As a result, we report computational results on server location and unit commitment instances.

97 MATHEMATICS AND COMPUTING↗

Impact of Uncertainty from Load-Based Reserves and Renewables on Dispatch Costs and Emissions

Aggregations of controllable loads are considered to be a fast-responding, cost-efficient, and environmental-friendly candidate for power system ancillary services. Unlike conventional service providers, the potential capacity from the aggregation is highly affected by factors like ambient conditions and load usage patterns. Previous work modeled aggregations of controllable loads (such as air conditioners) as thermal batteries, which are capable of providing reserves but with uncertain capacity. A stochastic optimal power flow problem was formulated to manage this uncertainty, as well as uncertainty in renewable generation. In this paper, we explore how the types and levels of uncertainty, generation reserve costs, and controllable load capacity affect the dispatch solution, operational costs, and CO2 emissions. We also compare the results of two methods for solving the stochastic optimization problem, namely the probabilistically robust method and analytical reformulation assuming Gaussian distributions. Case studies are conducted on a modified IEEE 9-bus system with renewables, controllable loads, and congestion. We find that different types and levels of uncertainty have significant impacts on dispatch and emissions. More controllable loads and less conservative solution methodologies lead to lower costs and emissions.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Scalable branching on dual decomposition of stochastic mixed-integer programming problems

In this work, we present a scalable branching method for the dual decomposition of stochastic mixed-integer programming. Our new branching method is based on the branching method proposed by Caroe and Schultz that creates branching disjunctions on first-stage variables only. We propose improvements to the process for creating branching disjunctions, including (1) branching on the optimal solutions of the Dantzig-Wolfe reformulation of the restricted master problem and (2) using a more comprehensive (yet simple) measure for the dispersions associated with subproblem solution infeasibility. We prove that the proposed branching process leads to an algorithm that terminates finitely, and we provide conditions under which globally optimal solutions can be identified after termination. We have implemented our new branching method, as well as the Caroe-Schultz method and a branch-and-price method, in the open-source software package DSP. Using SIPLIB test instances, we present extensive numerical results to demonstrate that the proposed branching method significantly reduces the number of node subproblems and solution times.

97 MATHEMATICS AND COMPUTING↗

A dynamically adaptive wavelet approach to stochastic computations based on polynomial chaos - capturing all scales of random modes on independent grids

Highlights: {yields} New approach for stochastic computations based on polynomial chaos. {yields} Development of dynamically adaptive wavelet multiscale solver using space refinement. {yields} Accurate capture of steep gradients and multiscale features in stochastic problems. {yields} All scales of each random mode are captured on independent grids. {yields} Numerical examples demonstrate the need for different space resolutions per mode. - Abstract: In stochastic computations, or uncertainty quantification methods, the spectral approach based on the polynomial chaos expansion in random space leads to a coupled system of deterministic equations for the coefficients of the expansion. The size of this system increases drastically when the number of independent random variables and/or order of polynomial chaos expansions increases. This is invariably the case for large scale simulations and/or problems involving steep gradients and other multiscale features; such features are variously reflected on each solution component or random/uncertainty mode requiring the development of adaptive methods for their accurate resolution. In this paper we propose a new approach for treating such problems based on a dynamically adaptive wavelet methodology involving space-refinement on physical space that allows all scales of each solution component to be refined independently of the rest. We exemplify this using the convection-diffusion model with random input data and present three numerical examples demonstrating the salient features of the proposed method. Thus we establish a new, elegant and flexible approach for stochastic problems with steep gradients and multiscale features based on polynomial chaos expansions.

97 MATHEMATICS AND COMPUTING↗

A backward SDE method for uncertainty quantification in deep learning

Here, we develop a backward stochastic differential equation based probabilistic machine learning method, which formulates a class of stochastic neural networks as a stochastic optimal control problem. An efficient stochastic gradient descent algorithm is introduced with the gradient computed through a backward stochastic differential equation. Convergence analysis for stochastic gradient descent optimization and numerical experiments for applications of stochastic neural networks are carried out to validate our methodology in both theory and performance.

97 MATHEMATICS AND COMPUTING↗

Summer term 2018 work with IMC radiative transport in binary stochastic media

In the quest for new and improved methods to solve thermal radiation transport in stochastic media, this summer project was to characterize radation transport in a deterministic lattice problem that represents a real, binary stochastic media. A representative geometry for a binary stochastic media consisting of a cube of a high volume fraction media containing constant-diameter non-overlappying spheres randomly distributed within was run previously. Previous thermal radiation wave problems in binary stochastic media displayed three characteristic thermal energy deposition wavefronts in the following order, front of the spheres, bulk material, and the backs of the spheres. Several physical aspects of the representative geometry for a stochastic binary media using an optically thin background with optically thick spheres were analyzed. This analysis includes wave speed propagation using a one dimensional diffusion approximation, energy fluence transmission, and material energy deposition. The approaches to analysis included representing one sphere of the high opacity material in a diffusive background of the low opacity material, as well as repeating spheres in a column con guration with reflective boundary conditions to approximate a lattice. Additionally, both atomic mix and Levermore-Pomraning homogenization schemes were compared against the representative cube geometry as well as the sphere column lattice geometry. The wave speed analysis with a one dimensional Marshak diffusion wave was largely ineffective at determining an effective opacity value to which a problem could be homogenized, likely due to low mean free path resolution within the problem. However, the sphere column lattice geometry showed promising results for approximating the energy fluence transmitted through the problem domain. One concern with the sphere column lattice geometry indicated the high forward-bias effect of fluence reaching the problem boundary due to streaming paths around the spheres in the case of small mean free path resolution of the background material.

36 MATERIALS SCIENCE↗