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 577 records · Page 32

Stochastic Least-Squares Petrov--Galerkin Method for Parameterized Linear Systems

We consider the numerical solution of parameterized linear systems where the system matrix, the solution, and the right-hand side are parameterized by a set of uncertain input parameters. We explore spectral methods in which the solutions are approximated in a chosen finite-dimensional subspace. It has been shown that the stochastic Galerkin projection technique fails to minimize any measure of the solution error [A. Mugler and H.-J. Starkloff, ESAIM Math. Model. Numer. Anal., 47 (2013), pp. 1237--1263]. As a remedy for this, we propose a novel stochatic least-squares Petrov--Galerkin (LSPG) method. The proposed method is optimal in the sense that it produces the solution that minimizes a weighted $\ell^2$-norm of the residual over all solutions in a given finite-dimensional subspace. Moreover, the method can be adapted to minimize the solution error in different weighted $\ell^2$-norms by simply applying a weighting function within the least-squares formulation. In addition, a goal-oriented seminorm induced by an output quantity of interest can be minimized by defining a weighting function as a linear functional of the solution. We establish optimality and error bounds for the proposed method, and extensive numerical experiments show that the weighted LSPG method outperforms other spectral methods in minimizing corresponding target weighted norms.

97 MATHEMATICS AND COMPUTING↗

The time dependent propensity function for acceleration of spatial stochastic simulation of reaction–diffusion systems

The inhomogeneous stochastic simulation algorithm (ISSA) is a fundamental method for spatial stochastic simulation. However, when diffusion events occur more frequently than reaction events, simulating the diffusion events by ISSA is quite costly. To reduce this cost, we propose to use the time dependent propensity function in each step. In this way we can avoid simulating individual diffusion events, and use the time interval between two adjacent reaction events as the simulation stepsize. We demonstrate that the new algorithm can achieve orders of magnitude efficiency gains over widely-used exact algorithms, scales well with increasing grid resolution, and maintains a high level of accuracy.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A multigroup moment-accelerated deterministic particle solver for 1-D time-dependent thermal radiative transfer problems

We introduce an efficient, robust, Lagrangian (characteristic-based) transport solver for 1-D time-dependent thermal radiative transfer (TRT) applications within the context of a moment-accelerated (High-Order/Low-Order, HOLO) algorithm. This novel transport algorithm inherits the best features of both particle methods (e.g., time accuracy, phase-space adaptivity, positivity) and deterministic, grid-based methods (e.g., no stochastic noise). Particles are adapted by the method of characteristics, with a time-dependent weight that accounts for stiff absorption and reemission process self-consistently. As a result, this approach is able to obtain accurate results while employing large time steps and a moderate number of particles (compared to Implicit Monte Carlo).

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

High-Order Finite-Difference Nonlinear Filter Methods for Subsonic Turbulence Simulation with Stochastic Forcing

Numerical stability of high-order filter schemes developed by Yee & Sjogreen is tested on three-dimensional turbulence simulations with stochastic forcing and their performance is compared with that of TVD and WENO schemes. The best­ performing filter method employs an eighth-order central base scheme with the Kennedy & Gruber skew-symmetric splitting of the inviscid flux derivative, a wavelet-based local flow sensor, a nonlinear filter utilizing the dissipative portion of seventh-order \VENO scheme, and an explicit third - or fourth-order Runge­-Kutta time integration. We show that the filter scheme is more computational]y efficient and provides a wider spectral bandwidth compared to the seventh-order WENO scheme. The method also demonstrates robust long-time integration for moderately compressible turbulence. In contrast, the fifth- and seventh­ order WENO schemes show non-trivial evolution of the velocity and density power spectra. over a. few dozen dynamical times, where both TVD and filter schemes recover a so lid statistically stationary turbulent state

Kritsuk, Alexei G.↗

A heterogeneous stochastic FEM framework for elliptic PDEs

We introduce a new concept of sparsity for the stochastic elliptic operator −div(a(x,ω)∇(⋅)), which reflects the compactness of its inverse operator in the stochastic direction and allows for spatially heterogeneous stochastic structure. This new concept of sparsity motivates a heterogeneous stochastic finite element method (HSFEM) framework for linear elliptic equations, which discretizes the equations using the heterogeneous coupling of spatial basis with local stochastic basis to exploit the local stochastic structure of the solution space. We also provide a sampling method to construct the local stochastic basis for this framework using the randomized range finding techniques. The resulting HSFEM involves two stages and suits the multi-query setting: in the offline stage, the local stochastic structure of the solution space is identified; in the online stage, the equation can be efficiently solved for multiple forcing functions. An online error estimation and correction procedure through Monte Carlo sampling is given. Numerical results for several problems with high dimensional stochastic input are presented to demonstrate the efficiency of the HSFEM in the online stage.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Linear regulator design for stochastic systems by a multiple time scales method

This paper develops a hierarchically-structured, suboptimal controller for a linear stochastic system composed of fast and slow subsystems. It is proved that the controller is optimal in the limit as the separation of time scales of the subsystems becomes infinite. The methodology is illustrated by design of a controller to suppress the phugoid and short period modes of the longitudinal dynamics of the F-8 aircraft.

Teneketzis, D.↗

Reconstruction of effective potential from statistical analysis of dynamic trajectories

The broad incorporation of microscopic methods is yielding a wealth of information on the atomic and mesoscale dynamics of individual atoms, molecules, and particles on surfaces and in open volumes. Analysis of such data necessitates statistical frameworks to convert observed dynamic behaviors to effective properties of materials. Here, we develop a method for the stochastic reconstruction of effective local potentials solely from observed structural data collected from molecular dynamics simulations (i.e., data analogous to those obtained via atomically resolved microscopies). Using the silicon vacancy defect in graphene as a model, we apply the statistical framework presented herein to reconstruct the free energy landscape from the calculated atomic displacements. Evidence of consistency between the reconstructed local potential and the trajectory data from which it was produced is presented, along with a quantitative assessment of the uncertainty in the inferred parameters.

74 ATOMIC AND MOLECULAR PHYSICS↗

An air quality index-based multistage type-2-fuzzy interval-stochastic programming model for energy and environmental systems management under multiple uncertainties

Highlights: • A multistage type-2-fuzzy interval-stochastic programming (MTIP) method is developed. • Air quality index (AQI) is introduced to manage energy and environmental systems. • AQI-MTIP model is formulated and results for Tianjin's EES are generated. • Impacts of environmental requirements on energy systems is analyzed. • Results can provide support for making effective pollutant mitigation policy. In this study, a multistage type-2-fuzzy interval-stochastic programming (MTIP) method is developed, which extends upon the existing multistage stochastic programming (MSP) by allowing uncertainties expressed as probabilistic distributions, interval values and type-2 fuzzy sets to be effectively incorporated within the optimization framework. Through coupling air quality index (AQI) with MTIP, an AQI-MTIP model is formulated for energy and environmental systems (EES) management of Tianjin. A number of scenarios based on changed AQIs are examined to analyze the impacts of environmental requirements on the city's energy system. Results indicate that (i) with the improvement of environmental requirement, utilization of clean energies (especially natural gas) is provoked markedly; (ii) PM{sub 2.5} is the primary pollutant, 64.50% of which should be reduced each period to maintain the city's air quality at a health-safe level. These findings can help decision makers adjust energy structure, make effective mitigation strategy, and gain deep insight into the relationship between energy consumption and environmental requirement.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Scenario generation for stochastic optimization problems via the sparse grid method

We study the use of sparse grids in the scenario generation (or discretization) problem in stochastic programming problems where the uncertainty is modeled using a continuous multivariate distribution. We show that, under a regularity assumption on the random function involved, the sequence of optimal objective function values of the sparse grid approximations converges to the true optimal objective function values as the number of scenarios increases. The rate of convergence is also established. We treat separately the special case when the underlying distribution is an affine transform of a product of univariate distributions, and show how the sparse grid method can be adapted to the distribution by the use of quadrature formulas tailored to the distribution. We numerically compare the performance of the sparse grid method using different quadrature rules with classic quasi-Monte Carlo (QMC) methods, optimal rank-one lattice rules, and Monte Carlo (MC) scenario generation, using a series of utility maximization problems with up to 160 random variables. The results show that the sparse grid method is very efficient, especially if the integrand is sufficiently smooth. In such problems the sparse grid scenario generation method is found to need several orders of magnitude fewer scenarios than MC and QMC scenario generation to achieve the same accuracy. As a result, it is indicated that the method scales well with the dimension of the distribution--especially when the underlying distribution is an affine transform of a product of univariate distributions, in which case the method appears scalable to thousands of random variables.

97 MATHEMATICS AND COMPUTING↗

Learning in Modal Space: Solving Time-Dependent Stochastic PDEs Using Physics-Informed Neural Networks

One of the open problems in scientific computing is the long-time integration of nonlinear stochastic partial differential equations (SPDEs), especially with arbitrary initial data. We address this problem by taking advantage of recent advances in scientific machine learning and the spectral dynamically orthogonal (DO) and borthogonal (BO) methods for representing stochastic processes. The recently introduced DO/BO methods reduce the SPDE to solving a system of deterministic PDEs and a system of stochastic ordinary differential equations. Specifically, we propose two new physics-informed neural networks (PINNs) for solving time-dependent SPDEs, namely the neural network (NN)-DO/BO methods. The proposed methods incorporate the DO/BO constraints into the loss function (along with the modal decomposition of the SPDE) with an implicit form instead of generating explicit expressions for the temporal derivatives of the DO/BO modes. Hence, the NN-DO/BO methods can overcome some of the drawbacks of the original DO/BO methods. For example, we do not need the assumption that the covariance matrix of the random coefficients is invertible as in the original DO method, and we can remove the assumption of no eigenvalue crossing as in the original BO method. Moreover, the NN-DO/BO methods can be used to solve time-dependent stochastic inverse problems with the same formulation and same computational complexity as for forward problems. Furthermore, we demonstrate the capability of the proposed methods via several numerical examples, namely: (1) A linear stochastic advection equation with deterministic initial condition: we obtain good results with the proposed methods, while the original DO/BO methods cannot be applied directly in this case. (2) Long-time integration of the stochastic Burgers' equation: we show the good performance of NN-DO/BO methods, especially the effectiveness of the NN-BO approach for such problems with many eigenvalue crossings during the whole time evolution, while the original BO method fails. (3) Nonlinear reaction diffusion equation: we consider both the forward problem and the inverse problems, including very noisy initial point values, to investigate the flexibility of the NN-DO/BO methods in handling inverse and mixed type problems. Taken together, these simulation results demonstrate that the NN-DO/BO methods can be employed to effectively quantify uncertainty propagation in a wide range of physical problems, but future work should address the efficiency issue of PINNs for forward problems.

97 MATHEMATICS AND COMPUTING↗

Accelerated Sensitivity Analysis in High-Dimensional Stochastic Reaction Networks

Existing sensitivity analysis approaches are not able to handle efficiently stochastic reaction networks with a large number of parameters and species, which are typical in the modeling and simulation of complex biochemical phenomena. In this paper, a two-step strategy for parametric sensitivity analysis for such systems is proposed, exploiting advantages and synergies between two recently proposed sensitivity analysis methodologies for stochastic dynamics. The first method performs sensitivity analysis of the stochastic dynamics by means of the Fisher Information Matrix on the underlying distribution of the trajectories; the second method is a reduced-variance, finite-difference, gradient-type sensitivity approach relying on stochastic coupling techniques for variance reduction. Here in this paper we demonstrate that these two methods can be combined and deployed together by means of a new sensitivity bound which incorporates the variance of the quantity of interest as well as the Fisher Information Matrix estimated from the first method. The first step of the proposed strategy labels sensitivities using the bound and screens out the insensitive parameters in a controlled manner. In the second step of the proposed strategy, a finite-difference method is applied only for the sensitivity estimation of the (potentially) sensitive parameters that have not been screened out in the first step. Results on an epidermal growth factor network with fifty parameters and on a protein homeostasis with eighty parameters demonstrate that the proposed strategy is able to quickly discover and discard the insensitive parameters and in the remaining potentially sensitive parameters it accurately estimates the sensitivities. The new sensitivity strategy can be several times faster than current state-of-the-art approaches that test all parameters, especially in “sloppy” systems. In particular, the computational acceleration is quantified by the ratio between the total number of parameters over the number of the sensitive parameters.

97 MATHEMATICS AND COMPUTING↗

Learning Stochastic Parametric Differentiable Predictive Control Policies

We present a scalable unsupervised learning-based method for obtaining explicit control policies for model predictive control problems for stochastic linear systems with additive uncertainties subject to nonlinear chance constraints. We call the proposed method stochastic parametric differentiable predictive control (SP-DPC), which extends the recently proposed deterministic DPC policy optimization algorithm. We formulate the SP-DPC as a deterministic approximation to the stochastic parametric constrained optimal control problem via independent sampling of the problem's parameters and uncertainties. This formulation allows us to directly compute the policy gradients via automatic differentiation of the problem's value function, evaluated over sampled parameters and uncertainties. In particular, the computed expectation of the problem's value function is backpropagated through the finite-time closed-loop system rollouts parametrized by a known nominal system dynamics model and neural control policy. We also provide theoretical probabilistic guarantees on closed-loop stability and chance constraints satisfaction for systems controlled by learned neural policies. We demonstrate the computational efficiency and scalability of the proposed policy optimization algorithm in three numerical examples, including systems with a large number of states or subject to nonlinear constraints.

Drgona, Jan↗

Accelerated simulation of stochastic particle removal processes in particle-resolved aerosol models

Stochastic particle-resolved methods have proven useful for simulating multi-dimensional systems such as composition-resolved aerosol size distributions. While particle-resolved methods have substantial benefits for highly detailed simulations, these techniques suffer from high computational cost, motivating efforts to improve their algorithmic efficiency. Here we formulate an algorithm for accelerating particle removal processes by aggregating particles of similar size into bins. We present the Binned Algorithm for particle removal processes and analyze its performance with application to the atmospherically relevant process of aerosol dry deposition. We show that the Binned Algorithm can dramatically improve the efficiency of particle removals, particularly for low removal rates, and that computational cost is reduced without introducing additional error. In simulations of aerosol particle removal by dry deposition in atmospherically relevant conditions, we demonstrate about 50-times increase in algorithm efficiency.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A fast exact simulation method for a class of Markov jump processes

A new method of the stochastic simulation algorithm (SSA), named the Hashing-Leaping method (HLM), for exact simulations of a class of Markov jump processes, is presented in this paper. The HLM has a conditional constant computational cost per event, which is independent of the number of exponential clocks in the Markov process. The main idea of the HLM is to repeatedly implement a hash-table-like bucket sort algorithm for all times of occurrence covered by a time step with length τ. This paper serves as an introduction to this new SSA method. We introduce the method, demonstrate its implementation, analyze its properties, and compare its performance with three other commonly used SSA methods in four examples. Our performance tests and CPU operation statistics show certain advantages of the HLM for large scale problems.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Validation of the Poisson Stochastic Radiative Transfer Model

A new approach to validation of the Poisson stochastic radiative transfer method is proposed. In contrast to other validations of stochastic models, the main parameter of the Poisson model responsible for cloud geometrical structure - cloud aspect ratio - is determined entirely by matching measurements and calculations of the direct solar radiation. If the measurements of the direct solar radiation is unavailable, it was shown that there is a range of the aspect ratios that allows the stochastic model to accurately approximate the average measurements of surface downward and cloud top upward fluxes. Realizations of the fractionally integrated cascade model are taken as a prototype of real measurements.

Zhuravleva, Tatiana↗