首页> 外文期刊>Computer Methods in Applied Mechanics and Engineering >Conservative, high-order particle-mesh scheme with applications to advection-dominated flows
【24h】

Conservative, high-order particle-mesh scheme with applications to advection-dominated flows

机译:保守的高阶粒子网格方案,适用于对流为主的流

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

By combining concepts from particle-in-cell (PIC) and hybridized discontinuous Galerkin (HDG) methods, we present a particle-mesh scheme for flow and transport problems which allows for diffusion-free advection while satisfying mass and momentum conservation - locally and globally - and extending to high-order spatial accuracy. This is achieved via the introduction of a novel particle-mesh projection operator which casts the particle-mesh data transfer as a PDE-constrained optimization problem, permitting advective flux functionals at cell boundaries to be inferred from particle trajectories. This optimization problem seamlessly fits in a HDG framework, whereby the control variables in the optimization problem serve as advective fluxes in the HDG scheme. The resulting algebraic problem can be solved efficiently using static condensation. The performance of the scheme is demonstrated by means of numerical examples for the linear advection-diffusion equation and the incompressible Navier-Stokes equations. The results demonstrate optimal spatial accuracy, and when combined with a theta time integration scheme, second-order temporal accuracy is shown. (C) 2019 Elsevier B.V. All rights reserved.
机译:通过结合单元中粒子(PIC)和杂交不连续Galerkin(HDG)方法的概念,我们提出了一种用于流动和传输问题的粒子网格方案,该方案允许无扩散对流,同时满足局部和全局守恒的质量和动量守恒-并扩展到高阶空间精度。这是通过引入新的粒子网格投影算子来实现的,该算子将粒子网格数据传输转换为PDE约束的优化问题,从而可以从粒子轨迹推断出单元边界处的对流通量函数。该优化问题无缝地适合于HDG框架,由此优化问题中的控制变量在HDG方案中用作对流。使用静态凝聚可以有效地解决由此产生的代数问题。通过线性对流扩散方程和不可压缩的Navier-Stokes方程的数值示例,证明了该方案的性能。结果证明了最佳的空间精度,并与theta时间积分方案结合时,显示了二阶时间精度。 (C)2019 Elsevier B.V.保留所有权利。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号