Binning for efficient stochastic particle simulations
Michelotti, Matthew
Loading…
Permalink
https://hdl.handle.net/2142/42127
Description
Title
Binning for efficient stochastic particle simulations
Author(s)
Michelotti, Matthew
Issue Date
2013-02-03T19:16:34Z
Director of Research (if dissertation) or Advisor (if thesis)
Heath, Michael T.
West, Matthew
Department of Study
Computer Science
Discipline
Computer Science
Degree Granting Institution
University of Illinois at Urbana-Champaign
Degree Name
M.S.
Degree Level
Thesis
Keyword(s)
stochastic
Markov process
coalescence
atmospheric aerosol
stochastic simulation algorithm
tau leaping
particle resolved
Abstract
Gillespie's Stochastic Simulation Algorithm (SSA) is an exact procedure for simulating the evolution of a collection of discrete, interacting entities, such as coalescing aerosol particles or reacting chemical species. The high computational cost of SSA has motivated the development of more efficient variants, such as Tau-Leaping, which sacrifices the exactness of SSA. For models whose interacting entities can be characterized by a continuous parameter, such as a measure of size for aerosol particles, we analyze strategies for accelerating these algorithms by aggregating particles of similar size into bins. We show that for such models an appropriate binning strategy can dramatically enhance efficiency, and in particular can make SSA computationally competitive without sacrificing exactness. We formulate binned versions of both the SSA and Tau-Leaping algorithms and analyze and demonstrate their performance.
Use this login method if you
don't
have an
@illinois.edu
email address.
(Oops, I do have one)
IDEALS migrated to a new platform on June 23, 2022. If you created
your account prior to this date, you will have to reset your password
using the forgot-password link below.
