Adaptive two- and three-dimensional multiresolution computations of resistive magnetohydrodynamics

02/23/2021
by   Anna Karina Fontes Gomes, et al.
0

Fully adaptive computations of the resistive magnetohydrodynamic (MHD) equations are presented in two and three space dimensions using a finite volume discretization on locally refined dyadic grids. Divergence cleaning is used to control the incompressibility constraint of the magnetic field. For automatic grid adaptation a cell-averaged multiresolution analysis is applied which guarantees the precision of the adaptive computations, while reducing CPU time and memory requirements. Implementation issues of the open source code CARMEN-MHD are discussed. To illustrate its precision and efficiency different benchmark computations including shock-cloud interaction and magnetic reconnection are presented.

READ FULL TEXT

page 15

page 20

page 22

page 24

page 26

research
12/11/2019

A 3D wavelet-based incompressible Navier-Stokes solver for fully adaptive computations in time-varying geometries

We present a wavelet-based adaptive method for computing 3D flows in com...
research
12/06/2017

High-order Discretization of a Gyrokinetic Vlasov Model in Edge Plasma Geometry

We present a high-order spatial discretization of a continuum gyrokineti...
research
12/15/2019

A Tutorial and Open Source Software for the Efficient Evaluation of Gravity and Magnetic Kernels

Fast computation of three-dimensional gravity and magnetic forward model...
research
01/12/2022

The Virtual Element Method for the 3D Resistive Magnetohydrodynamic model

We present a four-field Virtual Element discretization for the time-depe...
research
07/05/2023

Benchmark computations of dynamic poroelasticity

We present benchmark computations of dynamic poroelasticity modeling flu...
research
10/04/2022

A finite-volume scheme for modeling compressible magnetohydrodynamic flows at low Mach numbers in stellar interiors

Fully compressible magnetohydrodynamic (MHD) simulations are a fundament...
research
10/17/2017

Efficient Neighbor-Finding on Space-Filling Curves

Space-filling curves (SFC, also known as FASS-curves) are a useful tool ...

Please sign up or login with your details

Forgot password? Click here to reset