Variance reduction methods for numerical solution of plasma kinetic diffusion
2012 (English)Licentiate thesis, comprehensive summary (Other academic)
Performing detailed simulations of plasma kinetic diffusion is a challenging task and currently requires the largest computational facilities in the world. The reason for this is that, the physics in a confined heated plasma occur on a broad range of temporal and spatial scales. It is therefore of interest to improve the computational algorithms together with the development of more powerful computational resources. Kinetic diffusion processes in plasmas are commonly simulated with the Monte Carlo method, where a discrete set of particles are sampled from a distribution function and advanced in a Lagrangian frame according to a set of stochastic differential equations. The Monte Carlo method introduces computational error in the form of statistical random noise produced by a finite number of particles (or markers) N and the error scales as αN−β where β = 1/2 for the standard Monte Carlo method. This requires a large number of simulated particles in order to obtain a sufficiently low numerical noise level. Therefore it is essential to use techniques that reduce the numerical noise. Such methods are commonly called variance reduction methods. In this thesis, we have developed new variance reduction methods with application to plasma kinetic diffusion. The methods are suitable for simulation of RF-heating and transport, but are not limited to these types of problems. We have derived a novel variance reduction method that minimizes the number of required particles from an optimization model. This implicitly reduces the variance when calculating the expected value of the distribution, since for a fixed error the optimization model ensures that a minimal number of particles are needed. Techniques that reduce the noise by improving the order of convergence, have also been considered. Two different methods have been tested on a neutral beam injection scenario. The methods are the scrambled Brownian bridge method and a method here called the sorting and mixing method of L´ecot and Khettabi. Both methods converge faster than the standard Monte Carlo method for modest number of time steps, but fail to converge correctly for large number of time steps, a range required for detailed plasma kinetic simulations. Different techniques are discussed that have the potential of improving the convergence to this range of time steps.
Place, publisher, year, edition, pages
Stockholm: KTH Royal Institute of Technology, 2012. , viii, 42 p.
Trita-EE, ISSN 1653-5146 ; 2012:007
variance reduction, Monte Carlo, quasi-Monte Carlo, kinetic diffusion, stochastic differential equation
Fusion, Plasma and Space Physics
IdentifiersURN: urn:nbn:se:kth:diva-91332ISBN: 978-91-7501-278-0OAI: oai:DiVA.org:kth-91332DiVA: diva2:509600
2012-03-30, Seminarierummet, Teknikringen 31, KTH, Stockholm, 12:24 (English)
Ericsson, Lars-Göran, Dr.
Hellsten, Torbjörn, ProfessorJohnson, Thomas, Dr.
QC 201203142012-03-142012-03-132012-03-14Bibliographically approved
List of papers