ACCELERATED MONTE CARLO FOR PARTICLE DISPERSION
DOI10.1081/STA-100107698zbMATH Open0999.65003OpenAlexW2008609414MaRDI QIDQ4540565FDOQ4540565
Authors: Mark Fitzgerald, Rick Picard
Publication date: 28 July 2002
Published in: Communications in Statistics: Theory and Methods (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1081/sta-100107698
Recommendations
- Accelerating convergence in stochastic particle dispersion simulation codes
- Adapative importance sampling on discrete Markov chains
- Exponential convergence of adaptive importance sampling for Markov chains
- Examples comparing importance sampling and the Metropolis algorithm
- Acceleration on adaptive importance sampling with sample average approximation
experimental designconvergenceregression analysisMarkov chainsMonte Carlo methodadaptive importance samplingairborne particle dispersion
Computational methods in Markov chains (60J22) Monte Carlo methods (65C05) Numerical analysis or methods applied to Markov chains (65C40) Stochastic particle methods (65C35)
Cited In (4)
This page was built for publication: ACCELERATED MONTE CARLO FOR PARTICLE DISPERSION
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4540565)