Benchmark Comparisons of Monte Carlo Algorithms for One-Dimensional N-ary Stochastic Media
Explore the source record for details and available documents.
Nuclear science and engineering, Physics - Nuclear↗
SEARCH · Search NASA
Results for “Stochastic Algorithms”
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.
Benchmark comparisons of Monte Carlo algorithms for one-dimensional N-ary stochastic media.
Abstract not provided.
Vu, Emily↗
Correspondence between open bosonic systems and stochastic differential equations
Bosonic mean-field theories can approximate the dynamics of systems of $n$ bosons provided that $n \gg 1$. Here, we show that there can also be an exact correspondence at finite $n$ when the bosonic system is generalized to include interactions with the environment and the mean-field theory is replaced by a stochastic differential equation. When the $n \to \infty$ limit is taken, the stochastic terms in this differential equation vanish, and a mean-field theory is recovered. Besides providing insight into the differences between the behavior of finite quantum systems and their classical limits given by $n \to \infty$, the developed mathematics can provide a basis for quantum algorithms that solve some stochastic nonlinear differential equations. We discuss conditions on the efficiency of these quantum algorithms, with a focus on the possibility for the complexity to be polynomial in the log of the stochastic system size. A particular system with the form of a stochastic discrete nonlinear Schrödinger equation is analyzed in more detail.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Approximate Bayesian Model Inversion for PDEs with Heterogeneous and State-Dependent Coefficients
We present two approximate Bayesian inference methods for parameter estimation in partial differential equation (PDE) models with space-dependent and state-dependent parameters. We demonstrate that these methods provide accurate and cost-effective alternatives to Markov Chain Monte Carlo simulation. We assume a parameterized Gaussian prior on the unknown functions, and approximate the posterior density by a parameterized multivariate Gaussian density. The parameters of the prior and posterior are estimated from sparse observations of the PDE model's states and the unknown functions themselves by maximizing the evidence lower bound (ELBO), a lower bound on the log marginal likelihood of the observations. The first method, Laplace-EM, employs the expectation maximization algorithm to maximize the ELBO, with a Laplace approximation of the posterior on the E-step, and minimization of a Kullback-Leibler divergence on the M-step. The second method, DSVI-EB, employs the doubly stochastic variational inference (DSVI) algorithm, in which the ELBO is maximized via gradient-based stochastic optimization, with nosiy gradients computed via simple Monte Carlo sampling and Gaussian backpropagation. We apply these methods to identifying diffusion coefficients in linear and nonlinear diffusion equations, and we find that both methods provide accurate estimates of posterior densities and the hyperparameters of Gaussian priors. While the Laplace-EM method is more accurate, it requires computing Hessians of the physics model. The DSVI-EB method is found to be less accurate but only requires gradients of the physics model.
approximate Bayesian inference, model inversion, v↗
Data-driven Minimum Entropy Control for Stochastic Nonlinear Systems using the Cumulant-Generating Function
Here, we present a novel minimum entropy control algorithm for a class of stochastic nonlinear systems subjected to non-Gaussian noises. The entropy control can be considered as an optimization problem for the system randomness attenuation, but the mean value has to be considered separately. To overcome this disadvantage, a new representation of the system stochastic properties was given using the cumulant-generating function based on the moment-generating function, in which the mean value and the entropy was reflected by the shape of the cumulant-generating function. Based on the samples of the system output and control input, a time-variant linear model was identified, and the minimum entropy optimization was transformed to system stabilization. Then, an optimal control strategy was developed to achieve the randomness attenuation, and the boundedness of the controlled system output was analyzed. The effectiveness of the presented control algorithm was demonstrated by a numerical example. In this paper, a data-driven minimum entropy design is presented without pre-knowledge of the system model; entropy optimization is achieved by the system stabilization approach in which the stochastic distribution control and minimum entropy are unified using the same identified structure; and a potential framework is obtained since all the existing system stabilization methods can be adopted to achieve the minimum entropy objective.
42 ENGINEERING↗
S-OPT: A Points Selection Algorithm for Hyper-Reduction in Reduced Order Models
While projection-based reduced order models can reduce the dimension of full order solutions, the resulting reduced models may still contain terms that scale with the full order dimension. Hyper-reduction techniques are sampling-based methods that further reduce this computational complexity by approximating such terms with a much smaller dimension. The goal of this work is to introduce the points selection algorithm developed by Shin and Xiu as a hyper-reduction method. The selection algorithm was originally proposed as a stochastic collocation method for uncertainty quantification. Since the algorithm aims at maximizing a quantity $\mathcal{S}$ that measures both the column orthogonality and the determinant, we refer to the algorithm as S-OPT. Numerical examples are provided to demonstrate the performance of S-OPT and to compare its performance with a gappy proper orthogonal decomposition (POD) algorithm. Here, we found that using the S-OPT algorithm is shown to predict the full order solutions with higher accuracy than gappy POD especially when the number of sampling points is small, although we note that S-OPT shows slow asymptotic convergence with respect to the number of samples for some applications, e.g., Lagrangian hydrodynamics.
97 MATHEMATICS AND COMPUTING↗
Passive stereo range imaging for semi-autonomous land navigation
The paper examines the use of stereo vision (SV) for obstacle detection in semiautonomous land navigation. Feature-based and field-based paradigms for SV are reviewed. The paper presents stochastic models and simple, efficient stereo matching algorithms for the field-based approach and describes a near-real-time vision system using these algorithms. Experimental results illustrate aspects of the stochastic models and lead to the first semiautonomous traversals of natural terrain to use SV for obstacle detection.
Matthies, Larry↗
Combining Particle Filters and Consistency-Based Approaches for Monitoring and Diagnosis of Stochastic Hybrid Systems
Fault detection and isolation are critical tasks to ensure correct operation of systems. When we consider stochastic hybrid systems, diagnosis algorithms need to track both the discrete mode and the continuous state of the system in the presence of noise. Deterministic techniques like Livingstone cannot deal with the stochasticity in the system and models. Conversely Bayesian belief update techniques such as particle filters may require many computational resources to get a good approximation of the true belief state. In this paper we propose a fault detection and isolation architecture for stochastic hybrid systems that combines look-ahead Rao-Blackwellized Particle Filters (RBPF) with the Livingstone 3 (L3) diagnosis engine. In this approach RBPF is used to track the nominal behavior, a novel n-step prediction scheme is used for fault detection and L3 is used to generate a set of candidates that are consistent with the discrepant observations which then continue to be tracked by the RBPF scheme.
Narasimhan, Sriram↗
An efficient multi-level high-order algorithm for simulation of a class of Allen–Cahn stochastic systems
Not Available
Ganesh, M. (ORCID:0000000277924119)↗
Fed-DeepONet: Stochastic Gradient-Based Federated Training of Deep Operator Networks
The Deep Operator Network (DeepONet) framework is a different class of neural network architecture that one trains to learn nonlinear operators, i.e., mappings between infinite-dimensional spaces. Traditionally, DeepONets are trained using a centralized strategy that requires transferring the training data to a centralized location. Such a strategy, however, limits our ability to secure data privacy or use high-performance distributed/parallel computing platforms. To alleviate such limitations, in this paper, we study the federated training of DeepONets for the first time. That is, we develop a framework, which we refer to as Fed-DeepONet, that allows multiple clients to train DeepONets collaboratively under the coordination of a centralized server. To achieve Fed-DeepONets, we propose an efficient stochastic gradient-based algorithm that enables the distributed optimization of the DeepONet parameters by averaging first-order estimates of the DeepONet loss gradient. Then, to accelerate the training convergence of Fed-DeepONets, we propose a moment-enhanced (i.e., adaptive) stochastic gradient-based strategy. Finally, we verify the performance of Fed-DeepONet by learning, for different configurations of the number of clients and fractions of available clients, (i) the solution operator of a gravity pendulum and (ii) the dynamic response of a parametric library of pendulums.
Moya, Christian↗
Laplacian Smoothing Stochastic Gradient Markov Chain Monte Carlo
As an important Markov chain Monte Carlo (MCMC) method, the stochastic gradient Langevin dynamics (SGLD) algorithm has achieved great success in Bayesian learning and posterior sampling. Furthermore, SGLD typically suffers from a slow convergence rate due to its large variance caused by the stochastic gradient. In order to alleviate these drawbacks, we leverage the recently developed Laplacian smoothing technique and propose a Laplacian smoothing stochastic gradient Langevin dynamics (LS-SGLD) algorithm. We prove that for sampling from both log-concave and non-log-concave densities, LS-SGLD achieves strictly smaller discretization error in 2-Wasserstein distance, although its mixing rate can be slightly slower. Experiments on both synthetic and real datasets verify our theoretical results and demonstrate the superior performance of LS-SGLD on different machine learning tasks including posterior sampling, Bayesian logistic regression, and training Bayesian convolutional neural networks.
97 MATHEMATICS AND COMPUTING↗
Algebraic, geometric, and stochastic aspects of genetic operators
Genetic algorithms for function optimization employ genetic operators patterned after those observed in search strategies employed in natural adaptation. Two of these operators, crossover and inversion, are interpreted in terms of their algebraic and geometric properties. Stochastic models of the operators are developed which are employed in Monte Carlo simulations of their behavior.
Foo, N. Y.↗
Automated Flight Routing Using Stochastic Dynamic Programming
Airspace capacity reduction due to convective weather impedes air traffic flows and causes traffic congestion. This study presents an algorithm that reroutes flights in the presence of winds, enroute convective weather, and congested airspace based on stochastic dynamic programming. A stochastic disturbance model incorporates into the reroute design process the capacity uncertainty. A trajectory-based airspace demand model is employed for calculating current and future airspace demand. The optimal routes minimize the total expected traveling time, weather incursion, and induced congestion costs. They are compared to weather-avoidance routes calculated using deterministic dynamic programming. The stochastic reroutes have smaller deviation probability than the deterministic counterpart when both reroutes have similar total flight distance. The stochastic rerouting algorithm takes into account all convective weather fields with all severity levels while the deterministic algorithm only accounts for convective weather systems exceeding a specified level of severity. When the stochastic reroutes are compared to the actual flight routes, they have similar total flight time, and both have about 1% of travel time crossing congested enroute sectors on average. The actual flight routes induce slightly less traffic congestion than the stochastic reroutes but intercept more severe convective weather.
Ng, Hok K.↗
Method to Create Arbitrary Sidewall Geometries in 3-Dimensions Using Liga with a Stochastic Optimization Framework
Disclosed herein is a method of making a three dimensional mold comprising the steps of providing a mold substrate; exposing the substrate with an electromagnetic radiation source for a period of time sufficient to render the portion of the mold substrate susceptible to a developer to produce a modified mold substrate; and developing the modified mold with one or more developing reagents to remove the portion of the mold substrate rendered susceptible to the developer from the mold substrate, to produce the mold having a desired mold shape, wherein the electromagnetic radiation source has a fixed position, and wherein during the exposing step, the mold substrate is manipulated according to a manipulation algorithm in one or more dimensions relative to the electromagnetic radiation source; and wherein the manipulation algorithm is determined using stochastic optimization computations.
Eyre, Francis B.↗
Explicit time integration of the stiff chemical Langevin equations using computational singular perturbation
A stable explicit time-scale splitting algorithm for stiff chemical Langevin equations (CLEs) is developed, based on the concept of computational singular perturbation. The drift term of the CLE is projected onto basis vectors that span the fast and slow subdomains. The corresponding fast modes exhaust quickly, in the mean sense, and the system state then evolves, with a mean drift controlled by slow modes, on a random manifold. The drift-driven time evolution of the state due to fast exhausted modes is modeled algebraically as an exponential decay process, while that due to slow drift modes and diffusional processes is integrated explicitly. This enables time integration step sizes much larger than those required by typical explicit numerical methods for stiff stochastic differential equations. The algorithm is motivated and reported on, and extensive numerical experiments are conducted to illustrate its accuracy and stability with a number of model systems.
37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
Parameter identification of linear discrete stochastic systems with time delays
An identification algorithm that uses the maximum likelihood technique to identify the unknown time delays, plant parameters, and noise covariances of linear discrete stochastic systems is presented. Cases of additive white noise and colored measurement noises are considered. The likelihood function is evaluated using either a minimum-variance (Kalman) filter or a minimal-order observer. The Kalman filter is used in the identification algorithm to provide minimum-variance estimates. The minimal-order observer is a lower-dimensional and computationally simpler filter, and is advantageous especially for systems with long delays. It provides a less optimal solution to the minimum-mean-square state estimation problem. The colored-noise observer algorithm has the disadvantage of having to compute an extra error covariance matrix of lower order.
Wong, E. C.↗
Implementation of variable time step stochastic dynamics for electronically inelastic gas-surface collisions
A variable time step algorithm has been implemented for solving the stochastic equations of motion for gas-surface collisions. It has been tested for a simple model of electronically inelastic collisions with an insulator surface in which the phonon manifold acts as a heat bath and electronic states are localized. In addition to reproducing the accurate nuclear dynamics of the surface atoms, numerical calculations have shown the algorithm to yield accurate ensemble averages of physical observables such as electronic transition probabilities and total energy loss of the gas atom to the surface. This new algorithm offers a gain in efficieny of up to an order of magnitude compared to fixed time step integration.
Garrett, Bruce C.↗
Multiscale characterization and representation of variability in ceramic matrix composites
Low density, high strength, and high creep and oxidation resistance properties of ceramic matrix composites (CMCs) make them an ideal choice for use in extreme environments in space and military applications. This paper presents a detailed characterization study of structural and manufacturing flaws in Carbon fiber Silicon-Carbide-Nitride matrix (C/SiNC) CMCs at different length-scales. Energy-dispersive spectroscopy (EDS) is used for the chemical characterization of the material’s elemental constituents. High-resolution multiscale graphs obtained from scanning electron microscope (SEM) and confocal laser scanning microscope (LSM) are used to characterize the distribution and morphology of defects at different length scales. This is followed by the classification and quantification of the common manufacturing defects. An image processing algorithm based on the image segmentation process is developed to quantify the variability of various scale-dependent architectural parameters. Finally, a three-dimensional stochastic representative volume element (SRVE) generation algorithm is developed to provide precise representations of material textures at multiple length scales. The developed algorithm accurately accounts for material features and flaws based on a range of multiscale structural and defects characterization results.
36 MATERIALS SCIENCE↗