On the supremum of the steepness parameter in self-adjusting discontinuity-preserving schemes

被引:2
|
作者
Ruan, Yucang [1 ,2 ]
Tian, Baolin [3 ,4 ]
Zhang, Xinting [2 ]
He, Zhiwei [3 ]
机构
[1] Peking Univ, Coll Engn, State Key Lab Turbulence & Complex Syst, Beijing 100871, Peoples R China
[2] Beihang Univ, Sino French Engineer Sch, Beijing 100191, Peoples R China
[3] Inst Appl Phys & Computat Math, Beijing 100094, Peoples R China
[4] Peking Univ, Coll Engn, HEDPS & Ctr Appl Phys & Technol, Beijing 100871, Peoples R China
基金
中国国家自然科学基金;
关键词
Discontinuity -preserving scheme; Total; -variation; -diminishing; Ultra -bee limiter; Anti; -diffusion; CFL number; HIGH-RESOLUTION SCHEMES; EFFICIENT IMPLEMENTATION; CAPTURING SCHEME; DIFFERENCE; INSTABILITY;
D O I
10.1016/j.compfluid.2022.105588
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Self-adjusting steepness (SAS)-based schemes preserve various structures in the compressible flows. These schemes provide a range of desired behaviors depending on the steepness-adjustable limiters with the steepness measured by a steepness parameter. These properties include either second-order accuracy with exact steepness infima that are theoretically given or having anti-diffusive/compression properties with a larger steepness parameter. Nevertheless, the supremum of the steepness parameter has not been determined theoretically yet. In this study, we demonstrate that any anti-diffusive limiter should be limited by Ultra-bee limiter according to Sweby's total variation diminishing (TVD) condition. Two typical steepness-adjustable limiters are analyzed in detail including the tangent of hyperbola for interface capturing (THINC) limiter and the steepness-adjustable harmonic (SAH) limiter. Applying this constraint, we derive for the first time two inequalities which the steepness parameters much satisfy. Furthermore, we obtain the analytical expression of the Courant-FriedrichsLewy (CFL) number-dependent supremum of the steepness parameter. Using this solution, we then propose supremum-determined SAS schemes. These schemes are further extended to solve the compressible Euler equations. The results of typical numerical tests confirm our theoretical conclusions and show that the final schemes are capable of sharply capturing contact discontinuities and minimizing numerical oscillations.
引用
收藏
页数:21
相关论文
共 20 条
  • [1] Self-adjusting steepness-based schemes that preserve discontinuous structures in compressible flows
    He, Zhiwei
    Ruan, Yucang
    Yu, Yaqun
    Tian, Baolin
    Xiao, Feng
    JOURNAL OF COMPUTATIONAL PHYSICS, 2022, 463
  • [2] Self-adjusting, positivity preserving high order schemes for hydrodynamics and magnetohydrodynamics
    Balsara, Dinshaw S.
    JOURNAL OF COMPUTATIONAL PHYSICS, 2012, 231 (22) : 7504 - 7517
  • [3] Self-adjusting steepness based remapping: A preliminary study
    He, Zhiwei
    Li, Li
    Tian, Baolin
    INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN FLUIDS, 2022, 94 (10) : 1641 - 1661
  • [4] SELF-ADJUSTING HYBRID SCHEMES FOR SHOCK COMPUTATIONS
    HARTEN, A
    ZWAS, G
    JOURNAL OF COMPUTATIONAL PHYSICS, 1972, 9 (03) : 568 - &
  • [5] A study of self-adjusting quality of service control schemes
    Cheng, ST
    Chen, CM
    Chen, IR
    1998 WINTER SIMULATION CONFERENCE PROCEEDINGS, VOLS 1 AND 2, 1998, : 1623 - 1628
  • [6] SEQUENTIAL MULTISTEP PARAMETER REGULATOR FOR SELF-ADJUSTING SYSTEMS
    RAKOVCHUK, GM
    AUTOMATION AND REMOTE CONTROL, 1964, 24 (11) : 1368 - &
  • [7] Particle Swarm Optimization with Parameter Self-Adjusting Mechanism
    Yasuda, Keiichiro
    Yazawa, Kazuyuki
    Motoki, Makoto
    IEEJ TRANSACTIONS ON ELECTRICAL AND ELECTRONIC ENGINEERING, 2010, 5 (02) : 256 - 257
  • [8] Parameter Self-adjusting Path Tracking Algorithm of Mobile Robots
    Zhang, Hong Ji
    Ge, Yuan Yuan
    APPLIED MECHATRONICS AND ANDROID ROBOTICS, 2013, 418 : 10 - +
  • [9] Electric Wheelchair Controller Based on Parameter Self-Adjusting Fuzzy PID
    Tian, ZhiHong
    Xu, WenHui
    PROCEEDINGS OF THE 2009 INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND NATURAL COMPUTING, VOL I, 2009, : 358 - 361