Search NASA⌕ Search

SEARCH · Search NASA

Results for “Stochastic Numerical 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 379 records · Page 21
All sourcesNASA NTRSDOE OSTI
DOE OSTI2017

A stochastic asymptotic-preserving scheme for a kinetic-fluid model for disperse two-phase flows with uncertainty

In this paper we consider a kinetic-fluid model for disperse two-phase flows with uncertainty. We propose a stochastic asymptotic-preserving (s-AP) scheme in the generalized polynomial chaos stochastic Galerkin (gPC-sG) framework, which allows the efficient computation of the problem in both kinetic and hydrodynamic regimes. The s-AP property is proved by deriving the equilibrium of the gPC version of the Fokker–Planck operator. The coefficient matrices that arise in a Helmholtz equation and a Poisson equation, essential ingredients of the algorithms, are proved to be positive definite under reasonable and mild assumptions. The computation of the gPC version of a translation operator that arises in the inversion of the Fokker–Planck operator is accelerated by a spectrally accurate splitting method. Numerical examples illustrate the s-AP property and the efficiency of the gPC-sG method in various asymptotic regimes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2026

Optical stochastic cooling at Fermilab’s IOTA ring

Stochastic cooling (SC) constitutes one of the greatest conceptual and technological achievements in particle beam cooling. Numerous SC systems have been built in the microwave regime and used to extend the science reach of accelerator facilities worldwide. The ability to sense and correct the particle ensemble using high-bandwidth feedback systems is at the core of the concept. Here, we describe the first realization of SC at optical frequencies and bandwidths. The demonstration was recently carried out at Fermilab’s integrable optics test accelerator (IOTA) storage ring using the transit-time method of optical stochastic cooling (OSC) and achieved an integrated system bandwidth of approximately 20 THz, which is more than 2000 times that of conventional SC systems. This demonstration establishes the foundation for more advanced OSC experiments with high-gain amplification, currently underway at Fermilab, and the eventual application of OSC to colliders and other accelerator facilities.

Jarvis, Jonathan D. [Fermilab]↗
DOE OSTI2012

New evolution equations for the joint response-excitation probability density function of stochastic solutions to first-order nonlinear PDEs

By using functional integral methods we determine new evolution equations satisfied by the joint response-excitation probability density function (PDF) associated with the stochastic solution to first-order nonlinear partial differential equations (PDEs). The theory is presented for both fully nonlinear and for quasilinear scalar PDEs subject to random boundary conditions, random initial conditions or random forcing terms. Particular applications are discussed for the classical linear and nonlinear advection equations and for the advection-reaction equation. By using a Fourier-Galerkin spectral method we obtain numerical solutions of the proposed response-excitation PDF equations. These numerical solutions are compared against those obtained by using more conventional statistical approaches such as probabilistic collocation and multi-element probabilistic collocation methods. It is found that the response-excitation approach yields accurate predictions of the statistical properties of the system. In addition, it allows to directly ascertain the tails of probabilistic distributions, thus facilitating the assessment of rare events and associated risks. The computational cost of the response-excitation method is order magnitudes smaller than the one of more conventional statistical approaches if the PDE is subject to high-dimensional random boundary or initial conditions. The question of high-dimensionality for evolution equations involving multidimensional joint response-excitation PDFs is also addressed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2016

Dynamic Simulation with on the fly Doppler Broadening treatment in RMC

In conventional transient analysis, thermal hydraulics calculations are generally coupled to deterministic neutronics solvers. Due to the limited accuracy of deterministic methods and the rapid development of computer power, Monte Carlo neutronics calculations have received increasing attention nowadays. One of challenges for Monte Carlo methods coupled to thermal hydraulics calculations is the temperature dependent cross sections. Taking the detailed temperature distribution feedback into account, each nuclide may be in a large range of temperatures, pre-generated libraries at every temperature point are no longer applicable owing to unaffordable memory footprint. Different solutions have been proposed to deal with this problem. TMS, accounting for Doppler broadening effect by the explicit treatment of thermal motion, was used to model fast transients in Serpent 2. Stochastic mixing, using two sets of libraries for each nuclide and mixing them to get the correct temperature, was used in transient analysis by Sjenitzer and Hoogenboom. Besides, there are other on the fly Doppler broadening methods being developed, including series expansion of cross sections, multipole representation, different integration algorithms based on Doppler broadening equation. In this paper, on the fly Doppler broadening treatment based on integration algorithms was applied to transient calculation in Reactor Monte Carlo code RMC . In the following section, the integration algorithms implemented and dynamic simulation method in RMC is briefly introduced. Finally, a pure physical transient fuel assembly model was chosen for numerical validation. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗
DOE OSTI2015

Multiscale Universal Interface: A concurrent framework for coupling heterogeneous solvers

Graphical abstract: - Abstract: Concurrently coupled numerical simulations using heterogeneous solvers are powerful tools for modeling multiscale phenomena. However, major modifications to existing codes are often required to enable such simulations, posing significant difficulties in practice. In this paper we present a C++ library, i.e. the Multiscale Universal Interface (MUI), which is capable of facilitating the coupling effort for a wide range of multiscale simulations. The library adopts a header-only form with minimal external dependency and hence can be easily dropped into existing codes. A data sampler concept is introduced, combined with a hybrid dynamic/static typing mechanism, to create an easily customizable framework for solver-independent data interpretation. The library integrates MPI MPMD support and an asynchronous communication protocol to handle inter-solver information exchange irrespective of the solvers' own MPI awareness. Template metaprogramming is heavily employed to simultaneously improve runtime performance and code flexibility. We validated the library by solving three different multiscale problems, which also serve to demonstrate the flexibility of the framework in handling heterogeneous models and solvers. In the first example, a Couette flow was simulated using two concurrently coupled Smoothed Particle Hydrodynamics (SPH) simulations of different spatial resolutions. In the second example, we coupled the deterministic SPH method with the stochastic Dissipative Particle Dynamics (DPD) method to study the effect of surface grafting on the hydrodynamics properties on the surface. In the third example, we consider conjugate heat transfer between a solid domain and a fluid domain by coupling the particle-based energy-conserving DPD (eDPD) method with the Finite Element Method (FEM)

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Numerical heating in particle-in-cell simulations with Monte Carlo binary collisions

The binary Monte Carlo (MC) collision algorithm is a standard and robust method to include binary Coulomb collision effects in particle-in-cell (PIC) simulations of plasmas. Here we show that the coupling between PIC and MC algorithms can give rise to (nonphysical) numerical heating of the system that significantly exceeds that observed when these algorithms operate independently. We argue that this deleterious effect results from an inconsistency between the particle motion associated with MC collisions and the work performed by the collective electromagnetic field on the PIC grid. This inconsistency manifests as the (artificial) stochastic production of electromagnetic energy, which ultimately heats the plasma particles. Here, the MC-induced numerical heating can significantly impact the evolution of the simulated system for long simulation times (≳10 3 collision periods, for typical numerical parameters). We describe the source of the MC-induced numerical heating analytically and discuss strategies to minimize it.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2012

Controlled Nonlinear Stochastic Delay Equations: Part II: Approximations and Pipe-Flow Representations

This is the second part of a work dealing with key issues that have not been addressed in the modeling and numerical optimization of nonlinear stochastic delay systems. We consider new classes of models, such as those with nonlinear functions of several controls (such as products), each with is own delay, controlled random Poisson measure driving terms, admissions control with delayed retrials, and others. Part I was concerned with issues concerning the class of admissible controls and their approximations, since the classical definitions are inadequate for our models. This part is concerned with transportation equation representations and their approximations. Such representations of nonlinear stochastic delay models have been crucial in the development of numerical algorithms with much reduced memory and computational requirements. The representations for the new models are not obvious and are developed. They also provide a template for the adaptation of the Markov chain approximation numerical methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Entropy-based closure for probabilistic learning on manifolds

In a recent paper, the authors proposed a general methodology for probabilistic learning on manifolds. The method was used to generate numerical samples that are statistically consistent with an existing dataset construed as a realization from a non-Gaussian random vector. The manifold structure is learned using diffusion manifolds and the statistical sample generation is accomplished using a projected Itˆo stochastic differential equation. This probabilistic learning approach has been extended to polynomial chaos representation of databases on manifolds and to probabilistic nonconvex constrained optimization with a fixed budget of function evaluations. The methodology introduces an isotropic-diffusion kernel with hyperparameter ". Currently, " is more or less arbitrarily chosen. In this paper, we propose a selection criterion for identifying an optimal value of ", based on a maximum entropy argument. The result is a comprehensive, closed, probabilistic model for characterizing data sets with hidden constraints. This entropy argument ensures that out of all possible models, this is the one that is the most uncertain beyond any specified constraints, which is selected. Applications are presented for several databases.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Importance Sampling with Analog Scenarios for Stochastic Economic Dispatch

Increasing penetrations of renewable energy sources such as wind into power grids motivates the investigation of new approaches to 5-minute economic dispatch computation. In this poster, we investigate the application of importance sampling in the two-stage stochastic economic dispatch problem while using historical data to characterize uncertainty. In our numerical experiments, we observe that importance sampling performs better than the standard Monte Carlo sampling approach in preventing loss-of-load. While first-stage costs are comparable for both sampling methods, the second-stage costs are significantly reduced when the importance sampling method is employed.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

A Low-Rank Multigrid Method for the Stochastic Steady-State Diffusion Problem

We study a multigrid method for solving large linear systems of equations with tensor product structure here. Such systems are obtained from stochastic finite element discretization of stochastic partial differential equations such as the steady-state diffusion problem with random coefficients. When the variance in the problem is not too large, the solution can be well approximated by a low-rank object. In the proposed multigrid algorithm, the matrix iterates are truncated to low rank to reduce memory requirements and computational effort. The technique is proved convergent with an analytic error bound. Numerical experiments show its effectiveness in solving the Galerkin systems compared to the original multigrid solver, especially when the number of degrees of freedom associated with the spatial discretization is large.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2015

Convergence of statistical moments of particle density time series in scrape-off layer plasmas

Particle density fluctuations in the scrape-off layer of magnetically confined plasmas, as measured by gas-puff imaging or Langmuir probes, are modeled as the realization of a stochastic process in which a superposition of pulses with a fixed shape, an exponential distribution of waiting times, and amplitudes represents the radial motion of blob-like structures. With an analytic formulation of the process at hand, we derive expressions for the mean squared error on estimators of sample mean and sample variance as a function of sample length, sampling frequency, and the parameters of the stochastic process. Employing that the probability distribution function of a particularly relevant stochastic process is given by the gamma distribution, we derive estimators for sample skewness and kurtosis and expressions for the mean squared error on these estimators. Numerically, generated synthetic time series are used to verify the proposed estimators, the sample length dependency of their mean squared errors, and their performance. We find that estimators for sample skewness and kurtosis based on the gamma distribution are more precise and more accurate than common estimators based on the method of moments.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2019

eSHIVA in IOTA: Experiment on Stochasticity in High Intensity Variable Accelerators

Nonlinear integrable optics, the basis of IOTA, is a very special form of Hamiltonian system, called completely integrable. The consequences are many, most importantly the absence of fixed points that are in one-to-one correspondence with (overlapping) resonances. This, in turn, does not limit the dynamic aperture and allows large amplitude dependent tune shifts without adverse effects. In fact, it helps significantly in alleviating issues with collective instabilities. We developed and tested different numerical methods to give a more complete picture of the dynamics of integrable and near-integrable nonlinear Hamiltonian systems consisting of motion of charged particles in electromagnetic fields. Comparison of the results allowed us to discern real phenomena from numerical artifacts and come up with conclusions that will facilitate pushing the intensity frontier in beam dynamics even further for the benefit of the accelerator community as a whole and society as the consequence of the science and technological advancements it will make possible. We concluded that, while novel structure preserving integrators would be ideal, symplectic methods under mild restrictions offer adequate invariant preservation. We especially highlighted the very good performance of the Stormer-Verlet method at low accuracy and a modified Lobatto method at high accuracy for the Integrable Optics Test Accelerator (IOTA). However, we showed that symplectic integrators are limited by numerically induced resonances, which make interpretation of some simulation results challenging. These limitations and workarounds have been addressed.The nonlinear integrable optics test accelerator IOTA at Fermilab -- a very special experimental accelerator designed to investigate nonlinear optics under severe space-charge conditions – has recently completed its construction and initial commissioning of the ring has begun. We report first, under 2 (a) below: the progress on the nonlinear tune-shift measurements for various values of the nonlinear strength potential and their comparison with theoretical expectations, thus benchmarking the nonlinear characteristics of the ring; then, under 2 (b) below: the progress on simulation and design of a gas-jet monitor to measure beam profile and in particular its diffusive halo, expected to develop during stochastic diffusion of large amplitude particles under nonlinear forces of the magnetic lattice and Coulomb space-charge. Since the development of a proton beam source in IOTA is delayed and to be completed only in the future pending financial support, the gas-jet monitor is planned for testing with real proton beams elsewhere at Fermilab (e.g. in the Main Injector or PIP-II source possibly). Once proton beams are available in IOTA, the understanding of the nonlinear properties of IOTA combined with the developed gas-jet monitor, will enable a thorough experimental analysis of nonlinear stochastic diffusion in IOTA nonlinear ring, and boosted by proper theoretical understanding of the same.

43 PARTICLE ACCELERATORS↗
DOE OSTI2023

Stochastic projective splitting

Here, we present a new, stochastic variant of the projective splitting (PS) family of algorithms for inclusion problems involving the sum of any finite number of maximal monotone operators. This new variant uses a stochastic oracle to evaluate one of the operators, which is assumed to be Lipschitz continuous, and (deterministic) resolvents to process the remaining operators. Our proposal is the first version of PS with such stochastic capabilities. We envision the primary application being machine learning (ML) problems, with the method’s stochastic features facilitating “mini-batch” sampling of datasets. Since it uses a monotone operator formulation, the method can handle not only Lipschitz-smooth loss minimization, but also min–max and noncooperative game formulations, with better convergence properties than the gradient descent-ascent methods commonly applied in such settings. The proposed method can handle any number of constraints and nonsmooth regularizers via projection and proximal operators. We prove almost-sure convergence of the iterates to a solution and a convergence rate result for the expected residual, and close with numerical experiments on a distributionally robust sparse logistic regression problem.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Convergence and Efficiency of Adaptive Importance Sampling Techniques with Partial Biasing

We propose a new Monte Carlo method to efficiently sample a multimodal distribution (known up to a normalization constant). We consider a generalization of the discrete-time Self Healing Umbrella Sampling method, which can also be seen as a generalization of well-tempered metadynamics. The dynamics is based on an adaptive importance technique. The importance function relies on the weights (namely the relative probabilities) of disjoint sets which form a partition of the space. These weights are unknown but are learnt on the fly yielding an adaptive algorithm. In the context of computational statistical physics, the logarithm of these weights is, up to an additive constant, the free-energy, and the discrete valued function defining the partition is called the collective variable. The algorithm falls into the general class of Wang–Landau type methods, and is a generalization of the original Self Healing Umbrella Sampling method in two ways: (i) the updating strategy leads to a larger penalization strength of already visited sets in order to escape more quickly from metastable states, and (ii) the target distribution is biased using only a fraction of the free-energy, in order to increase the effective sample size and reduce the variance of importance sampling estimators. We prove the convergence of the algorithm and analyze numerically its efficiency on a toy example.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2014

Intrinsic fluctuations of dust grain charge in multi-component plasmas

A master equation is formulated to model the states of the grain charge in a general multi-component plasma, where there are electrons and various kinds of positive or negative ions that are singly or multiply charged. A Fokker-Planck equation is developed from the master equation through the system-size expansion method. The Fokker-Planck equation has a Gaussian solution with a mean and variance governed by two initial-value differential equations involving the rates of the attachment of ions and electrons to the dust grain. Also, a Langevin equation and a discrete stochastic method are developed to model the time variation of the grain charge. Grain charging in a plasma containing electrons, protons, and alpha particles with Maxwellian distributions is considered as an example problem. The Gaussian solution is in very good agreement with the master equation solution numerically obtained for this problem.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2019

An Efficient, Globally Convergent Method for Optimization Under Uncertainty Using Adaptive Model Reduction and Sparse Grids

We present a new approach to efficiently solve optimization problems constrained by partial differential equations (PDEs) with uncertain coefficients. The method leverages two sources of inexactness that trade accuracy for speed: (1) stochastic collocation based on dimension-adaptive sparse grids (SGs), which approximates the stochastic objective function with a limited number of quadrature nodes, and (2) projection-based reduced-order models (ROMs), which generate efficient approximations to PDE solutions. These two sources of inexactness lead to inexact objective function and gradient evaluations, which are managed by a trust-region method that guarantees global convergence by adaptively refining the SG and ROM until a proposed error indicator drops below a tolerance specified by trust-region convergence theory. A key feature of the proposed method is that the error indicator---which accounts for errors incurred by both the SG and ROM---must be only an asymptotic error bound, i.e., a bound that holds up to an arbitrary constant that need not be computed. This allows the approach to be applicable to a wide range of problems, including those where sharp, computable error bounds are not available; this distinguishes the proposed method from previous works. Numerical experiments performed on a model problem from optimal flow control under uncertainty verify global convergence of the method and demonstrate the method's ability to outperform previously proposed alternatives.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2013

Normality of Monte Carlo criticality eigenfunction decomposition coefficients

A proof is presented, which shows that after a single Monte Carlo (MC) neutron transport power method iteration without normalization, the coefficients of an eigenfunction decomposition of the fission source density are normally distributed when using analog or implicit capture MC. Using a Pearson correlation coefficient test, the proof is corroborated by results from a uniform slab reactor problem, and those results also suggest that the coefficients are normally distributed with normalization. The proof and numerical test results support the application of earlier work on the convergence of eigenfunctions under stochastic operators. Knowledge of the Gaussian shape of decomposition coefficients allows researchers to determine an appropriate level of confidence in the distribution of fission sites taken from a MC simulation. This knowledge of the shape of the probability distributions of decomposition coefficients encourages the creation of new predictive convergence diagnostics. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2026

Adaptive Sampling-Based Bi-Fidelity Stochastic Trust Region Method for Stochastic Derivative-Free Optimization

Bi-fidelity stochastic optimization has gained increasing attention as an efficient approach to reduce computational costs by leveraging a low-fidelity (LF) model to optimize an expensive high-fidelity (HF) objective. In this paper, we propose ASTRO-BFDF, an adaptive sampling trust-region method specifically designed for unconstrained bi-fidelity stochastic derivative-free optimization problems. In ASTRO-BFDF, the LF function serves two purposes: (i) to identify better iterates for the HF function when the optimization process indicates a high correlation between them and (ii) to reduce the variance of the HF function estimates using bi-fidelity Monte Carlo (BFMC). The algorithm dynamically determines sample sizes while adaptively choosing between crude Monte Carlo and BFMC to balance the trade-off between optimization and sampling errors. We prove that the iterates generated by ASTRO-BFDF converge to a first-order stationary point almost surely. Additionally, we demonstrate the effectiveness of the proposed algorithm through numerical experiments on synthetic benchmarks and simulation optimization problems involving discrete event systems.

97 MATHEMATICS AND COMPUTING↗