pith. sign in

arxiv: 1907.08235 · v1 · pith:B7GCNDD3new · submitted 2019-07-18 · 🧮 math.NA · cs.NA

Doubly-Adaptive Artificial Compression Methods for Incompressible Flow

Pith reviewed 2026-05-24 19:27 UTC · model grok-4.3

classification 🧮 math.NA cs.NA
keywords artificial compressionincompressible flowadaptive methodstime step adaptationembedded methodsnumerical analysisfinite element methods
0
0 comments X

The pith

Adapting both time step and artificial compression parameter independently yields embedded first- and second-order methods with negligible extra cost.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper develops artificial compression methods for incompressible flow simulations in which the time-step size and the compressibility parameter ε are adapted separately. Analysis and numerical tests support that first- and second-order versions can be embedded together. The resulting schemes keep computational effort, memory use, and implementation complexity nearly identical to the basic constant-parameter first-order method.

Core claim

Doubly adaptive artificial compression methods allow independent adaptation of the time step k and the artificial compressibility parameter ε. The first- and second-order methods are embedded, and the computational, cognitive, and space complexities remain negligibly greater than those of the simplest constant-ε, constant-k first-order method.

What carries the argument

Doubly-adaptive artificial compression scheme with independent adaptation rules for time step and ε that embed first- and second-order methods.

If this is right

  • The embedded first- and second-order schemes can be run together without separate implementations.
  • Analysis guarantees stability and accuracy for the chosen adaptation strategies.
  • Numerical tests confirm performance comparable to constant-parameter versions.
  • Overall solver complexity stays essentially unchanged from the simplest artificial compression method.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same independent adaptation idea could be tested on other parameters that appear in flow approximations.
  • Embedding allows error estimators to switch orders at runtime with almost no overhead.
  • The approach might combine with existing adaptive mesh or variable time-step codes in computational fluid dynamics.

Load-bearing premise

Adapting the time step and ε preserves the stability and accuracy of the underlying fixed-parameter artificial compression method without adding new instabilities.

What would settle it

A single numerical experiment on a standard incompressible flow benchmark that produces instability or order reduction when the adaptive rules for k and ε are applied, compared with the constant-parameter baseline.

Figures

Figures reproduced from arXiv: 1907.08235 by Michael McLaughlin, William Layton.

Figure 5.1
Figure 5.1. Figure 5.1: Stability and adaptability results. satisfaction of incompressibility; however, [PITH_FULL_IMAGE:figures/full_fig_p018_5_1.png] view at source ↗
Figure 5.2
Figure 5.2. Figure 5.2: Accuracy and adaptability results. ε-values should be imposed in the adaptive algorithm. To compare the GA, Min method and the scheme introduced in [6], we use the test problem given above in this section with a known exact solution. The results are given in [PITH_FULL_IMAGE:figures/full_fig_p019_5_2.png] view at source ↗
Figure 5.3
Figure 5.3. Figure 5.3: Comparison between GA, Min, and CLM methods. [PITH_FULL_IMAGE:figures/full_fig_p020_5_3.png] view at source ↗
read the original abstract

This report presents adaptive artificial compression methods in which the time-step and artificial compression parameter $\varepsilon $ are independently adapted. The resulting algorithms are supported by analysis and numerical tests. The first and second-order methods are embedded. As a result, the computational, cognitive and space complexities of the adaptive $% \varepsilon ,k$ algorithms are negligibly greater than that of the simplest, first-order, constant $\varepsilon ,$ constant $k$ artificial compression method.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 2 minor

Summary. The paper presents doubly-adaptive artificial compression methods for incompressible flow in which the time-step and artificial compression parameter ε are adapted independently. The resulting algorithms are claimed to be supported by analysis and numerical tests; first- and second-order methods are embedded so that the computational, cognitive, and space complexities of the adaptive ε,k algorithms remain negligibly greater than those of the basic first-order constant-ε constant-k scheme.

Significance. If the stability and accuracy claims hold, the work supplies a low-overhead adaptive framework for artificial-compression discretizations of the incompressible Navier-Stokes equations, reducing the need for manual parameter selection while preserving the simplicity of the underlying scheme.

minor comments (2)
  1. [Abstract] Abstract: the phrase 'adaptive $% ε,k algorithms' contains an apparent LaTeX artifact ('$%'); this should be corrected for clarity.
  2. [Abstract] The abstract refers to 'the adaptive ε,k algorithms' without defining k; a brief parenthetical or footnote clarifying the role of k would improve readability for readers unfamiliar with the base artificial-compression literature.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive summary, significance assessment, and recommendation of minor revision. No major comments were provided in the report.

Circularity Check

0 steps flagged

No significant circularity

full rationale

The paper introduces doubly-adaptive artificial compression methods with independent adaptation of time-step and ε, supported by analysis and numerical tests. The embedding of first- and second-order methods and the negligible complexity claim are presented as direct consequences of the algorithmic design rather than reductions to fitted parameters or self-citations by construction. No load-bearing steps reduce to self-definition, renamed known results, or ansatzes imported via citation; the central claims rest on independent analytical and empirical verification against the constant-parameter baseline.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

Based on abstract, no free parameters or invented entities mentioned; relies on standard assumptions in numerical fluid dynamics.

axioms (1)
  • domain assumption The artificial compression method approximates incompressible flow with small ε
    Standard in the field for making Stokes or Navier-Stokes solvable.

pith-pipeline@v0.9.0 · 5591 in / 1104 out tokens · 34541 ms · 2026-05-24T19:27:53.392222+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

38 extracted references · 38 canonical work pages · 2 internal anchors

  1. [1]

    Alnæs, J

    M. Alnæs, J. Blechta, J. Hake, A. Johansson, B. Kehlet, A. Log g, C. Richardson, J. Ring, M.E. Rognes, G.N. Wells , The FEniCS project version 1.5 , Archive of Numerical Software 3 (2015), 9–23

  2. [2]

    Amestoy, I

    P. Amestoy, I. Duff, J.-Y. L’Excellent, and J. Koster , A fully asynchronous multifrontal solver using distributed dynamic scheduling , SIAM Journal on Matrix Analysis and Appli- cations 23 (2001), 15–41

  3. [3]

    Asselin , Frequency filter for time integration , Mon

    R.A. Asselin , Frequency filter for time integration , Mon. W eather Review 100(1972), 487–490

  4. [4]

    Baker , Galerkin approximations for the Navier-Stokes equations , Technical Report,1976

    G.A. Baker , Galerkin approximations for the Navier-Stokes equations , Technical Report,1976

  5. [5]

    J. M. Connors, J. Howell, and W. Layton , Decoupled time stepping for a fluid-fluid inter- action problem , SIAM J. Numer. Anal. 50 (2012), pp. 1297-1319

  6. [6]

    R.M. Chen, W. Layton, and M. McLaughlin , Analysis of variable step/non-autonomous artificial compression methods , JMFM 21 (2018)

  7. [7]

    Dahlquist, W

    G. Dahlquist, W. Liniger and O. Nevanlinna , Stability of two-step methods for variable integration steps , SIAM J. Numer. Anal. 20 (1983), 1071–1085

  8. [8]

    Davis, Direct methods for sparse linear systems , SIAM, vol

    T. Davis, Direct methods for sparse linear systems , SIAM, vol. 2, 2006

  9. [9]

    DeCaria, W

    V. DeCaria, W. Layton and M. McLaughlin , A conservative, second-order, unconditionally stable artificial compression method , CMAME 325 (2017), 733–747

  10. [10]

    A new embedded variable stepsize, variable order family of low computational complexity

    V. DeCaria, A. Guzel W. Layton and Yi Li, A new embedded variable stepsize, variable order family of low computational complexity, https://arxiv.org/abs/1810.06670, 2018

  11. [11]

    A time-accurate, adaptive discretization for fluid flow problems

    V. DeCaria, W. Layton and Haiyun Zhao, Analysis of a low complexity, time-accurate discretization of the Navier-Stokes equations , https://arxiv.org/abs/1810.06705, 2018

  12. [12]

    Egbers and G

    C. Egbers and G. Pfister, Physics of rotating fluids , Springer LN in Physics 549 (2018)

  13. [13]

    Fiordilino, W

    J. Fiordilino, W. Layton, and Y. Rong , An efficient and modular grad-div stabilization , Computer Methods in Applied Mechanics and Engineering 335 ( 2018), 327–346

  14. [14]

    Guermond, P

    J.-L. Guermond, P. Minev and J. Shen , An overview of projection methods for incompressible flows, Comput. Methods Appl. Mech. Engrg. 195 (2006), 6011–6045

  15. [15]

    Guermond and P

    J.-L. Guermond and P. Minev , High-Order Time Stepping for the Incompress- ible Navier–Stokes Equations , SIAM J. Sci. Comput. 37-6 (2015), A2656-A2681 http://dx.doi.org/10.1137/140975231

  16. [16]

    Guermond and P

    J.-L. Guermond and P. Minev , High-order time stepping for the Navier–Stokes equations w ith minimal computational complexity , JCAM 310 (2017), 92–103

  17. [17]

    Guermond and P

    J.-L. Guermond and P. Minev , High-order, adaptive time stepping scheme for the incom- pressible Navier–Stokes equations , technical report 2018

  18. [18]

    Gunzburger , Finite Element Methods for Viscous Incompressible Flows - A Guide to Theory, Practices, and Algorithms , Academic Press, 1989

    M.D. Gunzburger , Finite Element Methods for Viscous Incompressible Flows - A Guide to Theory, Practices, and Algorithms , Academic Press, 1989

  19. [19]

    Guzel and W

    A. Guzel and W. Layton, Time filters increase accuracy of the fully implicit method , BIT Numerical Mathematics, 58 (2018), 301-315. 21

  20. [20]

    A. Hay, S. Etienne, D. Pelletier and A. Garon , hp-Adaptive time integration based on the BDF for viscous flows . JCP, 291 (2015), 151-176

  21. [21]

    Hoffman and C

    J. Hoffman and C. Johnson , Computational turbulent incompressible flow: Applied math e- matics: Body and soul 4 (Vol. 4). Springer, Berlin, 2007

  22. [22]

    Johnston and J.-G

    H. Johnston and J.-G. Liu , Accurate, stable and efficient Navier-Stokes solvers based o n an explicit treatment of the pressure term , JCP 199(2004) 221-259

  23. [23]

    Kay, P.M

    D.A. Kay, P.M. Gresho, P.M., Griffiths and D.J. Silvester , Adaptive time-stepping for in- compressible flow Part II: Navier–Stokes equations. SIAM Journal on Scientific Computing, 32(2010), 111-128

  24. [24]

    Kobel’kov, Symmetric approximations of the Navier-Stokes equations , Sbornik: Mathe- matics

    G.M. Kobel’kov, Symmetric approximations of the Navier-Stokes equations , Sbornik: Mathe- matics. 193(2002), 1027-1047

  25. [25]

    Layton, Y

    W. Layton, Y. Li, and C. Trenchea , Recent developments in IMEX methods with time filters for systems of evolution equations , J. Comp. Applied Math. 299 (2016), 50–67

  26. [26]

    Ohw ada and P

    T. Ohw ada and P. Asinari , Artificial compressibility method revisited: Asymptotic n umerical method for incompressible Navier Stokes equations . J. Comp. Physics, 229:16981723, 2010

  27. [27]

    Prohl , Projection and quasi-compressibility methods for solving the incompressible Navier- Stokes equations , Springer, Berlin, 1997

    A. Prohl , Projection and quasi-compressibility methods for solving the incompressible Navier- Stokes equations , Springer, Berlin, 1997

  28. [28]

    Robert, The integration of a spectral model of the atmosphere by the i mplicit method, Proc

    A. Robert, The integration of a spectral model of the atmosphere by the i mplicit method, Proc. WMO/IUGG Symposium on NWP, Japan Meteorological Soc. , Toky o, Japan, pp. 19-24, 1969

  29. [29]

    Shen , On a new pseudocompressibility method for the incompressib le Navier-Stokes equa- tions, Appl

    J. Shen , On a new pseudocompressibility method for the incompressib le Navier-Stokes equa- tions, Appl. Numer. Math. 21 (1996), 71–90

  30. [30]

    Shen , On error estimates of projection methods for the Navier-Sto kes equations: First-Order Schemes, SINUM 29(1992) 57-77

    J. Shen , On error estimates of projection methods for the Navier-Sto kes equations: First-Order Schemes, SINUM 29(1992) 57-77

  31. [31]

    Shen , On error estimates of higher order projection and penalty-p rojection schemes for the Navier-Stokes equations , Numer

    J. Shen , On error estimates of higher order projection and penalty-p rojection schemes for the Navier-Stokes equations , Numer. Math. 62(1992) 49-73

  32. [32]

    Shen , On error estimates of the projection method for the Navier-S tokes equations: second- order schemes, Math

    J. Shen , On error estimates of the projection method for the Navier-S tokes equations: second- order schemes, Math. Comp. 65(1996)1039-1065

  33. [33]

    Temperton and A

    C. Temperton and A. Staniforth , An efficient two-time level semi-Lagrangian semi-implicit scheme, Q.J.Royal Meteor. Soc. 113(1987),1027-1039

  34. [34]

    Veneziani and U

    A. Veneziani and U. Villa , ALADINS: An algebraic splitting time-adaptive solver for t he incompressible Navier-Stokes equations , JCP 238(2013) 359-375

  35. [35]

    Williams , A proposed modification to the Robert-Asselin time filter , Monthly W eather Review, 137(2009), 2538-2546

    P.D. Williams , A proposed modification to the Robert-Asselin time filter , Monthly W eather Review, 137(2009), 2538-2546

  36. [36]

    Williams , The RA W Filter: An Improvement to the Robert–Asselin Filter in Semi- Implicit Integrations, Mon

    P.D. Williams , The RA W Filter: An Improvement to the Robert–Asselin Filter in Semi- Implicit Integrations, Mon. W eather Rev., 139 (2011), 1996–2007

  37. [37]

    L. Yang, S. Badia and R. Codina , A pseudo-compressible variational multiscale solver for turbulent incompressible flows , Comp. Mechanics 58(2016) 1051-1069

  38. [38]

    Zeytounian , Topics in hyposonic flow theory , Lecture Notes in Physics, Springer, Berlin, 2006

    R.Kh. Zeytounian , Topics in hyposonic flow theory , Lecture Notes in Physics, Springer, Berlin, 2006. 22