Accelerating convergence in stochastic particle dispersion simulation codes
From MaRDI portal
Recommendations
Cites work
- A kinetic theory for nonanalog Monte Carlo particle transport algorithms: Exponential transform with angular biasing in planar-geometry anisotropically scattering media
- A new algorithm for adaptive multidimensional integration
- A Simplex Method for Function Minimization
- Adapative importance sampling on discrete Markov chains
- Adaptive mixture importance sampling
- Approximating the permanent via importance sampling with application to the dimer covering problem
- Criteria for the selection of stochastic models of particle trajectories in turbulent flows
- Exponential convergence of adaptive importance sampling for Markov chains
- Fast simulation of rare events in queueing and reliability models
- scientific article; zbMATH DE number 3179103 (Why is no real title available?)
- scientific article; zbMATH DE number 194144 (Why is no real title available?)
- scientific article; zbMATH DE number 3196612 (Why is no real title available?)
- Nonparametric Importance Sampling
- Random walk models for particle displacements in inhomogeneous unsteady turbulent flows
- Turbulent dispersion with broken reflectional symmetry
- Weighted Average Importance Sampling and Defensive Mixture Distributions
Cited in
(3)
This page was built for publication: Accelerating convergence in stochastic particle dispersion simulation codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5953231)