×

zbMATH — the first resource for mathematics

Hydromagnetic turbulence in computer simulations. (English) Zbl 1016.85002
Summary: The usefulness of high-order schemes in astrophysical MHD turbulence simulations is discussed. Simple advection tests of hat profiles are used to compare schemes of different order. Higher order schemes generally need less explicit diffusion. In the case of a standing Burgers shock it is shown that the overall accuracy improves as the order of the scheme is increased. A memory efficient 3-step \(2N\)-RK scheme is used. For cache efficiency, the entire set of equations is solved along pencils in the \(yz\)-plane. The advantage of solving for the magnetic vector potential is highlighted. Finally, results from a simulation of helical turbulence exhibiting large scale dynamo action are discussed.

MSC:
85-08 Computational methods for problems pertaining to astronomy and astrophysics
85A30 Hydrodynamic and hydromagnetic problems in astronomy and astrophysics
76F99 Turbulence
76M25 Other numerical methods (fluid mechanics) (MSC2010)
PDF BibTeX Cite
Full Text: DOI
References:
[1] Williamson, J.H., J. comp. phys., 35, 48, (1980)
[2] Lele, S.K., J. comp. phys., 103, 16, (1992)
[3] Nordlund, Å.; Stein, R.F., Comput. phys. commun., 59, 119, (1990)
[4] Brandenburg, A., J. fluid mech., 306, 325, (1996)
[5] Brandenburg, A., Astrophys. J., 446, 741, (1995)
[6] Brandenburg, A., ()
[7] Brandenburg, A.; Dobler, W., Astron. astrophys., 369, 329, (2001)
[8] Stanescu, D.; Habashi, W.G., J. comp. phys., 143, 674, (1988)
[9] Krause, F.; Rädler, K.-H., Mean-field magnetohydrodynamics and dynamo theory, (1980), Akademie-Verlag/Pergamon Press Berlin/Oxford · Zbl 0505.76120
[10] Brandenburg, A., Astrophys. J., 550, 824, (2001)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.