๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An Efficient Shock-Capturing Algorithm for Compressible Multicomponent Problems

โœ Scribed by Keh-Ming Shyue


Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
465 KB
Volume
142
Category
Article
ISSN
0021-9991

No coin nor oath required. For personal study only.

โœฆ Synopsis


A simple shock-capturing approach to multicomponent flow problems is developed for the compressible Euler equations with a stiffened gas equation of state in multiple space dimensions. The algorithm uses a quasi-conservative formulation of the equations that is derived to ensure the correct fluid mixing when approximating the equations numerically with interfaces. A ฮณ -based model and a volume-fraction model have been described, and both of them are solved using the standard high-resolution wave propagation method for general hyperbolic systems of partial differential equations. Several calculations are presented with a Roe approximate Riemann solver that show accurate results obtained using the method without any spurious oscillations in the pressure near the interfaces. Convergence of the computed solutions to the correct weak ones has been verified for a two-dimensional Richtmyer-Meshkov unstable interface problem where we have performed a mesh-refinement study and also shown front-tracking results for comparison.


๐Ÿ“œ SIMILAR VOLUMES


An Efficient Algorithm for the Complex R
โœ C.Andrew Neff; John H. Reif ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 406 KB

Given a univariate polynomial f (z) of degree n with complex coefficients, whose norms are less than 2 m in magnitude, the root problem is to find all the roots of f (z) up to specified precision 2 ฯชศ . Assuming the arithmetic model for computation, we provide an algorithm which has complexity O(n l

An Efficient Algorithm for the k-Pairwis
โœ Qian-Ping Gu; Shietung Peng ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 140 KB

A graph G(V, E) (|V| 2k) satisfies property A k if, given k pairs of distinct nodes (s 1 , t 1 ), ..., (s k , t k ) of V(G), there are k mutually node-disjoint paths, one connecting s i and t i for each i, 1 i k. A necessary condition for any graph to satisfy A k is that it is (2k&1)-connected. Hype