首页> 外文期刊>SIAM Journal on Scientific Computing >ADAPTIVE SEMIDISCRETE CENTRAL-UPWIND SCHEMES FOR NONCONVEX HYPERBOLIC CONSERVATION LAWS
【24h】

ADAPTIVE SEMIDISCRETE CENTRAL-UPWIND SCHEMES FOR NONCONVEX HYPERBOLIC CONSERVATION LAWS

机译:非凸双曲守恒律的自适应半曲线中心向上格式

获取原文
获取原文并翻译 | 示例
           

摘要

We discover that the choice of a piecewise polynomial reconstruction is crucial in computing solutions of nonconvex hyperbolic (systems of) conservation laws. Using semidiscrete central-upwind schemes, we illustrate that the obtained numerical approximations may fail to converge to the unique entropy solution or the convergence may be so slow that achieving a proper resolution would require the use of (almost) impractically fine meshes. For example, in the scalar case, all computed solutions seem to converge to solutions that are entropy solutions for some entropy pairs. However, in most applications, one is interested in capturing the unique (Kruzhkov) solution that satisfies the entropy condition for all convex entropies. We present a number of numerical examples that demonstrate the convergence of the solutions, computed with the dissipative second-order minmod reconstruction, to the unique entropy solution. At the same time, more compressive and/or higher-order reconstructions may fail to resolve composite waves, typically present in solutions of nonconvex conservation laws, and thus may fail to recover the Kruzhkov solution. In this paper, we propose a simple and computationally inexpensive adaptive strategy that allows us to simultaneously capture the unique entropy solution and to achieve a high resolution of the computed solution. We use the dissipative minmod reconstruction near the points where convexity changes and utilize a fifth-order weighted essentially nonoscillatory (WENO5) reconstruction in the rest of the computational domain. Our numerical examples (for one- and two-dimensional scalar and systems of conservation laws) demonstrate the robustness, reliability, and nonoscillatory nature of the proposed adaptive method.
机译:我们发现分段多项式重建的选择对于计算非凸双曲(守恒律)系统的解决方案至关重要。使用半离散的中心迎风方案,我们说明了所获得的数值近似可能无法收敛到唯一的熵解,或者收敛可能太慢,以至于无法获得适当的分辨率,将需要使用(几乎)不切实际的精细网格。例如,在标量情况下,所有计算出的解似乎都收敛到作为某些熵对的熵解的解。然而,在大多数应用中,人们对捕获满足所有凸熵的熵条件的唯一(Kruzhkov)解感兴趣。我们提供了许多数值示例,这些示例演示了用耗散二阶minmod重建计算的解到唯一熵解的收敛性。同时,更多的压缩和/或更高阶的重构可能无法解析通常在非凸守恒定律的解中出现的复合波,因此可能无法恢复Kruzhkov解。在本文中,我们提出了一种简单且计算上便宜的自适应策略,该策略允许我们同时捕获唯一的熵解并获得高分辨率的计算解。我们在凸度变化的点附近使用耗散的minmod重建,并在其余计算域中使用五阶加权基本非振荡(WENO5)重建。我们的数值示例(针对一维和二维标量以及守恒定律的系统)证明了所提出的自适应方法的鲁棒性,可靠性和非振荡性质。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号