An HLLC Solver for Relativistic Flows -- II. Magnetohydrodynamics

Astronomy and Astrophysics – Astrophysics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

17 pages, 12 figures

Scientific paper

10.1111/j.1365-2966.2006.10162.x

An approximate Riemann solver for the equations of relativistic magnetohydrodynamics (RMHD) is derived. The HLLC solver, originally developed by Toro, Spruce and Spears, generalizes the algorithm described in a previous paper (Mignone & Bodo 2004) to the case where magnetic fields are present. The solution to the Riemann problem is approximated by two constant states bounded by two fast shocks and separated by a tangential wave. The scheme is Jacobian-free, in the sense that it avoids the expensive characteristic decomposition of the RMHD equations and it improves over the HLL scheme by restoring the missing contact wave. Multidimensional integration proceeds via the single step, corner transport upwind (CTU) method of Colella, combined with the contrained tranport (CT) algorithm to preserve divergence-free magnetic fields. The resulting numerical scheme is simple to implement, efficient and suitable for a general equation of state. The robustness of the new algorithm is validated against one and two dimensional numerical test problems.

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

An HLLC Solver for Relativistic Flows -- II. Magnetohydrodynamics 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 An HLLC Solver for Relativistic Flows -- II. Magnetohydrodynamics, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An HLLC Solver for Relativistic Flows -- II. Magnetohydrodynamics will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-505875

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