A Free, Fast, Simple and Efficient TVD MHD Code

Astronomy and Astrophysics – Astrophysics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

17 pages, 6 figures, submitted to the astrophysical journal

Scientific paper

We describe a numerical method to solve the magnetohydrodynamic (MHD) equations. The fluid variables are updated along each direction using the flux conservative, 2nd order, total variation diminishing (TVD), upwind scheme of Jin and Xin. The magnetic field is updated separately in two-dimensional advection-constraint steps. The electromotive force (EMF) is computed in the advection step using the TVD scheme, and this same EMF is used immediately in the constraint step in order to preserve \grad.B=0 without the need to store intermediate fluxes. Operator splitting is used to extend the code to three dimensions, and Runge-Kutta is used to get second order accuracy in time. The advantages of this code are high resolution per grid cell, second order accuracy in space and time, enforcement of the \grad.B=0 constraint to machine precision, no memory overhead, speed, and simplicity. A 3-D Fortran implementation less than 400 lines long is made freely available. We also implemented a fully scalable message-passing parallel MPI version. We present tests of the code on MHD waves and shocks.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

A Free, Fast, Simple and Efficient TVD MHD Code does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Free, Fast, Simple and Efficient TVD MHD Code, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Free, Fast, Simple and Efficient TVD MHD Code will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-596015

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.