Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “stochastic”

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 811 records · Page 45

A domain adaptive stochastic collocation approach for analysis of MEMS under uncertainties

This work proposes a domain adaptive stochastic collocation approach for uncertainty quantification, suitable for effective handling of discontinuities or sharp variations in the random domain. The basic idea of the proposed methodology is to adaptively decompose the random domain into subdomains. Within each subdomain, a sparse grid interpolant is constructed using the classical Smolyak construction [S. Smolyak, Quadrature and interpolation formulas for tensor products of certain classes of functions, Soviet Math. Dokl. 4 (1963) 240-243], to approximate the stochastic solution locally. The adaptive strategy is governed by the hierarchical surpluses, which are computed as part of the interpolation procedure. These hierarchical surpluses then serve as an error indicator for each subdomain, and lead to subdivision whenever it becomes greater than a threshold value. The hierarchical surpluses also provide information about the more important dimensions, and accordingly the random elements can be split along those dimensions. The proposed adaptive approach is employed to quantify the effect of uncertainty in input parameters on the performance of micro-electromechanical systems (MEMS). Specifically, we study the effect of uncertain material properties and geometrical parameters on the pull-in behavior and actuation properties of a MEMS switch. Using the adaptive approach, we resolve the pull-in instability in MEMS switches. The results from the proposed approach are verified using Monte Carlo simulations and it is demonstrated that it computes the required statistics effectively.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An adaptive algorithm for simulation of stochastic reaction-diffusion processes

We propose an adaptive hybrid method suitable for stochastic simulation of diffusion dominated reaction-diffusion processes. For such systems, simulation of the diffusion requires the predominant part of the computing time. In order to reduce the computational work, the diffusion in parts of the domain is treated macroscopically, in other parts with the tau-leap method and in the remaining parts with Gillespie's stochastic simulation algorithm (SSA) as implemented in the next subvolume method (NSM). The chemical reactions are handled by SSA everywhere in the computational domain. A trajectory of the process is advanced in time by an operator splitting technique and the timesteps are chosen adaptively. The spatial adaptation is based on estimates of the errors in the tau-leap method and the macroscopic diffusion. The accuracy and efficiency of the method are demonstrated in examples from molecular biology where the domain is discretized by unstructured meshes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Stochastic finite difference lattice Boltzmann method for steady incompressible viscous flows

With the advent of state-of-the-art computers and their rapid availability, the time is ripe for the development of efficient uncertainty quantification (UQ) methods to reduce the complexity of numerical models used to simulate complicated systems with incomplete knowledge and data. The spectral stochastic finite element method (SSFEM) which is one of the widely used UQ methods, regards uncertainty as generating a new dimension and the solution as dependent on this dimension. A convergent expansion along the new dimension is then sought in terms of the polynomial chaos system, and the coefficients in this representation are determined through a Galerkin approach. This approach provides an accurate representation even when only a small number of terms are used in the spectral expansion; consequently, saving in computational resource can be realized compared to the Monte Carlo (MC) scheme. Recent development of a finite difference lattice Boltzmann method (FDLBM) that provides a convenient algorithm for setting the boundary condition allows the flow of Newtonian and non-Newtonian fluids, with and without external body forces to be simulated with ease. Also, the inherent compressibility effect in the conventional lattice Boltzmann method, which might produce significant errors in some incompressible flow simulations, is eliminated. As such, the FDLBM together with an efficient UQ method can be used to treat incompressible flows with built in uncertainty, such as blood flow in stenosed arteries. The objective of this paper is to develop a stochastic numerical solver for steady incompressible viscous flows by combining the FDLBM with a SSFEM. Validation against MC solutions of channel/Couette, driven cavity, and sudden expansion flows are carried out.

97 MATHEMATICS AND COMPUTING↗

Numerical study of a stochastic particle algorithm solving a multidimensional population balance model for high shear granulation

This paper is concerned with computational aspects of a multidimensional population balance model of a wet granulation process. Wet granulation is a manufacturing method to form composite particles, granules, from small particles and binders. A detailed numerical study of a stochastic particle algorithm for the solution of a five-dimensional population balance model for wet granulation is presented. Each particle consists of two types of solids (containing pores) and of external and internal liquid (located in the pores). Several transformations of particles are considered, including coalescence, compaction and breakage. A convergence study is performed with respect to the parameter that determines the number of numerical particles. Averaged properties of the system are computed. In addition, the ensemble is subdivided into practically relevant size classes and analysed with respect to the amount of mass and the particle porosity in each class. These results illustrate the importance of the multidimensional approach. Finally, the kinetic equation corresponding to the stochastic model is discussed.

97 MATHEMATICS AND COMPUTING↗

Note on coefficient matrices from stochastic Galerkin methods for random diffusion equations

In a recent work by Xiu and Shen [D. Xiu, J. Shen, Efficient stochastic Galerkin methods for random diffusion equations, J. Comput. Phys. 228 (2009) 266-281], the Galerkin methods are used to solve stochastic diffusion equations in random media, where some properties for the coefficient matrix of the resulting system are provided. They also posed an open question on the properties of the coefficient matrix. In this work, we will provide some results related to the open question.

97 MATHEMATICS AND COMPUTING↗

Adaptive mesh refinement for stochastic reaction-diffusion processes

We present an algorithm for adaptive mesh refinement applied to mesoscopic stochastic simulations of spatially evolving reaction-diffusion processes. The transition rates for the diffusion process are derived on adaptive, locally refined structured meshes. Convergence of the diffusion process is presented and the fluctuations of the stochastic process are verified. Furthermore, a refinement criterion is proposed for the evolution of the adaptive mesh. The method is validated in simulations of reaction-diffusion processes as described by the Fisher-Kolmogorov and Gray-Scott equations.

97 MATHEMATICS AND COMPUTING↗

Exploring the performance of spatial stochastic simulation algorithms

Since the publication of Gillespie's direct method, diverse methods have been developed to improve the performance of stochastic simulation methods and to enter the spatial realm. In this paper we discuss a spatial {tau}-leaping variant (S{tau}) that extends the basic leap method. S{tau} takes reaction and both outgoing and incoming diffusion events into account when calculating a leap candidate. A performance analysis shall reveal details on the achieved success in balancing speed and accuracy in comparison to other methods. However, performance analysis of spatial stochastic algorithms requires significant effort - it is crucial to choose suitable (benchmark) models and to carefully define model and simulation setups that take problem and simulation design spaces into account.

97 MATHEMATICS AND COMPUTING↗

Stochastic weighted particle methods for population balance equations

Highlights: {yields} Weight transfer functions for Monte Carlo simulation of coagulation. {yields} Efficient support for single-particle growth processes. {yields} Comparisons to analytic solutions and soot formation problems. {yields} Better numerical accuracy for less common particles. - Abstract: A class of coagulation weight transfer functions is constructed, each member of which leads to a stochastic particle algorithm for the numerical treatment of population balance equations. These algorithms are based on systems of weighted computational particles and the weight transfer functions are constructed such that the number of computational particles does not change during coagulation events. The algorithms also facilitate the simulation of physical processes that change single particles, such as growth, or other surface reactions. Four members of the algorithm family have been numerically validated by comparison to analytic solutions to simple problems. Numerical experiments have been performed for complex laminar premixed flame systems in which members of the class of stochastic weighted particle methods were compared to each other and to a direct simulation algorithm. Two of the weighted algorithms have been shown to offer performance advantages over the direct simulation algorithm in situations where interest is focused on the larger particles in a system. The extent of this advantage depends on the particular system and on the quantities of interest.

97 MATHEMATICS AND COMPUTING↗

Assimilating irregularly spaced sparsely observed turbulent signals with hierarchical Bayesian reduced stochastic filters

In this paper, we consider a practical filtering approach for assimilating irregularly spaced, sparsely observed turbulent signals through a hierarchical Bayesian reduced stochastic filtering framework. The proposed hierarchical Bayesian approach consists of two steps, blending a data-driven interpolation scheme and the Mean Stochastic Model (MSM) filter. We examine the potential of using the deterministic piecewise linear interpolation scheme and the ordinary kriging scheme in interpolating irregularly spaced raw data to regularly spaced processed data and the importance of dynamical constraint (through MSM) in filtering the processed data on a numerically stiff state estimation problem. In particular, we test this approach on a two-layer quasi-geostrophic model in a two-dimensional domain with a small radius of deformation to mimic ocean turbulence. Our numerical results suggest that the dynamical constraint becomes important when the observation noise variance is large. Second, we find that the filtered estimates with ordinary kriging are superior to those with linear interpolation when observation networks are not too sparse; such robust results are found from numerical simulations with many randomly simulated irregularly spaced observation networks, various observation time intervals, and observation error variances. Third, when the observation network is very sparse, we find that both the kriging and linear interpolations are comparable.

97 MATHEMATICS AND COMPUTING↗

An iterative stochastic ensemble method for parameter estimation of subsurface flow models

Parameter estimation for subsurface flow models is an essential step for maximizing the value of numerical simulations for future prediction and the development of effective control strategies. We propose the iterative stochastic ensemble method (ISEM) as a general method for parameter estimation based on stochastic estimation of gradients using an ensemble of directional derivatives. ISEM eliminates the need for adjoint coding and deals with the numerical simulator as a blackbox. The proposed method employs directional derivatives within a Gauss–Newton iteration. The update equation in ISEM resembles the update step in ensemble Kalman filter, however the inverse of the output covariance matrix in ISEM is regularized using standard truncated singular value decomposition or Tikhonov regularization. We also investigate the performance of a set of shrinkage based covariance estimators within ISEM. The proposed method is successfully applied on several nonlinear parameter estimation problems for subsurface flow models. The efficiency of the proposed algorithm is demonstrated by the small size of utilized ensembles and in terms of error convergence rates.

97 MATHEMATICS AND COMPUTING↗

Tau leaping of stiff stochastic chemical systems via local central limit approximation

Stiffness manifests in stochastic dynamic systems in a more complex manner than in deterministic systems; it is not only important for a time-stepping method to remain stable but it is also important for the method to capture the asymptotic variances accurately. In the context of stochastic chemical systems, time stepping methods are known as tau leaping. Well known existing tau leaping methods have shortcomings in this regard. The implicit tau method is far more stable than the trapezoidal tau method but underestimates the asymptotic variance. On the other hand, the trapezoidal tau method which estimates the asymptotic variance exactly for linear systems suffers from the fact that the transients of the method do not decay fast enough in the context of very stiff systems. We propose a tau leaping method that possesses the same stability properties as the implicit method while it also captures the asymptotic variance with reasonable accuracy at least for the test system S{sub 1}↔S{sub 2}. The proposed method uses a central limit approximation (CLA) locally over the tau leaping interval and is referred to as the LCLA-τ. The CLA predicts the mean and covariance as solutions of certain differential equations (ODEs) and for efficiency we solve these using a single time step of a suitable low order method. We perform a mean/covariance stability analysis of various possible low order schemes to determine the best scheme. Numerical experiments presented show that LCLA-τ performs favorably for stiff systems and that the LCLA-τ is also able to capture bimodal distributions unlike the CLA itself. The proposed LCLA-τ method uses a split implicit step to compute the mean update. We also prove that any tau leaping method employing a split implicit step converges in the fluid limit to the implicit Euler method as applied to the fluid limit differential equation.

97 MATHEMATICS AND COMPUTING↗

A dynamically bi-orthogonal method for time-dependent stochastic partial differential equations II: Adaptivity and generalizations

This is part II of our paper in which we propose and develop a dynamically bi-orthogonal method (DyBO) to study a class of time-dependent stochastic partial differential equations (SPDEs) whose solutions enjoy a low-dimensional structure. In part I of our paper [9], we derived the DyBO formulation and proposed numerical algorithms based on this formulation. Some important theoretical results regarding consistency and bi-orthogonality preservation were also established in the first part along with a range of numerical examples to illustrate the effectiveness of the DyBO method. In this paper, we focus on the computational complexity analysis and develop an effective adaptivity strategy to add or remove modes dynamically. Our complexity analysis shows that the ratio of computational complexities between the DyBO method and a generalized polynomial chaos method (gPC) is roughly of order O((m/N{sub p}){sup 3}) for a quadratic nonlinear SPDE, where m is the number of mode pairs used in the DyBO method and N{sub p} is the number of elements in the polynomial basis in gPC. The effective dimensions of the stochastic solutions have been found to be small in many applications, so we can expect m is much smaller than N{sub p} and computational savings of our DyBO method against gPC are dramatic. The adaptive strategy plays an essential role for the DyBO method to be effective in solving some challenging problems. Another important contribution of this paper is the generalization of the DyBO formulation for a system of time-dependent SPDEs. Several numerical examples are provided to demonstrate the effectiveness of our method, including the Navier–Stokes equations and the Boussinesq approximation with Brownian forcing.

97 MATHEMATICS AND COMPUTING↗

A stochastic approach to the solution of magnetohydrodynamic equations

The construction of stochastic solutions is a powerful method to obtain localized solutions in configuration or Fourier space and for parallel computation with domain decomposition. Here a stochastic solution is obtained for the magnetohydrodynamics equations. Some details are given concerning the numerical implementation of the solution which is illustrated by an example of generation of long-range magnetic fields by a velocity source.

97 MATHEMATICS AND COMPUTING↗

Application of stochastic weighted algorithms to a multidimensional silica particle model

Highlights: •Stochastic weighted algorithms (SWAs) are developed for a detailed silica model. •An implementation of SWAs with the transition kernel is presented. •The SWAs’ solutions converge to the direct simulation algorithm’s (DSA) solution. •The efficiency of SWAs is evaluated for this multidimensional particle model. •It is shown that SWAs can be used for coagulation problems in industrial systems. -- Abstract: This paper presents a detailed study of the numerical behaviour of stochastic weighted algorithms (SWAs) using the transition regime coagulation kernel and a multidimensional silica particle model. The implementation in the SWAs of the transition regime coagulation kernel and associated majorant rates is described. The silica particle model of Shekar et al. [S. Shekar, A.J. Smith, W.J. Menz, M. Sander, M. Kraft, A multidimensional population balance model to describe the aerosol synthesis of silica nanoparticles, Journal of Aerosol Science 44 (2012) 83–98] was used in conjunction with this coagulation kernel to study the convergence properties of SWAs with a multidimensional particle model. High precision solutions were calculated with two SWAs and also with the established direct simulation algorithm. These solutions, which were generated using large number of computational particles, showed close agreement. It was thus demonstrated that SWAs can be successfully used with complex coagulation kernels and high dimensional particle models to simulate real-world systems.

97 MATHEMATICS AND COMPUTING↗

A one-time truncate and encode multiresolution stochastic framework

In this work a novel adaptive strategy for stochastic problems, inspired from the classical Harten's framework, is presented. The proposed algorithm allows building, in a very general manner, stochastic numerical schemes starting from a whatever type of deterministic schemes and handling a large class of problems, from unsteady to discontinuous solutions. Its formulations permits to recover the same results concerning the interpolation theory of the classical multiresolution approach, but with an extension to uncertainty quantification problems. The present strategy permits to build numerical scheme with a higher accuracy with respect to other classical uncertainty quantification techniques, but with a strong reduction of the numerical cost and memory requirements. Moreover, the flexibility of the proposed approach allows to employ any kind of probability density function, even discontinuous and time varying, without introducing further complications in the algorithm. The advantages of the present strategy are demonstrated by performing several numerical problems where different forms of uncertainty distributions are taken into account, such as discontinuous and unsteady custom-defined probability density functions. In addition to algebraic and ordinary differential equations, numerical results for the challenging 1D Kraichnan–Orszag are reported in terms of accuracy and convergence. Finally, a two degree-of-freedom aeroelastic model for a subsonic case is presented. Though quite simple, the model allows recovering some physical key aspect, on the fluid/structure interaction, thanks to the quasi-steady aerodynamic approximation employed. The injection of an uncertainty is chosen in order to obtain a complete parameterization of the mass matrix. All the numerical results are compared with respect to classical Monte Carlo solution and with a non-intrusive Polynomial Chaos method.

97 MATHEMATICS AND COMPUTING↗

Application of stochastic Galerkin FEM to the complete electrode model of electrical impedance tomography

The aim of electrical impedance tomography is to determine the internal conductivity distribution of some physical body from boundary measurements of current and voltage. The most accurate forward model for impedance tomography is the complete electrode model, which consists of the conductivity equation coupled with boundary conditions that take into account the electrode shapes and the contact resistances at the corresponding interfaces. If the reconstruction task of impedance tomography is recast as a Bayesian inference problem, it is essential to be able to solve the complete electrode model forward problem with the conductivity and the contact resistances treated as a random field and random variables, respectively. In this work, we apply a stochastic Galerkin finite element method to the ensuing elliptic stochastic boundary value problem and compare the results with Monte Carlo simulations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

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 model and variance reduction method for computing statistical outputs of stochastic elliptic partial differential equations

We present a model and variance reduction method for the fast and reliable computation of statistical outputs of stochastic elliptic partial differential equations. Our method consists of three main ingredients: (1) the hybridizable discontinuous Galerkin (HDG) discretization of elliptic partial differential equations (PDEs), which allows us to obtain high-order accurate solutions of the governing PDE; (2) the reduced basis method for a new HDG discretization of the underlying PDE to enable real-time solution of the parameterized PDE in the presence of stochastic parameters; and (3) a multilevel variance reduction method that exploits the statistical correlation among the different reduced basis approximations and the high-fidelity HDG discretization to accelerate the convergence of the Monte Carlo simulations. The multilevel variance reduction method provides efficient computation of the statistical outputs by shifting most of the computational burden from the high-fidelity HDG approximation to the reduced basis approximations. Furthermore, we develop a posteriori error estimates for our approximations of the statistical outputs. Based on these error estimates, we propose an algorithm for optimally choosing both the dimensions of the reduced basis approximations and the sizes of Monte Carlo samples to achieve a given error tolerance. We provide numerical examples to demonstrate the performance of the proposed method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗