Search NASA⌕ Search

SEARCH · Search NASA

Results for “implicit 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 199 records · Page 11

Exactly energy conserving semi-implicit particle in cell formulation

We report a new particle in cell (PIC) method based on the semi-implicit approach. The novelty of the new method is that unlike any of its semi-implicit predecessors at the same time it retains the explicit computational cycle and conserves energy exactly. Recent research has presented fully implicit methods where energy conservation is obtained as part of a non-linear iteration procedure. The new method (referred to as Energy Conserving Semi-Implicit Method, ECSIM), instead, does not require any non-linear iteration and its computational cycle is similar to that of explicit PIC. The properties of the new method are: i) it conserves energy exactly to round-off for any time step or grid spacing; ii) it is unconditionally stable in time, freeing the user from the need to resolve the electron plasma frequency and allowing the user to select any desired time step; iii) it eliminates the constraint of the finite grid instability, allowing the user to select any desired resolution without being forced to resolve the Debye length; iv) the particle mover has a computational complexity identical to that of the explicit PIC, only the field solver has an increased computational cost. The new ECSIM is tested in a number of benchmarks where accuracy and computational performance are tested. - Highlights: • We present a new fully energy conserving semi-implicit particle in cell (PIC) method based on the implicit moment method (IMM). The new method is called Energy Conserving Implicit Moment Method (ECIMM). • The novelty of the new method is that unlike any of its predecessors at the same time it retains the explicit computational cycle and conserves energy exactly. • The new method is unconditionally stable in time, freeing the user from the need to resolve the electron plasma frequency. • The new method eliminates the constraint of the finite grid instability, allowing the user to select any desired resolution without being forced to resolve the Debye length. • These features are achieved at a reduced cost compared with either previous IMM or fully implicit implementation of PIC.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A scalable and adaptable solution framework within components of the CCSM

A framework for a fully implicit solution method is implemented into (1) the High Order Methods Modeling Environment (HOMME), which is a spectral element dynamical core option in the Community Atmosphere Model (CAM), and (2) the Parallel Ocean Program (POP) model of the global ocean. Both of these models are components of the Community Climate System Model (CCSM). HOMME is a development version of CAM and provides a scalable alternative when run with an explicit time integrator. However, it suffers the typical time step size limit to maintain stability. POP uses a time-split semi-implicit time integrator that allows larger time steps but less accuracy when used with scale interacting physics. A fully implicit solution framework allows larger time step sizes and additional climate analysis capability such as model steady state and spin-up efficiency gains without a loss in scalability. This framework is implemented into HOMME and POP using a new Fortran interface to the Trilinos solver library, ForTrilinos, which leverages several new capabilities in the current Fortran standard to maximize robustness and speed. The ForTrilinos solution template was also designed for interchangeability; other solution methods and capability improvements can be more easily implemented into the models as they are developed without severely interacting with the code structure. The utility of this approach is illustrated with a test case for each of the climate component models.

54 ENVIRONMENTAL SCIENCES↗

Hybrid optimization and Bayesian inference techniques for a non-smooth radiation detection problem

In this paper, we propose several algorithms to recover the location and intensity of a radiation source located in a simulated 250 × 180 m block of an urban center based on synthetic measurements. Radioactive decay and detection are Poisson random processes, so we employ likelihood functions based on this distribution. Owing to the domain geometry and the proposed response model, the negative logarithm of the likelihood is only piecewise continuous differentiable, and it has multiple local minima. To address these difficulties, we investigate three hybrid algorithms composed of mixed optimization techniques. For global optimization, we consider simulated annealing, particle swarm, and genetic algorithm, which rely solely on objective function evaluations; that is, they do not evaluate the gradient in the objective function. By employing early stopping criteria for the global optimization methods, a pseudo-optimum point is obtained. This is subsequently utilized as the initial value by the deterministic implicit filtering method, which is able to find local extrema in non-smooth functions, to finish the search in a narrow domain. These new hybrid techniques, combining global optimization and implicit filtering address, difficulties associated with the non-smooth response, and their performances, are shown to significantly decrease the computational time over the global optimization methods. To quantify uncertainties associated with the source location and intensity, we employ the delayed rejection adaptive Metropolis and DiffeRential Evolution Adaptive Metropolis algorithms. Finally, marginal densities of the source properties are obtained, and the means of the chains compare accurately with the estimates produced by the hybrid algorithms.

42 ENGINEERING↗

Discretization of Stationary Solutions of Stochastic Systems Driven by Fractional Brownian Motion

In this article we study the behavior of dissipative systems with additive fractional noise of any Hurst parameter. Under a one-sided dissipative Lipschitz condition on the drift the continuous stochastic system is shown to have a unique stationary solution, which pathwise attracts all other solutions. The same holds for the discretized stochastic system, if the drift-implicit Euler method is used for the discretization. Moreover, the unique stationary solution of the drift-implicit Euler scheme converges to the unique stationary solution of the original system as the stepsize of the discretization decreases.

97 MATHEMATICS AND COMPUTING↗

A stabilized Runge–Kutta–Legendre method for explicit super-time-stepping of parabolic and mixed equations

Parabolic partial differential equations appear in several physical problems, including problems that have a dominant hyperbolic part coupled to a sub-dominant parabolic component. Explicit methods for their solution are easy to implement but have very restrictive time step constraints. Implicit solution methods can be unconditionally stable but have the disadvantage of being computationally costly or difficult to implement. Super-time-stepping methods for treating parabolic terms in mixed type partial differential equations occupy an intermediate position. In such methods each superstep takes “s” explicit Runge–Kutta-like time-steps to advance the parabolic terms by a time-step that is s{sup 2} times larger than a single explicit time-step. The expanded stability is usually obtained by mapping the short recursion relation of the explicit Runge–Kutta scheme to the recursion relation of some well-known, stable polynomial. Prior work has built temporally first- and second-order accurate super-time-stepping methods around the recursion relation associated with Chebyshev polynomials. Since their stability is based on the boundedness of the Chebyshev polynomials, these methods have been called RKC1 and RKC2. In this work we build temporally first- and second-order accurate super-time-stepping methods around the recursion relation associated with Legendre polynomials. We call these methods RKL1 and RKL2. The RKL1 method is first-order accurate in time; the RKL2 method is second-order accurate in time. We verify that the newly-designed RKL1 and RKL2 schemes have a very desirable monotonicity preserving property for one-dimensional problems – a solution that is monotone at the beginning of a time step retains that property at the end of that time step. It is shown that RKL1 and RKL2 methods are stable for all values of the diffusion coefficient up to the maximum value. We call this a convex monotonicity preserving property and show by examples that it is very useful in parabolic problems with variable diffusion coefficients. This includes variable coefficient parabolic equations that might give rise to skew symmetric terms. The RKC1 and RKC2 schemes do not share this convex monotonicity preserving property. One-dimensional and two-dimensional von Neumann stability analyses of RKC1, RKC2, RKL1 and RKL2 are also presented, showing that the latter two have some advantages. The paper includes several details to facilitate implementation. A detailed accuracy analysis is presented to show that the methods reach their design accuracies. A stringent set of test problems is also presented. To demonstrate the robustness and versatility of our methods, we show their successful operation on problems involving linear and non-linear heat conduction and viscosity, resistive magnetohydrodynamics, ambipolar diffusion dominated magnetohydrodynamics, level set methods and flux limited radiation diffusion. In a prior paper (Meyer, Balsara and Aslam 2012 [36]) we have also presented an extensive test-suite showing that the RKL2 method works robustly in the presence of shocks in an anisotropically conducting, magnetized plasma.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

IS&T CoDesign Summer School 2012 Lessons Learned: A 2D, implicit, energy- and charge- conserving electromagnetic particle in cell method [Slides]

Recently, a fully implicit electrostatic 1D charge- and energy- conserving particle-in-cell algorithm was proposed and implemented. Central to the algorithm is an advanced particle pusher. Particles are moved using an energy conserving scheme and are forced to stop at cell faces to conserve charge. Moreover, a time estimator is used to control errors in momentum. Here we implement and extend this advanced particle pusher to include 2D and electromagetic fields. Special consideration is taken to ensure easy coupling into the implicit moment. Focus is then given to optimizing the presented particle pusher on emerging architectures. Two multicore implementations, and one GPU (Graphics Processing Unit) implementation are discussed and analyzed.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Itô-SDE MCMC method for Bayesian characterization of errors associated with data limitations in stochastic expansion methods for uncertainty quantification

This paper is concerned with the characterization and the propagation of errors associated with data limitations in polynomial-chaos-based stochastic methods for uncertainty quantification. Such an issue can arise in uncertainty quantification when only a limited amount of data is available. When the available information does not suffice to accurately determine the probability distributions that must be assigned to the uncertain variables, the Bayesian method for assigning these probability distributions becomes attractive because it allows the stochastic model to account explicitly for insufficiency of the available information. In previous work, such applications of the Bayesian method had already been implemented by using the Metropolis–Hastings and Gibbs Markov Chain Monte Carlo (MCMC) methods. In this paper, we present an alternative implementation, which uses an alternative MCMC method built around an Itô stochastic differential equation (SDE) that is ergodic for the Bayesian posterior. We draw together from the mathematics literature a number of formal properties of this Itô SDE that lend support to its use in the implementation of the Bayesian method, and we describe its discretization, including the choice of the free parameters, by using the implicit Euler method. We demonstrate the proposed methodology on a problem of uncertainty quantification in a complex nonlinear engineering application relevant to metal forming.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Generalization of the FDTD algorithm for simulations of hydrodynamic nonlinear Drude model

In this paper we present a numerical method for solving a three-dimensional cold-plasma system that describes electron gas dynamics driven by an external electromagnetic wave excitation. The nonlinear Drude dispersion model is derived from the cold-plasma fluid equations and is coupled to the Maxwell's field equations. The Finite-Difference Time-Domain (FDTD) method is applied for solving the Maxwell's equations in conjunction with the time-split semi-implicit numerical method for the nonlinear dispersion and a physics based treatment of the discontinuity of the electric field component normal to the dielectric-metal interface. The application of the proposed algorithm is illustrated by modeling light pulse propagation and second-harmonic generation (SHG) in metallic metamaterials (MMs), showing good agreement between computed and published experimental results.

97 MATHEMATICS AND COMPUTING↗

A class of efficient difference method for time fractional reaction–diffusion equation

The fractional reaction–diffusion equation has profound physical background and theoretical connotation, and its numerical methods are of great scientific significance and practical value. In this paper, a class of explicit–implicit (E–I) difference method and implicit–explicit (I–E) difference method are proposed for one-dimensional time fractional reaction–diffusion equation. The methods are constructed by combining classical explicit scheme and classical implicit scheme. The existence, uniqueness and convergence of solutions are given for E–I and I–E schemes. Theoretical analysis and numerical experiments show that the E–I and I–E schemes are unconditionally stable, with second-order spatial accuracy and 2−α order temporal accuracy. Compared with the classical implicit difference method with the similar accuracy, the computation time of the presented methods is improved by nearly 41%. It is shown that the E–I difference method and I–E difference method are effective for solving the time fractional reaction–diffusion equation.

97 MATHEMATICS AND COMPUTING↗

Initial performance of fully-coupled AMG and approximate block factorization preconditioners for solution of implicit FE resistive MHD.

This brief paper explores the development of scalable, nonlinear, fully-implicit solution methods for a stabilized unstructured finite element (FE) discretization of the 2D incompressible (reduced) resistive MHD system. The discussion considers the stabilized FE formulation in context of a fully-implicit time integration and direct-to-steady-state solution capability. The nonlinear solver strategy employs Newton-Krylov methods, which are preconditioned using fully-coupled algebraic multilevel (AMG) techniques and a new approximate block factorization (ABF) preconditioner. The intent of these preconditioners is to enable robust, scalable and efficient solution approaches for the large-scale sparse linear systems generated by the Newton linearization. We present results for the fully-coupled AMG preconditioner for two prototype problems, a low Lundquist number MHD Faraday conduction pump and moderately-high Lundquist number incompressible magnetic island coalescence problem. For the MHD pump results we explore the scaling of the fully-coupled AMG preconditioner for up to 4096 processors for problems with up to 64M unknowns on a CrayXT3/4. Using the island coalescence problem we explore the weak scaling of the AMG preconditioner and the influence of the Lundquist number on the iteration count. Finally we present some very recent results for the algorithmic scaling of the ABF preconditioner.

99 GENERAL AND MISCELLANEOUS↗

Accuracy analysis of a spectral element atmospheric model using a fully implicit solution framework

A fully implicit (FI) time integration method has been implemented into a spectral finite element shallow water equation model on a sphere, and it is compared to existing fully explicit leapfrog and semi-implicit methods for a suite of test cases. This experiment is designed to determine the time step sizes that minimize simulation time while maintaining sufficient accuracy for these problems. For test cases without an analytical solution from which to compare, it is demonstrated that time step sizes 30 to 60 times larger than the gravity wave stability limits and 6 to 20 times larger than the advective scale stability limits are possible using the FI method without a loss in accuracy, depending on the problem being solved. For a steady-state test case, the FI method produces error within machine accuracy limits as with existing methods, but using an arbitrarily large time step size.

54 ENVIRONMENTAL SCIENCES↗

Kinetic Simulation of Collisional Magnetized Plasmas with Semi-implicit Time Integration

Plasmas with varying collisionalities occur in many applications, such as tokamak edge regions, where the flows are characterized by significant variations in density and temperature. While a kinetic model is necessary for weakly-collisional high-temperature plasmas, high collisionality in colder regions render the equations numerically stiff due to disparate time scales. In this study, we propose an implicit–explicit algorithm for such cases, where the collisional term is integrated implicitly in time, while the advective term is integrated explicitly in time, thus allowing time step sizes that are comparable to the advective time scales. This partitioning results in a more efficient algorithm than those using explicit time integrators, where the time step sizes are constrained by the stiff collisional time scales. Finally, we implement semi-implicit additive Runge–Kutta methods in COGENT, a high-order finite-volume gyrokinetic code and test the accuracy, convergence, and computational cost of these semi-implicit methods for test cases with highly-collisional plasmas.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Implicit shock tracking for unsteady flows by the method of lines

Here, a recently developed high-order implicit shock tracking (HOIST) framework for resolving discontinuous solutions of inviscid, steady conservation laws is extended to the unsteady case. Central to the framework is an optimization problem which simultaneously computes a discontinuity-aligned mesh and the corresponding high-order approximation to the flow, which provides nonlinear stabilization and a high-order approximation to the solution. This work extends the implicit shock tracking framework to the case of unsteady conservation laws using a method of lines discretization via a diagonally implicit Runge-Kutta method by “solving a steady problem at each timestep”. We formulate and solve an optimization problem that produces a feature-aligned mesh and solution at each Runge-Kutta stage of each timestep, and advance this solution in time by standard Runge-Kutta update formulas. A Rankine-Hugoniot based prediction of the shock location together with a high-order, untangling mesh smoothing procedure provides a high-quality initial guess for the optimization problem at each time, which results in rapid convergence of the sequential quadratic programing (SQP) optimization solver. This method is shown to deliver highly accurate solutions on coarse, high-order discretizations without nonlinear stabilization and recover the design accuracy of the Runge-Kutta scheme. We demonstrate this framework on a series of inviscid, unsteady conservation laws in both one- and two- dimensions. We also verify that our method is able to recover the design order of accuracy of our time integrator in the presence of a strong discontinuity.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Coarse-grained simulations of vortex dynamics and transition in complex high-Re flows

Turbulent flow complexity in applications in engineering, geophysics and astrophysics typically requires achieving accurate and dependable large scale predictions of highly nonlinear processes with under-resolved computer simulation models. Laboratory observations typically demonstrate the end outcome of complex non-linear three-dimensional physical processes with many unexplained details and mechanisms. Carefully controlled computational experiments based on the numerical solution of the conservation equations for mass, momentum, and energy, provide insights into the underlying flow dynamics. Relevant computational fluid dynamics issues to be addressed relate to the modeling of the unresolved tlow conditions at the subgrid scale (SGS) level - within a computational cell, and at the supergrid (SPG) scale - at initialization and beyond computational boundaries. SGS and SPG information must be prescribed for closure of the equations solved numerically. SGS models appear explicitly or implicitly as additional source tenns in the modified flow equations solved by the numerical solutions being calculated, while SPG models provide the necessary set of initial and boundary conditions that must be prescribed to ensure unique well-posed solutions. From this perspective, it is clear that the simulation process is inherently determined by the SGS and SPG information prescription process. On the other hand, observables in laboratory experiments are always characterized by the finite scales of the instrumental resolution of measuring/visualizing devices, and subject as well to SPG issues. It is thus important to recognize the inherently intrusive nature of observations based on numerical or laboratory experiments. Ultimately, verification and validation (V & V) frameworks and appropriate metrics for the specific problems at hand are needed to establish predictability of the simulation model. Direct numerical simulation (DNS) - resolving all relevant space/time scales, is prohibitively expensive in the foreseeable future for most practical flows of interest at moderate-to-high Reynolds number (Re). On the other end of the simulation spectrum are the Reynolds-Averaged Navier-Stokes (RANS) approaches - which model the turbulent effects. In the coarsegrained large eddy simulation (LES) strategies, the large energy containing structures are resolved, the smaller structures are filtered out, and unresolved SGS effects are modeled. By necessity - rather than choice, LES effectively becomes the intermediate approach between DNS and RANS. Extensive work has demonstrated that predictive simulations of turbulent velocity fields are possible using a particular LES denoted implicit LES (ILES), using the class of nonoscillatory finite-volume (NFV) numerical algorithms. Use of the modified equation as framework for theoretical analysis, demonstrates that leading truncation tenns associated with NFV methods provide implicit SGS models of mixed anisotropic type and regularized motion of discrete observables. Tests in fundamental applications ranging from canonical to very complex flows indicate that ILES is competitive with conventional LES in the LES realm proper - flows driven by large scale features. High-Re flows are vortex dominated and governed by short convective timescales compared to those of diffusion, and kinematically characterized at the smallest scales by slender worm vortices with insignificant internal structure. This motivates nominally inviscid ILES methods capable of capturing the high-Re dissipation dynamics and of handling vortices as shocks in shock capturing schemes. Depending on flow regimes, initial conditions, and resolution, additional modeling may be needed to emulate SGS driven physics, such as backscatter, chemical reaction, material mixing, and near-wall flow-dynamics - where typically-intertwined SGS/SPG issues need to be addressed. A major research focus is recognizing when additional explicit models and/or numerical treatments are needed and ensuring that mixed explicit and implicit SGS models can effectively act in collaborative rather than interfering fashion. We survey our present understanding of the theoretical basis of lLES, including connections with the classical LES and finite-scale dynamics perspectives. Examples from recent lLES studies are presented, including canonical turbulence test cases and shock driven turbulence; relevant V & V issues are demonstrated in this context.

58 GEOSCIENCES↗

Evaluation of Density-Functional Tight-Binding Methods for Simulation of Protic Molecular Ion Pairs

In this work, we benchmark the accuracy of the density-functional tight-binding (DFTB) method, namely the long-range corrected second-order (LC-DFTB2) and third-order (DFTB3) models, for predicting energetics of imidazolium-based ionic liquid (IL) ion pairs. We compare the DFTB models against popular density functionals such as LC-ωPBE and B3LYP, using ab initio domain-based local pair-natural orbital coupled cluster (DLPNO-CC) energies as reference. Calculations were carried out in the gas phase, as well as in aqueous solution using implicit solvent methods. We find that the LC-DFTB2 model shows excellent performance in the gas phase and agrees well with reference energies in implicit solvent, often outperforming DFTB3 predictions for complexation energetics. Our study identifies a range of opportunities for use of the LC-DFTB method and quantifies its sensitivity to protonation states and the types of chemical interactions between ion pairs.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Cynod: A Neutronics Code for Pebble Bed Modular Reactor Coupled Transient Analysis

The Pebble Bed Reactor (PBR) is one of the two concepts currently considered for development into the Next Generation Nuclear Plant (NGNP). This interest is due, in particular, to the concept’s inherent safety characteristics. In order to verify and confirm the design safety characteristics of the PBR computational tools must be developed that treat the range of phenomena that are expected to be important for this type of reactors. This paper presents a recently developed 2D R-Z cylindrical nodal kinetics code and shows some of its capabilities by applying it to a set of known and relevant benchmarks. The new code has been coupled to the thermal hydraulics code THERMIX/KONVEK[1] for application to the simulation of very fast transients in PBRs. The new code, CYNOD, has been written starting with a fixed source solver extracted from the nodal cylindrical geometry solver contained within the PEBBED code. The fixed source solver was then incorporated into a kinetic solver.. The new code inherits the spatial solver characteristics of the nodal solver within PEBBED. Thus, the time-dependent neutron diffusion equation expressed analytically in each node of the R-Z cylindrical geometry sub-domain (or node) is transformed into one-dimensional equations by means of the usual transverse integration procedure. The one-dimensional diffusion equations in each of the directions are then solved using the analytic Green’s function method. The resulting equations for the entire domain are then re-cast in the form of the Direct Coarse Mesh Finite Difference (D-CMFD) for convenience of solution. The implicit Euler method is used for the time variable discretization. In order to correctly treat the cusping effect for nodes that contain a partially inserted control rod a method is used that takes advantage of the Green’s function solution available in the intrinsic method. In this corrected treatment, the nodes are re-homogenized using axial flux shapes reconstructed based on the Green’s function method. The performance of the new code is demonstrated by applying it to a delayed supercritical problem and a to the OECD PBMR400 rod ejection benchmark problem. The latter makes use of the coupled CYNOD-THERMIX/KONVEK codes. A final improvement to the code is the subject of a companion paper: a heterogeneous TRISO fuel particle model was devised and incorporated into the code and used to provide an enhanced Doppler treatment. The new code is currently being coupled to the RELAP5-3D code for thermal-hydraulics. The full length paper will include extensive summaries of the equations and algorithm, descriptions of the sample and benchmark problems and details of the results. It is shown, in inter-code comparisons, that the new code correctly predicts the transient behaviors of the test problems.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Asymptotic analysis of discrete schemes for non-equilibrium radiation diffusion

Motivated by providing well-behaved fully discrete schemes in practice, this paper extends the asymptotic analysis on time integration methods for non-equilibrium radiation diffusion in [2] to space discretizations. Therein studies were carried out on a two-temperature model with Larsen's flux-limited diffusion operator, both the implicitly balanced (IB) and linearly implicit (LI) methods were shown asymptotic-preserving. In this paper, we focus on asymptotic analysis for space discrete schemes in dimensions one and two. First, in construction of the schemes, in contrast to traditional first-order approximations, asymmetric second-order accurate spatial approximations are devised for flux-limiters on boundary, and discrete schemes with second-order accuracy on global spatial domain are acquired consequently. Then by employing formal asymptotic analysis, the first-order asymptotic-preserving property for these schemes and furthermore for the fully discrete schemes is shown. Finally, with the help of manufactured solutions, numerical tests are performed, which demonstrate quantitatively the fully discrete schemes with IB time evolution indeed have the accuracy and asymptotic convergence as theory predicts, hence are well qualified for both non-equilibrium and equilibrium radiation diffusion. - Highlights: • Provide AP fully discrete schemes for non-equilibrium radiation diffusion. • Propose second order accurate schemes by asymmetric approach for boundary flux-limiter. • Show first order AP property of spatially and fully discrete schemes with IB evolution. • Devise subtle artificial solutions; verify accuracy and AP property quantitatively. • Ideas can be generalized to 3-dimensional problems and higher order implicit schemes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Pseudo-random number generation for Brownian Dynamics and Dissipative Particle Dynamics simulations on GPU devices

Highlights: {yields} Molecular Dynamics codes implemented on GPUs have achieved two-order of magnitude computational accelerations. {yields} Brownian Dynamics and Dissipative Particle Dynamics simulations require a large number of random numbers per time step. {yields} We introduce a method for generating small batches of pseudorandom numbers distributed over many threads of calculations. {yields} With this method, Dissipative Particle Dynamics is implemented on a GPU device without requiring thread-to-thread communication. - Abstract: Brownian Dynamics (BD), also known as Langevin Dynamics, and Dissipative Particle Dynamics (DPD) are implicit solvent methods commonly used in models of soft matter and biomolecular systems. The interaction of the numerous solvent particles with larger particles is coarse-grained as a Langevin thermostat is applied to individual particles or to particle pairs. The Langevin thermostat requires a pseudo-random number generator (PRNG) to generate the stochastic force applied to each particle or pair of neighboring particles during each time step in the integration of Newton's equations of motion. In a Single-Instruction-Multiple-Thread (SIMT) GPU parallel computing environment, small batches of random numbers must be generated over thousands of threads and millions of kernel calls. In this communication we introduce a one-PRNG-per-kernel-call-per-thread scheme, in which a micro-stream of pseudorandom numbers is generated in each thread and kernel call. These high quality, statistically robust micro-streams require no global memory for state storage, are more computationally efficient than other PRNG schemes in memory-bound kernels, and uniquely enable the DPD simulation method without requiring communication between threads.

97 MATHEMATICS AND COMPUTING↗