**Are you an EPFL student looking for a semester project?**

Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.

Publication# High-order accurate entropy stable adaptive moving mesh finite difference schemes for special relativistic (magneto)hydrodynamics

Abstract

This paper develops high-order accurate entropy stable (ES) adaptive moving mesh finite difference schemes for the two- and three-dimensional special relativistic hydrodynamic (RHD) and magnetohydrodynamic (RMHD) equations, which is the high-order accurate extension of Duan and Tang (2021) [23]. The key point is the derivation of the high-erorder accurate entropy conservative (EC) and ES finite difference schemes in the curvilinear coordinates by carefully dealing with the discretization of the temporal and spatial metrics and the Jacobian of the coordinate transformation and constructing the high-order EC and ES fluxes with the discrete metrics. The spatial derivatives in the source terms of the symmetrizable RMHD equations and the geometric conservation laws are discretized by using the linear combinations of the corresponding second-order case to obtain high-order accuracy. Based on the proposed high-order accurate EC schemes and the high-order accurate dissipation terms built on the WENO reconstruction, the high-order accurate ES schemes are obtained for the RHD and RMHD equations in the curvilinear coordinates. The mesh iteration redistribution or adaptive moving mesh strategy is built on the minimization of the mesh adaption functional. Several numerical tests are conducted to validate the shock-capturing ability and high efficiency of our high-order accurate ES adaptive moving mesh methods on the parallel computer system with the MPI communication. The numerical results show that the high-order accurate ES adaptive moving mesh schemes outperform both their counterparts on the uniform mesh and the second-order ES adaptive moving mesh schemes. (C) 2022 Elsevier Inc. All rights reserved.

Official source

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related publications (40)

Related MOOCs (26)

Related concepts (45)

Algebra (part 1)

Un MOOC francophone d'algèbre linéaire accessible à tous, enseigné de manière rigoureuse et ne nécessitant aucun prérequis.

Algebra (part 1)

Un MOOC francophone d'algèbre linéaire accessible à tous, enseigné de manière rigoureuse et ne nécessitant aucun prérequis.

Algebra (part 2)

Un MOOC francophone d'algèbre linéaire accessible à tous, enseigné de manière rigoureuse et ne nécessitant aucun prérequis.

Ontological neighbourhood

Linear combination

In mathematics, a linear combination is an expression constructed from a set of terms by multiplying each term by a constant and adding the results (e.g. a linear combination of x and y would be any expression of the form ax + by, where a and b are constants). The concept of linear combinations is central to linear algebra and related fields of mathematics. Most of this article deals with linear combinations in the context of a vector space over a field, with some generalizations given at the end of the article.

Linear span

In mathematics, the linear span (also called the linear hull or just span) of a set S of vectors (from a vector space), denoted span(S), is defined as the set of all linear combinations of the vectors in S. For example, two linearly independent vectors span a plane. The linear span can be characterized either as the intersection of all linear subspaces that contain S, or as the smallest subspace containing S. The linear span of a set of vectors is therefore a vector space itself. Spans can be generalized to matroids and modules.

Mesh generation

Mesh generation is the practice of creating a mesh, a subdivision of a continuous geometric space into discrete geometric and topological cells. Often these cells form a simplicial complex. Usually the cells partition the geometric input domain. Mesh cells are used as discrete local approximations of the larger domain. Meshes are created by computer algorithms, often with human guidance through a GUI , depending on the complexity of the domain and the type of mesh desired.

This paper proposes a method for the construction of quadratic serendipity element (QSE) shape functions on planar convex and concave polygons. Existing approaches for constructing QSE shape functions are linear combinations of the pair-wise products of ge ...

Michael Christoph Gastpar, Sung Hoon Lim, Adriano Pastore, Chen Feng

This paper considers the problem of distributed lossy compression where the goal is to recover one or more linear combinations of the sources at the decoder, subject to distortion constraints. For certain configurations, it is known that codes with algebra ...

2023This paper extends the high-order entropy stable (ES) adaptive moving mesh finite difference schemes developed in Duan and Tang (2022) to the two- and three-dimensional (multi-component) compressible Euler equations with the stiffened equation of state (EO ...