Order-of-magnitude estimates for tokamak edge modelling
Suppose plasma number density m. Order of magnitude dimensions are m for SOL thickness, reactor minor and major radii say m and m, so the
volume of SOL m. It follows that the total number of electrons .
The shortest timescale is inverse , the electron cyclotron frequency, where the ratio of charge to mass for the electron is C kg, and T, so s. Hence the number of particle-steps to evolve s of physical time is (assuming of order timesteps per orbit), which assuming flop per update, needs a
total of flop. Thus to complete a computation in s on Exascale machine, only one particle-step in is allowed. This implies for example only superparticles in the volume can be
used supposing each has a weight , which is unlikely to be adequate because electrostatic and other effects will produce a noise level that swamps any physical effects. However if or months
(approx. s) are allowed, then a calculation with particles may be performed if memory-access bandwidth constraints can be satisfied, when the noise levels may be manageable.
The situation may be shown to be a million times easier for neutrals considered separately, assuming neutral density , particle mass and temperature eV, for a timescale of where the mean free path and the neutral speed typically is . For then , ie. . Thus s, ie. a million times longer than the electron cyclotron timescale.
Suppose a fluid model is employed instead, ie. the electron distribution is represented by its first moments. If the electron temperature eV, then the thermal speed m s. Supposing the SOL to be sampled at a uniform mm interval, then the number of sample-points , and the timestep for an explicit scheme s, so the number of sample-point updates is . Assuming flop each update, this means one second of physical time needs flop or s d of Exascale machine time, if memory-access bandwidth constraints can be satisfied. If an implicit scheme is used to simulate plasma ions as a fluid on a drift type timescale, then possibly the timestep s, ie. a thousand times larger, and calculations lasting only a few minutes might suffice.
Another way of looking at this is to suppose that numerical problem is -dimensional, flop are needed for each sample update and samples per spatial dimension and time samples are allowed. Then to update such
a model in s requires . Thus if , , and . It seems that accuracy controlled, unstructured, implicit fluid models should be possible, although for the more
complex models flop per update may be an underestimate by orders of magnitude.