Publication

Gyrokinetic simulations of turbulent transport: size scaling and chaotic behaviour

Abstract

Important steps towards the understanding of turbulent transport have been made with the development of the gyrokinetic framework for describing turbulence and with the emergence of numerical codes able to solve the set of gyrokinetic equations. This paper presents some of the main recent advances in gyrokinetic theory and computing of turbulence. Solving 5D gyrokinetic equations requires state-of-the-art high performance computing techniques involving massively parallel computers and parallel scalable algorithms. The various numerical schemes that have been explored until now, Lagrangian, Eulerian and semi-Lagrangian, each have their advantages and drawbacks. A past controversy regarding the finite size effect (finite rho()) in ITG turbulence has now been resolved. It has triggered an intensive benchmarking effort and careful examination of the convergence properties of the different numerical approaches. Now, both Eulerian and Lagrangian global codes are shown to agree and to converge to the flux-tube result in the rho() -> 0 limit. It is found, however, that an appropriate treatment of geometrical terms is necessary: inconsistent approximations that are sometimes used can lead to important discrepancies. Turbulent processes are characterized by a chaotic behaviour, often accompanied by bursts and avalanches. Performing ensemble averages of statistically independent simulations, starting from different initial conditions, is presented as a way to assess the intrinsic variability of turbulent fluxes and obtain reliable estimates of the standard deviation. Further developments concerning non-adiabatic electron dynamics around mode-rational surfaces and electromagnetic effects are discussed.

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.