Doubly-Adaptive Artificial Compression Methods for Incompressible Flow
Pith reviewed 2026-05-24 19:27 UTC · model grok-4.3
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.
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
- 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
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.
Referee Report
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)
- [Abstract] Abstract: the phrase 'adaptive $% ε,k algorithms' contains an apparent LaTeX artifact ('$%'); this should be corrected for clarity.
- [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
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
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
axioms (1)
- domain assumption The artificial compression method approximates incompressible flow with small ε
Reference graph
Works this paper leans on
- [1]
-
[2]
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
work page 2001
-
[3]
Asselin , Frequency filter for time integration , Mon
R.A. Asselin , Frequency filter for time integration , Mon. W eather Review 100(1972), 487–490
work page 1972
-
[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
work page 1976
-
[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
work page 2012
-
[6]
R.M. Chen, W. Layton, and M. McLaughlin , Analysis of variable step/non-autonomous artificial compression methods , JMFM 21 (2018)
work page 2018
-
[7]
G. Dahlquist, W. Liniger and O. Nevanlinna , Stability of two-step methods for variable integration steps , SIAM J. Numer. Anal. 20 (1983), 1071–1085
work page 1983
-
[8]
Davis, Direct methods for sparse linear systems , SIAM, vol
T. Davis, Direct methods for sparse linear systems , SIAM, vol. 2, 2006
work page 2006
-
[9]
V. DeCaria, W. Layton and M. McLaughlin , A conservative, second-order, unconditionally stable artificial compression method , CMAME 325 (2017), 733–747
work page 2017
-
[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
work page internal anchor Pith review Pith/arXiv arXiv 2018
-
[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
work page internal anchor Pith review Pith/arXiv arXiv 2018
-
[12]
C. Egbers and G. Pfister, Physics of rotating fluids , Springer LN in Physics 549 (2018)
work page 2018
-
[13]
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
work page 2018
-
[14]
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
work page 2006
-
[15]
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]
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
work page 2017
-
[17]
J.-L. Guermond and P. Minev , High-order, adaptive time stepping scheme for the incom- pressible Navier–Stokes equations , technical report 2018
work page 2018
-
[18]
M.D. Gunzburger , Finite Element Methods for Viscous Incompressible Flows - A Guide to Theory, Practices, and Algorithms , Academic Press, 1989
work page 1989
-
[19]
A. Guzel and W. Layton, Time filters increase accuracy of the fully implicit method , BIT Numerical Mathematics, 58 (2018), 301-315. 21
work page 2018
-
[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
work page 2015
-
[21]
J. Hoffman and C. Johnson , Computational turbulent incompressible flow: Applied math e- matics: Body and soul 4 (Vol. 4). Springer, Berlin, 2007
work page 2007
-
[22]
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
work page 2004
- [23]
-
[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
work page 2002
- [25]
-
[26]
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
work page 2010
-
[27]
A. Prohl , Projection and quasi-compressibility methods for solving the incompressible Navier- Stokes equations , Springer, Berlin, 1997
work page 1997
-
[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
work page 1969
-
[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
work page 1996
-
[30]
J. Shen , On error estimates of projection methods for the Navier-Sto kes equations: First-Order Schemes, SINUM 29(1992) 57-77
work page 1992
-
[31]
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
work page 1992
-
[32]
J. Shen , On error estimates of the projection method for the Navier-S tokes equations: second- order schemes, Math. Comp. 65(1996)1039-1065
work page 1996
-
[33]
C. Temperton and A. Staniforth , An efficient two-time level semi-Lagrangian semi-implicit scheme, Q.J.Royal Meteor. Soc. 113(1987),1027-1039
work page 1987
-
[34]
A. Veneziani and U. Villa , ALADINS: An algebraic splitting time-adaptive solver for t he incompressible Navier-Stokes equations , JCP 238(2013) 359-375
work page 2013
-
[35]
P.D. Williams , A proposed modification to the Robert-Asselin time filter , Monthly W eather Review, 137(2009), 2538-2546
work page 2009
-
[36]
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
work page 2011
-
[37]
L. Yang, S. Badia and R. Codina , A pseudo-compressible variational multiscale solver for turbulent incompressible flows , Comp. Mechanics 58(2016) 1051-1069
work page 2016
-
[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
work page 2006
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.