Search arXivSearch

arXiv · 1603.06660

Admissible state and physical constraints preserving schemes for relativistic magnetohydrodynamic equations

Abstract

This paper first studies the admissible state set $\mathcal G$ of relativistic magnetohydrodynamics (RMHD). It paves a way for developing physical-constraints-preserving (PCP) schemes for RMHD equations with the solutions in $\mathcal G$. To overcome the difficulties arising from the extremely strong nonlinearities and no explicit formulas of the primitive variables and flux vectors with respect to the conservative vector, two equivalent forms of $\mathcal G$ with explicit constraints on the conservative vector are skillfully discovered. The first is derived by analyzing roots of several polynomials and transferring successively them, and further used to prove the convexity of $\mathcal G$ with the aid of semi-positive definiteness of the second fundamental form of a hypersurface. While the second is derived based on the convexity and then used to show the orthogonal invariance of $\mathcal G$. The Lax-Friedrichs (LxF) splitting property does not hold generally for nonzero magnetic field, but by a constructive inequality and pivotal techniques, we discover the generalized LxF splitting properties, combining the convex combination of some LxF splitting terms with a discrete divergence-free condition of magnetic field. Based on above analyses, several one- and two-dimensional PCP schemes are then studied. In 1D case, a first-order accurate LxF type scheme is first proved to be PCP under the CFL condition, and then high-order PCP schemes are proposed via a PCP limiter. In 2D case, the discrete divergence-free condition and PCP property are analyzed for a first-order LxF scheme, and two sufficient conditions are derived for high-order accurate PCP schemes. Our analysis reveals in theory for the first time that the discrete divergence-free condition is closely connected with the PCP property. Several numerical examples demonstrate theoretical findings and performance of numerical schemes.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Kailiang Wu, Huazhong Tang. 2017-01-15. Admissible state and physical constraints preserving schemes for relativistic magnetohydrodynamic equations. https://doi.org/10.1142/s0218202517500348

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

The Stability of Block Eliminations and Additive Modifications

The block elimination with additive modifications (BEAM) method was recently proposed as a alternative to LU with partial pivoting requiring less communication. Because of the novelty of BEAM, the existing theoretical analysis is lacking. To that end, we analyze both the numerical stability of the underlying block LU factorization and the effects of additive modifications. For the block LU factorization, we are able to improve the previous results of Demmel et al. from being cubic in the element growth to merely quadratic. Furthermore, we propose an alternative measure of element growth that is better aligned with block LU; this new measure of growth allows our analysis to apply to matrices that cannot be factored with pointwise LU. In the second part, we analyzed the modifications produced by BEAM and the effect they have on the condition number and growth factor. Finally, we show that BEAM will not apply any modifications in some cases that regular block LU can safely factor.

math.NA

Efficient Rigorous Continuation via Chebyshev Series Expansion I

We study the global continuation of solution manifolds arising in dynamical systems. We present a rigorous continuation method based on a Chebyshev series expansion of the solution manifold. The branch is first approximated by a high-order Chebyshev interpolation polynomial, and an explicit error bound is then obtained by verifying the contraction of a quasi-Newton operator near this approximation. The contraction is formulated on a weighted $\ell^1$ space, giving a finer control than the typical $C^0$-error bound obtained from the uniform contraction theorem. In fact, the latter follows directly from our contraction operator. Furthermore, we discuss how our strategy applies naturally to pseudo-arclength continuation, where the continuation parameter fails to provide a valid local coordinate, and extends to multi-parameter continuation. Lastly, we detail two applications in which we compute a two-parameter family of steady-states for the Cahn--Hilliard equation, and a one-parameter family of steady-states undergoing saddle-node bifurcations for the Shigesada--Kawasaki--Teramoto system.

math.NA

Efficient iterative techniques for solving tensor problems with the T-product

This paper develops two efficient iterative methods for solving tensor equations under the T-product framework. For T-symmetric positive definite tensor equations of the form $\mathcal{C} \star \mathcal{X} = \mathcal{D}$, we propose a conjugate-gradient-type algorithm that generates orthogonal residual and $\mathcal{C}$-orthogonal direction sequences, ensuring convergence within a finite number of steps. For general consistent tensor equations, we extend the method using a normal-equation transformation, and further adapt it to handle inconsistent systems by solving a least-squares minimization problem. Key advantages include direct tensor-based computations without explicit matrix expansion, rigorous finite-step convergence proofs, and the ability to obtain minimal Frobenius norm solutions. Numerical experiments on synthetic data, benchmark images, and video sequences demonstrate that the proposed algorithms achieve high precision with low computational time, confirming their practicality for large-scale multidimensional problems.

math.NA