z-logo
Premium
Accuracy and convergence of iteratively solved Monte Carlo codes for simulations in the plasma edge of nuclear fusion reactors
Author(s) -
Ghoos Kristel,
Samaey Giovanni,
Baelmans Martine
Publication year - 2018
Publication title -
contributions to plasma physics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.531
H-Index - 47
eISSN - 1521-3986
pISSN - 0863-1042
DOI - 10.1002/ctpp.201700181
Subject(s) - monte carlo method , algorithm , convergence (economics) , computer science , enhanced data rates for gsm evolution , mathematics , statistical physics , monte carlo method in statistical physics , monte carlo integration , iterative method , hybrid monte carlo , mathematical optimization , physics , markov chain monte carlo , statistics , artificial intelligence , economics , economic growth
Iteratively solved Monte Carlo (MC) codes are frequently used for plasma edge simulations. However, their accuracy and convergence assessment are still unresolved issues. In analogy with the error classification recently developed for coupled finite‐volume/Monte Carlo (FV‐MC) codes, we define different error contributions and analyse them separately in a simplified non‐linear MC code. Three iterative procedures are examined: Random Noise (RN), where different seeds are used in each iteration; Correlated Sampling, where particle trajectories remain correlated between iterations; and Robbins Monro, where averaging is used during the simulation. We show that, as in FV‐MC codes, RN is the most efficient iterative procedure provided averaging is used to decrease the statistical error. In addition, we conclude that the accuracy can be assessed using the same techniques as in FV‐MC codes.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here