In this paper
AbstractIntroductionPreliminaries and a high-order linear predictorNotation and continuous energy balancesA flexible high-order predictor stepA one-SAV scheme with a uniform boundShifted auxiliary variableUniform stabilityA two-SAV scheme with a uniform bound in two dimensionsShifted auxiliary variableAlgorithm 2: two SAVsPositivity of the higher-energy residualWeighted uniform Gronwall argument and the boundImplementation and comparisonImplementation and computational costTemporal accuracyComparison with existing long-time stable methodsNumerical examplesConvergence testEffect of the SAV corrections on stabilityAdaptive long-time integrationConcluding remarksReferencesWorksMathematics
High-order long-time stable methods for the forced incompressible Navier–Stokes equations
Abstract
We present in this paper two scalar auxiliary variable (SAV) correction steps for constructing long-time stable schemes for the forced incompressible Navier–Stokes equations with no-slip boundary conditions. A main feature is that the same correction steps apply to any linear predictor satisfying the order and spatial regularity requirements in Assumption~P. Their construction and stability analysis are independent of the particular form of the predictor and require no energy estimate for it. The first correction uses a damped, shifted kinetic-energy variable to obtain a uniform-in-time bound in two and three dimensions, together with a weighted dissipation estimate. In two dimensions, the second correction combines a higher-energy auxiliary variable with a scalar relaxation to yield a uniform-in-time bound. Under the stated assumptions, these estimates hold on arbitrary positive time grids, without restrictions on step sizes or adjacent step ratios. We also derive eventual absorbing bounds; for the two-SAV scheme, these apply to the admissible initial class associated with fixed parameters. The generalized BDF schemes require one constant-coefficient Helmholtz solve per velocity component and one pressure Poisson solve per step; the second correction adds no field solve. Numerical experiments exhibit second-, third-, and fourth-order convergence for the tested BDF schemes and illustrate the long-time stability and efficiency of adaptive time stepping.
Introduction
We consider in this paper the construction and long-time stability analysis of efficient numerical schemes for the forced incompressible Navier–Stokes equations
Here and denote the velocity and pressure, respectively, is the kinematic viscosity, and is an external force. We prescribe an initial velocity on a bounded connected domain , , with a sufficiently smooth boundary. For definiteness, we consider the no-slip boundary condition on . The stability and absorption results also extend to the mean-zero periodic setting described in § 2. Throughout the paper, we assume
For long-time simulations, it is desirable that a numerical scheme preserve the dissipative properties of the underlying equations. In the presence of a persistent force, the kinetic energy need not decrease, but the balance between forcing and viscous dissipation still yields an absorbing bound in two and three dimensions and an absorbing bound in two dimensions [3, 29, 22]. Unlike an all-time bound, which may depend on the initial state, an absorbing bound gives a ball that eventually contains the solution and whose radius is independent of that state [13]. Our aim is to construct linear, fully decoupled schemes that retain these properties and can be combined with high-order time discretizations.
Long-time stability of Navier–Stokes discretizations has been studied extensively. Early results include the convergence analysis of a linearized backward Euler scheme for the unforced two-dimensional problem [4], and uniform bounds and discrete-attractor convergence for a forced linear backward Euler scheme [15]. Other developments include implicit Euler and Crank–Nicolson methods [31, 30], direct and fractional-step algorithms [28], and nonlinear Galerkin and Runge–Kutta approximations [14, 24, 21].
For linearly extrapolated BDF2 schemes, Akbas, Kaya, and Rebholz [1] established all-time estimates, and Shiue [27] obtained a refined unconditional long-time bound for the two-dimensional problem. Rebholz and Tone [23] proved long-time stability in the velocity–pressure formulation under a mild time-step restriction. Unconditional long-time bounds were also obtained for first-order and IMEX–BDF2 finite-element schemes in the velocity–vorticity formulation [7]. For the periodic vorticity equation, semi-implicit multistep methods of order up to four allow fully explicit convection and constant-coefficient solves, but their long-time estimates require data-dependent time-step restrictions [5, 34, 2].
The scalar auxiliary variable (SAV) approach, introduced for gradient flows [25, 26], provides an effective way to treat nonlinear terms explicitly while retaining discrete energy control. SAV methods for incompressible flows include the auxiliary-energy-variable method of Lin, Yang, and Dong [18], which requires a nonlinear scalar solve, and the linear, decoupled pressure-correction methods of Li, Shen, and Liu [16]. High-order SAV schemes have been developed for periodic Navier–Stokes equations [9], nonperiodic problems, and rotating flows [35]. However, unconditional stability on a fixed time interval does not imply uniform-in-time boundedness for a forced problem. For example, the weak stability estimate in [10 Theorem 6] and the higher-order error estimates in [12 Theorem 4.1] involve constants that depend on the final time.
Recent SAV methods address the forced problem by introducing auxiliary damping. Han and Wang [6] constructed a SAV–BDF2 scheme with uniform-in-time velocity bounds in two and three dimensions and higher vorticity estimates in a two-dimensional free-slip setting. Lin and Shiue [19] refined the analysis to obtain a time-step-independent energy bound and to allow nonsmooth initial data through regularization. For the two-dimensional periodic vorticity equation, Wang, Wang, and Zhang [33, 32] developed second-order variable-step exponential time-differencing methods with a mean-reverting SAV. These methods require either a scalar cubic solve or a linear auxiliary recovery by numerical inverse Laplace transformation. We seek to combine auxiliary damping with high-order predictors and decoupled constant-coefficient solves, while imposing no time-step restriction in the long-time velocity estimates.
There are two main difficulties. The first is to obtain an bound for the no-slip problem. The provisional velocity is not exactly divergence free, and the pressure and convection terms must be controlled without the cancellations available in the periodic vorticity formulation. The second is to establish a uniform estimate on arbitrary positive time grids. On a nonuniform grid, shifting an index in a time average changes its weights, while large individual steps prevent the direct use of fixed-length discrete windows.
A main contribution of this paper is the construction of two scalar correction steps whose formulation and long-time stability analysis are independent of the particular linear predictor. The same corrections can be combined with any linear predictor satisfying Assumption P. Thus, the generalized BDF schemes presented below are particular realizations of a construction that also applies to other multistep and Runge–Kutta predictors satisfying this assumption.
We first introduce a damped, shifted kinetic-energy variable. Its scalar recursion gives an bound and a weighted dissipation estimate without using an energy estimate for the predictor. In two dimensions, we use the Stokes-pressure estimate of Liu, Liu, and Pego [20] and interpolation inequalities to construct a second scalar equation with a nonnegative residual. A scalar relaxation transfers the first dissipation estimate to the second auxiliary variable. We then apply a uniform Gronwall argument with right-endpoint weights and treat large steps directly. This yields a uniform bound without an upper time-step bound or an adjacent step-ratio condition.
The main contributions of this paper are as follows.
We construct two SAV correction steps that can be combined with any linear predictor satisfying Assumption P. Under the stated hypotheses, their stability estimates hold on arbitrary positive time grids and require no energy estimate for the predictor. The scalar analysis applies to any fixed correction degree.
For the correction step with one-SAV, we prove uniform-in-time velocity bounds in two and three dimensions. The estimate separates the decaying initial-data contribution from the forcing-dependent bound and yields an eventual absorbing radius (Theorem 3.3).
For the correction step with two-SAV, we prove a uniform-in-time velocity bound in two dimensions. We also establish eventual absorbing bounds for fixed algorithmic parameters and their admissible initial class (Theorem 4.5 and Corollary 4.7).
The schemes are easy to implement. The generalized BDF schemes require one constant-coefficient Helmholtz solve for each velocity component and one pressure Poisson solve per step. The two-SAV extension adds only scalar operations and a velocity rescaling. Numerical tests exhibit high-order accuracy and illustrate the effect of the corrections on long-time stability and the efficiency of adaptive time stepping. The convergence order of each coupled scheme requires a separate analysis and depends on the predictor, the starting values, and the consistency of the SAV ratios.
The rest of this paper is organized as follows. Section 2 introduces the notation, energy balances, and linear predictor. We present and analyze the one-SAV and two-SAV schemes in Sections 3 and 4, respectively. Section 5 discusses implementation, temporal accuracy, and related methods. Numerical experiments are presented in Section 6, followed by concluding remarks in Section 7.
Preliminaries and a high-order linear predictor
We introduce some notation and recall the energy balances. We then present a generalized BDF predictor on a nonuniform time grid.
Notation and continuous energy balances
We denote by and the inner product and norm in , and use the same notation for scalar and vector function spaces. Set
There is a Poincaré constant such that
For periodic boundary conditions, we assume that the forcing and initial velocity histories have zero mean, apply
to the right-hand side of each velocity predictor, and take the pressure in . The scalar corrections preserve zero mean, so (2.1) holds for the periodic iterates.
Taking the inner product of (1.1a) with gives
In two dimensions, taking the inner product with gives
where
We introduce positive shifts and define
The shifts keep the energy ratios below well defined without changing the continuous energy balances. Unless otherwise stated, the stability constants may depend on , , the correction degree , the forcing bound, and the fixed algorithmic parameters, but not on the final time or the time grid. Dependence on the initial data is stated separately.
A flexible high-order predictor step
Let
For a fixed , take ; for absorption, assume . On a constant grid, . The scalar estimates in late sections apply to any well-defined linear predictor with newly computed provisional velocity. We only need to make the following assumption on the linear predictor.
Assumption P. For any , the linear predictor is of order for some and produces provisional velocity .
Examples include linearly implicit multistep and Runge–Kutta methods. As a particular example, we use the generalized BDF formulas of [11] with extrapolated nonlinear term and pressure as the predictor. More precisely, for an order and a shift , define
Polynomial interpolation at the time nodes determines the coefficients. The operator approximates the derivative at , while and approximate the solution there to order . On a constant grid these reduce to the formulas in [11]; gives classical BDF. With , set
Only is unknown. To verify solvability, set . The leading Lagrange basis functions for the derivative and diffusion interpolants are
Since , all factors are positive and
Hence (2.7) has the form with , and is uniquely solvable. For an right-hand side, elliptic regularity gives under the stated domain assumptions.
We use a well-defined linear starting procedure and apply the SAV updates at every starting step. The derivative and diffusion terms use the provisional-velocity histories, while the explicit convection uses the corrected histories. High-order convergence requires order-compatible starting values and the stability conditions of the chosen predictor.
A one-SAV scheme with a uniform bound
We construct a one-SAV scheme and prove a uniform bound and a weighted dissipation estimate for the corrected velocity.
Shifted auxiliary variable
Set . For parameters , define
The scalar equation
is equivalent to (5) when . We shall choose and so that is nonnegative. We propose the following scheme.
Algorithm 1. Given , , and the required history, perform the following steps.
Step 1: velocity predictor. Compute from
with the prescribed boundary condition. Other linear predictors from Section 2.2 may replace (13).
Step 2: shifted SAV correction. Evaluate
and compute from
or, equivalently,
Define
Step 3: pressure recovery. Find such that
Equation (18) is a constant-coefficient Poisson problem. Set .
Remark 3.1 (Order-preserving correction). On a fixed interval , let . The polynomial satisfies and . Thus the correction is compatible with an order- predictor, provided that .
Uniform stability
Assume
We shall use the following damped scalar recursion (cf. [24, Lemma 1]).
Lemma 3.2 (Damped scalar recursion). Let , , and let be nonnegative with . If
then, with and ,
Moreover, .
Proof. Set . Then . Subtract and iterate to obtain (3.11). The last assertion follows from . □
Define
For , define the nondecreasing function
The following estimates also hold for the first correction in Algorithm 2.
Theorem 3.3 (All-time bounds and velocity absorption). Let or and assume (1.2), (3.9), and the predictor satisfies Assumption P. Initialize . Then, on any positive time grid, Algorithm 1 satisfies
where . Furthermore,
If for , then for every ,
If , then for each the velocity eventually lies in the ball with radius
The radius is independent of the initial data and time grid. Entry is uniform over bounded sets of initial energies.
Proof. Young’s inequality gives
Using (3.9) and the Poincaré inequality yields
The denominator in (3.6) is at least , so implies by induction. It follows from (3.5) that
Lemma 3.2 proves (3.14).
To estimate the corrected velocity, we use the identity
which implies for . Whenever ,
Taking proves (25). For the pressure estimates below, set
Multiplying (15) at step by , summing over , and using (28), we find
Since
we obtain (26).
For the absorbing bound, let . Lemma 3.2 gives
Choose an index such that
Then for every , and (31) with proves the eventual bound for . Replacing in (34) by a bound over an initial set makes the entry criterion uniform over that set. □
Remark 3.4 (Transient bounds and absorbing radii). The all-time bound depends on the initial energy through ; the absorbing radius (27) is independent of it (cf. [13, 14]). If , then gives
Thus the initial contribution decays exponentially when the steps are bounded, while (33) holds on arbitrary positive grids.
A two-SAV scheme with a uniform bound in two dimensions
In this section, we assume that and the domain has a boundary. We introduce a second SAV and establish a uniform-in-time bound by combining the weighted dissipation estimate for the first SAV with the Stokes-pressure estimate of [20], two-dimensional interpolation inequalities, and a discrete uniform Gronwall argument. The scheme uses the velocity and pressure computed in Algorithm 1 and requires no additional Helmholtz or Poisson solve.
Shifted auxiliary variable
Let and choose . Define
so that
Using (7), set
Then
reduces to (6) when , since the additional terms cancel and the right-hand side equals . Sufficient parameter conditions for a nonnegative discrete residual will be given below.
Algorithm 2: two SAVs
Given , , , and the required histories, perform the following steps.
Steps 1–3. Compute the velocity predictor, first SAV correction, and pressure as in Algorithm 1.
Step 4: recursive higher-energy update. Define
and
Compute a provisional scalar from
or, explicitly,
Step 5: scalar relaxation and final correction. Set
and define
The relaxation (46) bounds the new scalar by the shifted energy of and thus transfers the time-averaged estimate from the first SAV to . Together with the recursion (44), this allows us to apply a uniform Gronwall argument. The pressure is recovered before the second rescaling so that the residual (42) uses the pair .
Positivity of the higher-energy residual
Lemma 4.1 (Two-dimensional pressure and convection estimates). Let and let satisfy
Assume . For every sufficiently small , there exist constants , independent of , , and the time grid, such that
The constants may depend on , , and .
Proof. Let be the Leray projection and set and . It follows from (48) that
The Stokes-pressure estimate in [20] gives
This estimate holds for without a divergence-free constraint. Hence,
By the two-dimensional interpolation inequality and elliptic regularity, we have
Applying Young’s inequality, we obtain, for every ,
Since is an contraction, the same bound holds for . Taking and using , we obtain (49). Taking gives (50), while (51) follows from Young’s inequality.
Lemma 4.1 yields the following sufficient conditions for positivity of the higher-energy residual.
Proposition 4.2 (Positivity of the second residual). Let and fix . With the constants from Lemma 4.1, assume
Then
where . In particular, .
Proof. The estimates (49)–(51) with , , and use the fraction of the viscous term. Together with (52), this gives (53). Finally, .
Weighted uniform Gronwall argument and the bound
We shall use the following variable-step version of the discrete uniform Gronwall lemma [24 Lemma 3]. Its right-endpoint weights agree with those in the dissipation estimate for the first SAV.
Lemma 4.3 (Variable-step uniform Gronwall inequality). Let be nonnegative and . Suppose
Fix integers , set , and assume
Then
without a restriction on adjacent step ratios. If , , are uniformly bounded over a family of intervals with , then (56) gives a uniform bound at their endpoints.
Proof. Iterating (54) from to , we obtain
With empty products equal to one and empty sums equal to zero, this also holds for . Since the coefficients are nonnegative and , we have
Multiplying by , summing over , and dividing by , we obtain (56) from (55). The last assertion follows directly. □
For Algorithm 2, the first SAV controls the right-endpoint average . We next establish the recursion required by Lemma 4.3.
Lemma 4.4 (Recursion and upper energy bound). Assume the conditions of Proposition 4.2 and . Then
and
Proof. By Proposition 4.2, the denominator in (45) is at least one, and the numerator is positive whenever . Thus , and (46) gives (57) by induction. Dropping the denominator in (45) and using gives (58). □
We now prove the uniform bound.
Theorem 4.5 (All-time stability on arbitrary positive grids). Let , , and . Assume (1.2), (3.9), (4.18), and the predictor satisfies Assumption P. For some fixed , suppose that
and that the starting histories satisfy
Require all velocity histories to satisfy the prescribed homogeneous Dirichlet conditions. Initialize
and apply both SAV updates and the scalar relaxation at every starting step. Prescribe the initial pressure in and apply pressure recovery to each newly computed positive-time velocity. Let the subsequent values be generated by Algorithm 2. Then
The constants may depend on the initial data and fixed algorithmic parameters, but are independent of , , and all step sizes. The bounds require neither an upper step-size bound nor a restriction on adjacent step ratios, and hold for all on an infinite positive grid.
Proof. By Theorem 3.3, the first correction satisfies and (3.16). For , set
Fix the reference window length at , independently of the grid. For any interval of length at most with for , (3.16) and (4.23) imply
Here .
Taking , we shall prove
First, for any step , the one-step estimate (3.16) gives
Thus .
For a fixed endpoint , let be the index of the last step of size at least 1 among steps , and set if there is no such step. All steps after are less than 1. If , iterating (4.24) and using (4.27), we obtain
The case is included. If , choose the largest such that . Since , we have . Lemma 4.3, with , , , and (4.27), yields
This proves (4.28).
To estimate the velocity, note that and
It follows that , and hence
Also . Thus (4.25) holds with and , including because .
Remark 4.6 (Regularity of the starting values). At the first full multistep update, enters the derivative and explicit convection, but not the diffusion interpolation. In two dimensions, we have
Thus its convection contribution belongs to for initial data. The estimate fails when both factors are only in , so the argument does not cover .
For the generalized diffusion interpolation, each independent old provisional velocity with a nonzero diffusion coefficient must satisfy , or equivalently under the stated boundary and domain assumptions. Together with , this gives an right-hand side for the Helmholtz equation. Elliptic regularity yields , scalar rescaling preserves this regularity, and pressure recovery gives . Repeating the argument gives the same regularity at all subsequent steps.
These sufficient regularity conditions can be weakened if a diffusion coefficient vanishes or a history combination has additional regularity. For classical BDF, diffusion is evaluated only at the new time level, so starting velocity histories suffice for the first full multistep predictor. The regularity justifies each solve and residual evaluation; no uniform-in-time bound is assumed or obtained.
Applying the preceding argument after the first scalar enters its absorbing interval gives the following result.
Corollary 4.7 (Eventual velocity bounds). Fix the algorithmic parameters and consider initialized histories satisfying the hypotheses of Theorem 4.5 with these parameters. Let . For , set and choose by (3.24). Then
Consequently, at all such endpoints,
Thus (65) defines an absorbing ball for the admissible initial class, with radius independent of the particular history and the time grid. The entry criterion is uniform over bounded sets of admissible initial energies.
Proof. By Theorem 3.3, for . Hence (26) and (61) hold with on every interval starting at or after . We apply the proof of Theorem 4.5 starting at . If a step of size at least 1 occurs among steps , let be the index of the last such step. Then . For , direct iteration gives the bound . Otherwise, the remaining steps are less than 1, and we apply Lemma 4.3 on an interval with . If no such large step occurs after , the condition gives the same backward interval. This proves (64) without a bound on . Finally, (31) and (63) yield (65).
Remark 4.8 (Parameter dependence and the meaning of absorption). To impose (52) uniformly on an initial class whose all-time bound satisfies , fix . Corollary 4.7 then gives a common absorbing radius for this class. The radius depends on the fixed , but not on the particular initial history or its norm. Enlarging the class may require a different and hence a different radius. The all-time bound retains its dependence on and through and .
Implementation and comparison
In this section, we discuss the implementation and temporal accuracy of the two schemes, and compare their long-time stability properties and computational costs with those of existing methods.
Implementation and computational cost
After spatial discretization, the generalized BDF predictor takes the form
where and are the fixed mass and Laplace matrices, respectively, and contains only known quantities. The pressure is recovered by solving the Poisson equation
For a fixed spatial mesh and a constant time step, we can factorize the matrices in (66)–(67) once and reuse the factorizations at subsequent steps. For variable time steps, the spatial operators remain unchanged, but the scalar weights in the Helmholtz matrix may require a new factorization. Finite-element, finite-difference, and spectral discretizations on nonperiodic domains preserve this constant-coefficient structure in space.
In addition to the field solves and the evaluation of residuals and norms, Algorithm 1 requires the scalar division (16) and one velocity rescaling. Algorithm 2 adds the division (45), the minimum in (46), and a second rescaling. Hence, the stronger bound requires no additional Helmholtz or Poisson solve. The coefficients of the linear systems are independent of the numerical velocity, and no nonlinear iteration is needed. These costs are for the multistep schemes presented above; the cost of a Runge–Kutta predictor depends on its stages.
The stability results are established for the time-discrete schemes. To obtain mesh-uniform estimates for a fully discrete scheme, one needs discrete counterparts of the Poincaré, pressure, and interpolation estimates used in the analysis. In particular, for standard finite elements, replacing the continuous Laplacian in the higher-energy residual by an elementwise Laplacian requires further analysis.
Temporal accuracy
The correction polynomials convert a first-order error in the SAV ratios into higher-order perturbations of the velocity. On a fixed time interval , let . Then
For the minimum relaxation, we have
so the minimum does not increase the provisional ratio error relative to the current shifted energy. The ratio estimates in (68) require an error analysis of the coupled schemes; they do not follow from uniform boundedness alone.
For the BDF scheme, we retain the provisional histories in the derivative and diffusion terms and use corrected velocities in the explicit terms, as in the degree- correction of [9]. For a one-step method restarted from the corrected velocity, a perturbation of order at each step can accumulate to order on a constant grid. In this case, a degree- correction is one possible choice, provided that the corresponding ratio-consistency estimates hold. The scalar stability analysis applies to both choices and, more generally, to any fixed correction degree.
High-order convergence further requires sufficiently smooth solutions and forcing, starting values of the appropriate order, and the stability and time-grid conditions of the predictor. Thus, boundedness on arbitrary positive grids does not imply accuracy on such grids or zero-stability of classical BDF formulas at all orders. A finite-time error analysis of the coupled schemes remains to be developed.
Remark 5.1 (Relaxation variants). Any alternative relaxation satisfying
preserves the two inequalities used in the stability proof. Accuracy also requires consistency of the scalar ratio. For example, one half of the minimum satisfies both inequalities but need not converge to the continuous energy. Hence, these stability conditions alone do not ensure the accuracy of an alternative relaxation.
Comparison with existing long-time stable methods
In Table 1, we compare methods for which uniform-in-time bounds have been proved. The third column gives the order and time-step conditions of the cited long-time analysis. For the present schemes, we list the correction degree, since the stability analysis for an arbitrary degree does not establish the corresponding convergence order.
| Method and reference | Setting and uniform bound | Order and long-time condition | Principal solves per step |
| Fully implicit Euler and Crank–Nicolson [31, 30] | No-slip, 2D; velocity and | Orders 1 and 2; the analysis requires a time-step condition (CFL type for Crank–Nicolson) | Nonlinear velocity–pressure problem |
| Linear backward Euler [15] | Primitive variables, 2D; no-slip or periodic; bounds in and , where is the Stokes operator | Order 1; bounds uniform with respect to | Linear Oseen/Stokes problem with a convection coefficient depending on the solution |
| Linearly extrapolated BDF2 [1, 23, 27] | Primitive variables, no-slip; velocity in 2D/3D and in 2D | Order 2; unconditional; requires a mild time-step restriction in the cited analysis | Linear Oseen/Stokes problem with a convection coefficient depending on the solution |
| Velocity–vorticity IMEX finite elements [7] | Periodic, 2D; velocity and vorticity in both and | BDF2 and a first-order variant; unconditional | Two sequential linear Oseen-type field solves; the vorticity solve is decoupled |
| Explicit-convection periodic vorticity schemes [5, 34, 2] | Periodic, 2D; vorticity and , with higher Sobolev bounds in the later schemes | Orders 1–4; time-step restriction | One or two constant-coefficient Poisson/heat solves, depending on the scheme |
| Earlier high-order SAV–IMEX scheme [9] | Periodic, 2D/3D; velocity in 2D and in 3D; zero external force in the analyzed model | BDF orders 1–5; unconditional | One constant-coefficient Poisson-type velocity solve and an explicit scalar update |
| Forced SAV–BDF2 scheme [6, 19] | Periodic, no-slip, or free-slip; velocity in 2D/3D; vorticity and in the 2D free-slip setting | Order 2; unconditional; the later analysis allows nonsmooth initial data and gives a -independent energy bound | Two constant-coefficient Brinkman/Stokes solves and one linear scalar update |
| Variable-step ETD–mr-SAV schemes [33, 32] | Periodic, 2D; vorticity | Variable-step order 2 (with an embedded first-order companion); unconditional | [33]: two heat solves and a scalar cubic; [32]: two heat solves and a linear scalar recovery by Laplace–Talbot inversion |
| Present one-SAV scheme | Velocity for no-slip problems in 2D/3D | Any correction degree ; arbitrary positive variable steps | One vector Helmholtz solve, one Poisson solve, and one scalar division |
| Present two-SAV scheme | No-slip, 2D; velocity | Any correction degree ; arbitrary positive variable steps | The same field solves, plus one scalar division and a scalar relaxation |
Table 1. Comparison of numerical schemes with proved uniform-in-time bounds for the Navier–Stokes equations. Here “unconditional” means that the cited long-time estimate requires no CFL-type or data-dependent time-step restriction.
The methods in Table 1 differ mainly in the systems to be solved at each step. Fully implicit methods require nonlinear solves. Linearly extrapolated BDF2 and velocity–vorticity methods lead to linear Oseen-type systems whose coefficients depend on the numerical solution. The periodic vorticity methods with explicit convection use constant-coefficient operators, but their cited long-time estimates require time-step restrictions.
Among the SAV methods, the high-order scheme in [9] treats the unforced periodic problem. The forced SAV–BDF2 schemes in [6, 19] provide uniform-in-time bounds and require constant-coefficient Brinkman/Stokes solves. The variable-step ETD methods in [33, 32] treat the two-dimensional periodic vorticity equation and require either a scalar cubic solve or a linear auxiliary recovery by numerical Laplace inversion.
Our schemes use the velocity–pressure formulation and require only decoupled Helmholtz/Poisson solves and explicit scalar updates. The second SAV strengthens the velocity bound in two dimensions without additional field solves. Moreover, the scalar estimates are valid for the admissible predictors and arbitrary positive time grids.
Numerical examples
In this section, we present three groups of numerical tests in two dimensions with no-slip boundary conditions. We first verify the temporal convergence of the two-SAV scheme. We then compare the BDF3 predictor with and without SAV corrections, and finally examine the efficiency of adaptive time stepping for a problem with a short initial transient and persistent long-time motion. We use constant time steps in the first two tests and variable time steps in the third. The algorithmic parameters are fixed within each refinement study.
Convergence test
We take , , and , and choose the forcing such that the exact velocity and pressure are given by
We use the Legendre–Galerkin method in space with polynomial degree . In each coordinate, the velocity basis consists of , , where is the Legendre polynomial of degree . For the pressure, we use all polynomials up to degree 32 and fix the constant mode by the zero-mean condition. We test the generalized BDF schemes of orders with the shifts and time steps
For Algorithm 2, we set
We use correction degree and the minimum relaxation (4.12). The derivative and diffusion terms use the provisional velocity histories, while the explicit convection uses the final corrected velocities. The pressure is recovered from the first corrected velocity before applying the second SAV correction.
For , we define the errors at the final time by
Here , and the numerical and exact pressures have zero mean. From Figure 1, we observe the expected orders 2, 3, and 4 for both velocity and pressure in the two norms over the tested range of time steps.

Figure 1. Temporal convergence of Algorithm 2 for (6.1) at . Solid lines with filled markers show the results for , with different colors and marker shapes. Dotted segments of the same colors indicate slopes 2, 3, and 4, respectively.
Next, let denote the exact velocity in (6.1), and define the scalar and ratio errors by
In Figure 2, we observe approximately first-order convergence of these errors. Thus, in this test, first-order scalar errors coexist with higher-order velocity and pressure convergence, consistent with (68). The minimum relaxation is active in these computations. All computed SAV residuals are nonnegative, and all update denominators are positive.

Figure 2. Scalar and ratio errors for Algorithm 2 in the convergence test. Dotted lines indicate slope one. The scalar errors are first order, while the velocity and pressure errors have the higher orders shown in Figure 1.
Effect of the SAV corrections on stability
We compare the BDF3 predictor with and without the two SAV corrections on the unit disk and the square , both with no-slip boundary conditions. In each comparison, the predictor and spatial discretization are unchanged, so the difference is due to the scalar updates and rescalings.
We first consider the unit disk. Set , , , and prescribe
The velocity is smooth and divergence free. We evaluate the bounded force analytically from
independently of the numerical solution.
We use the Fourier–Jacobi velocity space , with and quadrature points. The BDF3 formula uses the provisional velocity histories, while convection uses . We use the scalar updates, pressure recovery, and minimum relaxation of Algorithm 2 with cubic correction polynomials. We take , , and
Both computations use the same forcing, spatial operators, and RK4 startup with 20 substeps on each of the first two intervals. The computation without SAV omits only the scalar updates and rescalings. Neither computation uses filtering or resets to the exact solution.
In Figure 3, we observe that the uncorrected predictor becomes unstable near , while the two-SAV solution remains bounded through all 3000 steps. In Figure 4, we compare the numerical solutions with the exact solution. For the two-SAV scheme, the maximum relative errors over the full interval are 2.0118% and 7.1616% for velocity in and the full norm, respectively, and 0.7921% for pressure in .

Figure 3. Velocity norms normalized by their initial values (, ). Top: results with and without SAV on logarithmic scales. Bottom: two-SAV results on linear scales.

Figure 4. Relative errors. Left: two-SAV velocity and pressure errors in percent. Right: velocity errors with and without SAV on a logarithmic scale.
This example also shows that boundedness does not ensure accuracy. For and , the two-SAV solution remains bounded, but its maximum relative velocity error is about 21%. With , both methods give accurate results for . Thus, although the scalar corrections control the velocity norms, the time step must still be chosen to resolve the solution.
The analysis in Section 4 uses a Stokes-pressure estimate for domains with boundaries. We next consider a square to test the scheme on a polygonal domain, which is outside this assumption. We consider with homogeneous no-slip boundary conditions. Let and retain the disk data
with , , and . Writing , we prescribe
Since on , the extended initial velocity belongs to and is weakly divergence free. We do not assume that the extended disk field is an exact time-dependent solution on the square.
We use a Legendre–Galerkin BDF3 predictor in , with , , and . Both computations use the same projected initial data and RK4 starting histories, with 20 substeps per initial interval. For the two-SAV scheme, we use cubic corrections and the minimum relaxation, with
The computation without SAV omits only the scalar updates and rescalings. We evaluate the initial-data and forcing integrals on their disk support, and the velocity integrals on the entire square.
In Figure 5, the computation without SAV becomes unstable: exceeds at . The two-SAV computation reaches , with maximum normalized and full norms of 1.0873 and 1.0476, respectively. All computed SAV residuals and update denominators are positive. We observe the same qualitative stability behavior as on the disk. Extending the stability analysis to polygonal domains remains an open problem.

Figure 5. Stability comparison on the square at . Velocity norms are normalized by the corresponding continuous initial norms. The main axes show all recorded values; the computation without SAV terminates at the runaway threshold before . Insets show enlarged views of the two-SAV norm histories.
Adaptive long-time integration
We now examine the efficiency of adaptive time stepping. We combine the two-SAV corrections with the two-stage IMEX–SDIRK2 predictor and embedded step-selection strategy of [17], replacing its SAV equation by our scalar equations and minimum relaxation. Each step starts from the corrected velocity. For this second-order predictor, we use the cubic rescalings and , as discussed in Section 5. We set the embedded relative velocity tolerance to and the tolerance for the scalar indicator to 0.5. The safety factor is 0.9, the initial step is , and the step bounds are . If a step is rejected, all trial velocity, pressure, and scalar values are discarded.
On the no-slip unit disk, let , , and prescribe
We evaluate the bounded force analytically from . We use , , 19 65 quadrature points, and the SAV parameters of the preceding disk example. The solution has an initial layer on the time scale 0.01, followed by persistent motion with period . All computations use the same spatial operators, forcing, and initial data, with final time and no solution resets.
We first test several constant time steps up to . Among these, is the largest for which the maximum relative velocity error is at most 5% in . Both the fixed-step and adaptive two-SAV schemes satisfy this requirement over , with maximum errors 2.444% and 0.949%, respectively. In Figure 6, we observe that the adaptive scheme uses small steps to resolve the initial layer and larger steps thereafter. The number of accepted steps decreases from 200000 to 14083, with two rejected trials, and the reported solver wall time decreases from 591.92 to 42.01 seconds, giving a speedup of 14.09. Both methods meet the same accuracy requirement, but their errors are not matched. In particular, the fixed-step solution is more accurate after the initial transient (Figure 7(b)).

Figure 6. Efficiency of the adaptive two-SAV scheme. Top: accepted step sizes over the full interval and during the initial transient. Bottom: cumulative step counts and solver wall times compared with the fixed-step two-SAV scheme.

Figure 7. (a) Velocity norms with and without SAV on the same adaptive time grid; the computation without SAV terminates near . (b) Relative velocity errors of the adaptive and fixed-step two-SAV schemes, with a logarithmic time axis.
Finally, we repeat the computation on the accepted adaptive grid without SAV corrections. The uncorrected solution becomes unstable near , while the two-SAV solution remains bounded to (Figure 7(a)), with a maximum relative velocity error of 2.640%. A computation without SAV that selects its own adaptive steps also reaches , with maximum relative velocity error 0.737%. Thus, the comparison on the same grid shows the stabilizing effect of the SAV corrections, while a suitable adaptive grid also allows the uncorrected method to remain stable in this example. The reported speedup compares adaptive and fixed steps within the two-SAV method.
Concluding remarks
We constructed in this paper two SAV correction steps for the forced incompressible Navier–Stokes equations. A main feature is that their formulation and long-time stability analysis are independent of the particular linear predictor. The same correction steps apply to any linear predictor satisfying Assumption P. The first correction uses a damped, shifted kinetic-energy variable to obtain uniform-in-time velocity bounds in two and three dimensions. In two dimensions, the second correction combines a higher-energy scalar equation with a relaxation to yield a uniform-in-time bound. Under the stated assumptions, the estimates hold on arbitrary positive time grids. We also established eventual absorbing bounds; for the two-SAV scheme, these apply to the admissible initial class associated with fixed algorithmic parameters.
The analysis combines the weighted dissipation estimate from the first SAV with the Stokes-pressure estimate and a discrete uniform Gronwall argument. By retaining right-endpoint weights and treating large steps directly, we avoid restrictions on step sizes and adjacent step ratios. The scalar estimates do not require an energy identity for the predictor. Moreover, the second SAV requires no additional Helmholtz or Poisson solve.
The numerical results exhibit second-, third-, and fourth-order convergence for the tested BDF schemes and illustrate the effect of the scalar corrections on long-time stability. In the adaptive example, variable steps reduced the reported computational time by about a factor of fourteen relative to the fixed-step two-SAV computation, while both satisfied the same accuracy requirement. This result demonstrates the benefit of adaptivity for the tested implementation.
The uniform-in-time bounds established here do not by themselves imply uniform-in-time accuracy. Solutions of the forced Navier–Stokes equations need not be stable with respect to perturbations of the initial data. Consequently, small discretization errors may be amplified over long times even when both the exact and numerical solutions remain bounded. Error estimates of the expected convergence order with constants independent of the final time generally require additional stability assumptions on the exact solution, such as uniform exponential stability [8]. A finite-time error analysis of the coupled schemes and the approximation of long-time statistical quantities remain to be studied.
References
- [1]M. Akbas, S. Kaya, and L. G. Rebholz. On the stability at all times of linearly extrapolated BDF2 timestepping for multiphysics incompressible flow problems. Numer. Methods Partial Differ. Equ., 33(4):999–1017, 2017.DOI
- [2]K. Cheng and C. Wang. Long time stability of high order multistep numerical schemes for two-dimensional incompressible Navier–Stokes equations. SIAM J. Numer. Anal., 54(5):3123–3144, 2016.DOI
- [3]P. Constantin and C. Foias. Navier–Stokes Equations. University of Chicago Press, Chicago, 1988.DOI
- [4]T. Geveci. On the convergence of a time discretization scheme for the Navier–Stokes equations. Math. Comput., 53(187):43–53, 1989.DOI
- [5]S. Gottlieb, F. Tone, C. Wang, X. Wang, and D. Wirosoetisno. Long time stability of a classical efficient scheme for two-dimensional Navier–Stokes equations. SIAM J. Numer. Anal., 50(1):126–150, 2012.arxiv.org/abs/1105.4349
- [6]D. Han and X. Wang. Long-time stable SAV-BDF2 numerical schemes for the forced Navier–Stokes equations. arXiv preprint arXiv:2410.06362, 2024.arxiv.org/abs/2410.06362
- [7]T. Heister, M. A. Olshanskii, and L. G. Rebholz. Unconditional long-time stability of a velocity–vorticity method for the 2D Navier–Stokes equations. Numer. Math., 135(1):143–167, 2017.arxiv.org/abs/1511.08072
- [8]John G Heywood and Rolf Rannacher. Finite element approximation of the nonstationary Navier–Stokes problem, part II: stability of solutions and error estimates uniform in time. SIAM journal on numerical analysis, 23(4):750–777, 1986.
- [9]F. Huang and J. Shen. Stability and error analysis of a class of high-order IMEX schemes for Navier–Stokes equations with periodic boundary conditions. SIAM J. Numer. Anal., 59(6):2926–2954, 2021.arxiv.org/abs/2103.11025
- [10]F. Huang and J. Shen. Stability and error analysis of a second-order consistent splitting scheme for the Navier–Stokes equations. SIAM J. Numer. Anal., 61(5):2408–2433, 2023.DOI
- [11]F. Huang and J. Shen. On a new class of BDF and IMEX schemes for parabolic type equations. SIAM J. Numer. Anal., 62(4):1609–1637, 2024.arxiv.org/abs/2405.00300
- [12]F. Huang and J. Shen. Stability and error analysis of a new class of higher-order consistent splitting schemes for the Navier–Stokes equations. Math. Comput., 95(362):2789–2816, 2026.arxiv.org/abs/2507.01296
- [13]A. R. Humphries and A. M. Stuart. Runge–Kutta methods for dissipative and gradient dynamical systems. SIAM J. Numer. Anal., 31(5):1452–1485, 1994.DOI
- [14]F. Jauberteau, C. Rosier, and R. Temam. A nonlinear Galerkin method for the Navier–Stokes equations. Comput. Methods Appl. Mech. Eng., 80(1-3):245–260, 1990.
- [15]N. Ju. On the global stability of a temporal discretization scheme for the Navier–Stokes equations. IMA J. Numer. Anal., 22(4):577–597, 2002.
- [16]X. Li, J. Shen, and Z. Liu. New SAV-pressure correction methods for the Navier–Stokes equations: Stability and error analysis. Math. Comput., 91(333):141–167, 2022.arxiv.org/abs/2002.09090
- [17]H. Liao, H. Wang, and X. Wang. An efficient IMEX-SDIRK2 mr-ccSAV scheme for the forced Navier–Stokes equations with uniform-in-time enstrophy bounds. arXiv preprint arXiv:2608.22445, 2026.arxiv.org/abs/2608.22445
- [18]L. Lin, Z. Yang, and S. Dong. Numerical approximation of incompressible Navier–Stokes equations based on an auxiliary energy variable. J. Comput. Phys., 388:1–22, 2019.DOI
- [19]Q.-Y. Lin and M.-C. Shiue. On the unconditional long-time L² stability of the SAV–BDF2 time-stepping schemes for the forced Navier–Stokes equations with nonsmooth initial data. Appl. Math. Lett., 171:109665, 2025.DOI
- [20]J.-G. Liu, J. Liu, and R. L. Pego. Stability and convergence of efficient Navier–Stokes solvers via a commutator estimate. Commun. Pure Appl. Math., 60(10):1443–1487, 2007.DOI
- [21]C. Lubich and A. Ostermann. Runge–Kutta time discretization of reaction–diffusion and Navier–Stokes equations: Nonsmooth-data error estimates and applications to long-time behaviour. Appl. Numer. Math., 22(1–3):279–292, 1996.DOI
- [22]A. J. Majda and X. Wang. Nonlinear Dynamics and Statistical Theories for Basic Geophysical Flows. Cambridge University Press, Cambridge, 2006.DOI
- [23]L. G. Rebholz and F. Tone. Long-time H¹-stability of BDF2 time stepping for 2D Navier–Stokes equations. Appl. Math. Lett., 141:108624, 2023.DOI
- [24]J. Shen. Long time stability and convergence for fully discrete nonlinear Galerkin methods. Appl. Anal., 38(4):201–229, 1990.DOI
- [25]J. Shen, J. Xu, and J. Yang. The scalar auxiliary variable (SAV) approach for gradient flows. J. Comput. Phys., 353:407–416, 2018.DOI
- [26]J. Shen, J. Xu, and J. Yang. A new class of efficient and robust energy stable schemes for gradient flows. SIAM J. Numer. Anal., 57(3):1647–506, 2019.arxiv.org/abs/1710.01331
- [27]M.-C. Shiue. On the unconditional long-time L²-stability of the BDF2 time stepping scheme for the two-dimensional Navier–Stokes equations. Appl. Numer. Math., 214:104–109, 2025.DOI
- [28]J. C. Simo and F. Armero. Unconditional stability and long-term behavior of transient algorithms for the incompressible Navier–Stokes and Euler equations. Comput. Methods Appl. Mech. Eng., 111(1–2):111–154, 1994.DOI
- [29]R. Temam. Infinite-Dimensional Dynamical Systems in Mechanics and Physics, volume 68 of Applied Mathematical Sciences. Springer, New York, 1988.
- [30]F. Tone. On the long-time stability of the Crank–Nicolson scheme for the 2D Navier–Stokes equations. Numer. Methods Partial Differ. Equ., 23(5):1235–1248, 2007.DOI
- [31]F. Tone and D. Wirosoetisno. On the long-time stability of the implicit Euler scheme for the two-dimensional Navier–Stokes equations. SIAM J. Numer. Anal., 44(1):29–40, 2006.DOI
- [32]H. Wang, X. Wang, and M. Zhang. A linear variable-step embedded ETD scheme with uniform-in-time stability for the 2D Navier–Stokes equations. Numer. Methods Partial Differ. Equ., 42(4):e70132, 2026.
- [33]H. Wang, X. Wang, and M. Zhang. Unconditionally long-time stable variable-step second-order ETD schemes for the 2D periodic incompressible NSE. SIAM J. Sci. Comput., 2026. Accepted for publication; available at arXiv:2602.10268.arxiv.org/abs/2602.10268
- [34]X. Wang. An efficient second order in time scheme for approximating long time statistical properties of the two dimensional Navier–Stokes equations. Numer. Math., 121(4):753–779, 2012.arxiv.org/abs/1108.5409
- [35]K. Wu, F. Huang, and J. Shen. A new class of higher-order decoupled schemes for the incompressible Navier–Stokes equations and applications to rotating dynamics. J. Comput. Phys., 458:111097, 2022.DOI