Comparisons of weakly-compressible and truly incompressible approaches for viscous flow into a high-order Cartesian-grid finite volume framework

L. Vittoz , G. Oger , M. de Leffe , D. Le Touzé
{"title":"Comparisons of weakly-compressible and truly incompressible approaches for viscous flow into a high-order Cartesian-grid finite volume framework","authors":"L. Vittoz ,&nbsp;G. Oger ,&nbsp;M. de Leffe ,&nbsp;D. Le Touzé","doi":"10.1016/j.jcpx.2019.100015","DOIUrl":null,"url":null,"abstract":"<div><p>An original strategy to address hydrodynamic flow was recently proposed through a high-order weakly-compressible Cartesian grid approach <span>[1]</span>. The method, named Weakly-Compressible Cartesian hydrodynamics (WCCH), is based on a fully-explicit temporal scheme for solving the Navier-Stokes equations while implicit incompressible schemes are usually preferred in the literature to address such flows. The present study aims to position and compare the WCCH method with a standard incompressible formulation. To this end, an incompressible scheme has been implemented in the same numerical framework. As far as possible, the algorithm used in the incompressible approach has been designed to be the same as (or close to) the one used in the weakly-compressible approach. In particular, high-order schemes for spatial and time discretization are employed. Pros and cons for each formulation are discussed in conjunction with a series of test cases on extensive criteria including implementation convenience, easy use of mesh refinement, convergence order and accuracy, numerical diffusion, parallel CPU scaling for high performance computing, etc. These comparisons demonstrate the relevance of the incompressible approach, at least for the selected test cases.</p></div>","PeriodicalId":37045,"journal":{"name":"Journal of Computational Physics: X","volume":"1 ","pages":"Article 100015"},"PeriodicalIF":0.0000,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.jcpx.2019.100015","citationCount":"14","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Computational Physics: X","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2590055219300319","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 14

Abstract

An original strategy to address hydrodynamic flow was recently proposed through a high-order weakly-compressible Cartesian grid approach [1]. The method, named Weakly-Compressible Cartesian hydrodynamics (WCCH), is based on a fully-explicit temporal scheme for solving the Navier-Stokes equations while implicit incompressible schemes are usually preferred in the literature to address such flows. The present study aims to position and compare the WCCH method with a standard incompressible formulation. To this end, an incompressible scheme has been implemented in the same numerical framework. As far as possible, the algorithm used in the incompressible approach has been designed to be the same as (or close to) the one used in the weakly-compressible approach. In particular, high-order schemes for spatial and time discretization are employed. Pros and cons for each formulation are discussed in conjunction with a series of test cases on extensive criteria including implementation convenience, easy use of mesh refinement, convergence order and accuracy, numerical diffusion, parallel CPU scaling for high performance computing, etc. These comparisons demonstrate the relevance of the incompressible approach, at least for the selected test cases.

高阶笛卡尔网格有限体积框架中粘性流的弱可压缩和真不可压缩方法的比较
最近通过高阶弱可压缩笛卡尔网格方法[1]提出了一种解决流体动力学流动的原始策略。该方法名为弱可压缩笛卡尔流体力学(WCCH),基于求解Navier-Stokes方程的完全显式时间格式,而在文献中,隐式不可压缩格式通常是解决此类流动的首选格式。本研究旨在定位和比较WCCH方法与标准不可压缩公式。为此,在相同的数值框架中实现了一个不可压缩格式。不可压缩方法中使用的算法已尽可能设计为与弱可压缩方法相同(或接近)。特别地,采用了用于空间和时间离散化的高阶格式。结合一系列关于广泛标准的测试案例,讨论了每种公式的优点和缺点,包括实现的便利性、网格细化的易用性、收敛顺序和精度、数值扩散、用于高性能计算的并行CPU缩放等。这些比较证明了不可压缩方法的相关性,至少对于所选择的测试用例。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Journal of Computational Physics: X
Journal of Computational Physics: X Physics and Astronomy-Physics and Astronomy (miscellaneous)
CiteScore
6.10
自引率
0.00%
发文量
7
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信