A Spectacular Vector Penalty-Projection Method for Darcy and Navier-Stokes Problems

被引:7
|
作者
Angot, Philippe [1 ]
Caltagirone, Jean-Paul [2 ]
Fabrie, Pierre [3 ]
机构
[1] Aix Marseille Univ, LATP, CNRS, CMI,UMR 6632, 39 Rue F Joliot Curie, F-13453 Marseille 13, France
[2] Univ Bordeaux & IPB, IMIB, F-33607 Pessac, France
[3] Univ Bordeaux & IPB, IMIB, F-33607 Pessac, France
关键词
Vector penalty-projection; Penalty method; Splitting method; Multiphase Navier-Stokes/Brinkman; Anisotropic Darcy problem; Incompressible flows; VISCOUS FLOWS; EQUATIONS;
D O I
10.1007/978-3-642-20671-9_5
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
We present a new fast vector penalty-projection method (VPP epsilon), issued from noticeable improvements of previous works [3,4,7], to efficiently compute the solution of unsteady Navier-Stokes/Brinkman problems governing incompressible multiphase viscous flows. The method is also efficient to solve anisotropic Darcy problems. The key idea of the method is to compute at each time step an accurate and curl-free approximation of the pressure gradient increment in time. This method performs a two-step approxitnate divergence-free vector projection yielding a velocity divergence vanishing as O(epsilon delta t), delta t being the time step, with a penalty parameter epsilon as small as desired until the machine precision, e.g. epsilon = 10(-14), whereas the solution algorithm can be extremely fast and cheap. The method is numerically validated on a benchmark problem for two-phase bubble dynamics where we compare it to the Uzawa augmented Lagrangian (UAL) and scalar incremental projection (SIP) methods. Moreover, a new test case for fluid-structure interaction problems is also investigated. That results in a robust method running faster than usual methods and being able to efficiently compute accurate solutions to sharp test cases whatever the density, viscosity or anisotropic permeability jumps, whereas other methods crash.
引用
收藏
页码:39 / +
页数:2
相关论文
共 50 条
  • [21] A penalty finite volume method for the transient Navier-Stokes equations
    He, Guoliang
    He, Yinnian
    Chen, Zhangxin
    APPLIED NUMERICAL MATHEMATICS, 2008, 58 (11) : 1583 - 1613
  • [22] VECTOR PENALTY-PROJECTION METHOD FOR INCOMPRESSIBLE FLUID FLOWS WITH OPEN BOUNDARY CONDITIONS
    Angot, Philippe
    Cheaytou, Rima
    ALGORITMY 2012, 2012, : 219 - 229
  • [23] ON A PENALTY METHOD FOR THE NAVIER-STOKES PROBLEM IN REGIONS WITH MOVING BOUNDARIES
    AMIEZ, G
    GREMAUD, PA
    MATEMATICA APLICADA E COMPUTACIONAL, 1993, 12 (02): : 113 - 122
  • [24] A MODIFIED PENALTY METHOD FOR STOKES EQUATIONS AND ITS APPLICATIONS TO NAVIER-STOKES EQUATIONS
    LIN, SY
    CHIN, YS
    WU, TM
    SIAM JOURNAL ON SCIENTIFIC COMPUTING, 1995, 16 (01): : 1 - 19
  • [25] CONVERGENCE OF A VECTOR PENALTY PROJECTION SCHEME FOR THE NAVIER STOKES EQUATIONS WITH MOVING BODY
    Bruneau, Vincent
    Doradoux, Adrien
    Fabrie, Pierre
    ESAIM-MATHEMATICAL MODELLING AND NUMERICAL ANALYSIS-MODELISATION MATHEMATIQUE ET ANALYSE NUMERIQUE, 2018, 52 (04): : 1417 - 1436
  • [26] Numerical analysis of the Navier-Stokes/Darcy coupling
    Badea, Lori
    Discacciati, Marco
    Quarteroni, Alfio
    NUMERISCHE MATHEMATIK, 2010, 115 (02) : 195 - 227
  • [27] On the solution of the coupled Navier-Stokes and Darcy equations
    Chidyagwai, Prince
    Riviere, Beatrice
    COMPUTER METHODS IN APPLIED MECHANICS AND ENGINEERING, 2009, 198 (47-48) : 3806 - 3820
  • [28] A hybridizable discontinuous Galerkin method for the coupled Navier-Stokes and Darcy problem
    Cesmelioglu, Aycil
    Rhebergen, Sander
    JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2023, 422
  • [29] Error Analysis of the Vector Penalty-Projection Methods for the Time-Dependent Stokes Equations with Open Boundary Conditions
    Cheaytou, Rima
    Angot, Philippe
    COMPUTATIONAL METHODS IN APPLIED MATHEMATICS, 2025, 25 (02) : 397 - 414
  • [30] A hybrid collocated/staggered version of the Fast Vector Penalty-Projection method for dilatable fluids
    Belliard, Michel
    COMPTES RENDUS MATHEMATIQUE, 2014, 352 (09) : 761 - 766