Abstract
We study a second order Backward Differentiation Formula (BDF) scheme for the numerical approximation of linear parabolic equations and nonlinear Hamilton–Jacobi–Bellman (HJB) equations. The lack of monotonicity of the BDF scheme prevents the use of well-known convergence results for solutions in the viscosity sense. We first consider one-dimensional uniformly parabolic equations and prove stability with respect to perturbations, in the \(L^2\) norm for linear and semi-linear equations, and in the \(H^1\) norm for fully nonlinear equations of HJB and Isaacs type. These results are then extended to two-dimensional semi-linear equations and linear equations with possible degeneracy. From these stability results we deduce error estimates in \(L^2\) norm for classical solutions to uniformly parabolic semi-linear HJB equations, with an order that depends on their Hölder regularity, while full second order is recovered in the smooth case. Numerical tests for the Eikonal equation and a controlled diffusion equation illustrate the practical accuracy of the scheme in different norms.
Similar content being viewed by others
Avoid common mistakes on your manuscript.
1 Introduction
This paper provides stability and convergence results for a type of implicit finite difference scheme for the approximation of nonlinear parabolic equations using backward differentiation formulae (BDF).
In particular, we consider Hamilton–Jacobi–Bellman (HJB) equations of the following form:
where \((t,x)\in [0,T]\times {{\mathbb {R}}}^d\), \(\Lambda \subset {{\mathbb {R}}}^m\) is a compact set and
is a second order differential operator. Here, \((\Sigma )_{ij}\) is symmetric non-negative definite for all arguments.
It is well known that for nonlinear, possibly degenerate equations the appropriate notion of solutions to be considered is that of viscosity solutions [9]. We assume throughout the whole paper the well-posedness of the problem, namely the existence and uniqueness of a solution in the viscosity sense. Under such weak assumptions, convergence of numerical schemes can only be guaranteed if they satisfy certain monotonicity properties, in addition to the more standard consistency and stability conditions for linear equations [2]. This in turn reduces the obtainable consistency order to 1 in the general case [12].
We will therefore not treat (1) in this generality. As we detail further below, the main stability analysis is restricted to the uniformly parabolic case, and full convergence results are given under the additional assumption of semi-linearity, \(\Sigma \equiv \Sigma (t,x)\).
It is shown in [16] that a monotone (but inconsistent) \(P_1\)–finite element approximation converges in the maximum norm, and in the \(H^1\)-norm under a mild non-degeneracy assumption; this assumption is further weakened to possibly degenerate coefficients in [15].
On the other hand, in many cases – especially in non-degenerate ones – solutions exhibit higher regularity and are amenable to higher order approximations. The existence of classical solutions and their regularity properties under a strict ellipticity condition have been investigated, for instance, in [11, 17].
The higher order of convergence in both space and time of discontinuous Galerkin approximations is demonstrated theoretically and numerically in [20] for sufficiently regular solutions under a Cordes condition for the diffusion matrix, a measure of the ellipticity.
More recently, it was shown numerically in [6] that some approximation schemes based on a second order backward differentiation formula in both time and space (see, e.g., [22], Section 12.11, for the definition of BDF schemes for ODEs) have good convergence properties. In particular, in an example therein with non-degenerate controlled diffusion where the second order, non-monotone Crank–Nicolson scheme fails to converge, the (also non-monotone) BDF2 scheme shows second order convergence.
The filtered schemes in [6] and \(\epsilon \)-monotone schemes, e.g. in [7], modify a higher-order scheme to stay \(\epsilon \)-close to a monotone scheme. This enforces convergence, but in general only at the rate of the monotone scheme, and practically the rate may vary depending on the data and on the strategy to choose the \(\epsilon \) parameter (see Example 2 in [6, Section 4.2] where a filtered scheme switches back to first order). Here, we directly analyse the stability and the convergence for a non-monotone BDF scheme.
For constant coefficient parabolic PDEs, the \(L^2\)-stability and smoothing properties of the BDF scheme are a direct consequence of the strong A-stability of the scheme. Moreover, [3] shows that for the multi-dimensional heat equation the BDF time stepping solution and its first numerical derivative are stable in the maximum norm. The technique, which is strongly based on estimates for the resolvent of the discrete Laplacian, do not easily extend to variable coefficients or the nonlinear case.
A more general linear parabolic setting is considered in [4], where second order convergence is shown for variable demister using energy techniques. This result is extended to a semi-linear example in [10]; the application to incompressible Navier–Stokes equations has been analyzed in [14]. In [5], a closely related BDF scheme is studied for a diffusion problem with an obstacle term (which includes the American option problem in mathematical finance).
The scheme we propose is constructed by using a second order BDF approximation for the first derivatives in both time and space, combined with a standard three-point central finite difference for the second spatial derivative in one dimension. The scheme is therefore second order consistent by construction.
For this scheme, under the assumption of uniform parabolicity, we establish new stability results in the \(H^1\)-norm for fully nonlinear HJB and Isaacs equations, and in the \(L^2\)-norm for the semilinear case (see Theorems 4 and 5, respectively). These generalize some results of [4, 5, 10] to more general non-linear situations. From this analysis we deduce error bounds for classical smooth and piecewise smooth solutions in the semilinear uniformly parabolic case (see Theorems 7 and 19).
Our overall approach relies on stability results with respect to perturbations of the right-hand side of the equations. We start by deriving a recursive linear relation satisfied by the approximation error between the original equation and a perturbed one, in the case of HJB and Isaacs equations (Lemma 10); then, we give an inequality between the error norms for three consecutive time steps (Lemma 11) which guarantees an overall stability estimate (Lemma 12). Having proved this generic sufficient condition for stability, we show that this condition is satisfied for different choices of the norm under specific assumptions, which are summarized in Table 1.
The outline of the paper is as follows. In Sect. 2, we define some specific BDF schemes and state the main results concerning well-posedness and stability in discrete \(H^1\)- or \(L^2\)-norms and our main convergence result for uniformly parabolic semilinear HJB equations. In Sects. 3 and 4 we prove the main stability results and give an extension from HJB to Isaacs equations. In Sect. 5, we give further stability results in the discrete \(L^2\)-norm, which are weaker in the sense that they hold only for uncontrolled Lipschitz regular diffusion coefficients, but stronger in the sense that they allow for degenerate diffusion in the linear case and can be extended to two dimensions. In Sect. 6, we deduce error estimates from the \(L^2\) stability results and from the truncation error of the scheme for sufficiently regular solutions. Section 7 studies carefully two numerical examples, the Eikonal equation and a second order equation with controlled diffusion. Section 8 concludes. An appendix contains a proof of the existence of solutions for our schemes.
2 Definition of the scheme and main results
We focus in the first instance on the one-dimensional equation
It is known (see Theorem A.1 in [1]) that with the following assumptions:
-
\(\Lambda \) is a compact set,
-
for some \(C_0>0\) the functions \(\phi \equiv \sigma , b, r, \ell :[0,T]\times {{\mathbb {R}}}\times \Lambda \rightarrow {{\mathbb {R}}}\) and \(v_0:{{\mathbb {R}}}\rightarrow {{\mathbb {R}}}\) satisfy for any \(t,s\in [0,T]\), \(x,y\in {{\mathbb {R}}}\), \(a\in \Lambda \)
$$\begin{aligned}&|v_0(x)|+ |\phi (t,x,a)|\le C_0, \\&|v_0(x) - v_0(y)|+|\phi (t, x,a) - \phi (s,y,a)|\le C_0(|x-y|+|t-s|^{1/2}), \end{aligned}$$
there exists a unique bounded continuous viscosity solution of (2). We denote by v this solution.
We will make individual assumptions for each result as we go along.
2.1 The BDF2 scheme
For the approximation in the x variable, we will consider the PDE on a truncated domain \(\Omega :=(x_{\min },x_{\max })\), where \(x_{\min }<x_{\max }\).
Let \(N\in {{\mathbb {N}}}^* \equiv {{\mathbb {N}}}\backslash \{0\}\) be the number of time steps, \(\tau :=T/N\) the time step size, and \(t_n = n \tau \), \(n=1,\ldots , N\). Let \(I\in {{\mathbb {N}}}^*\) the number of interior mesh points in the spatial direction, and define a uniform mesh \((x_i)_{1\le i\le I}\) with mesh size h by
Hereafter, we denote by u a numerical approximation of v, the solution of (1), i.e.
For each time step \(t_k\), the unknowns are the values \(u^k_i\) for \(i=1,\dots ,I\).
Standard Dirichlet boundary conditions use the knowledge of the values at the boundary, \(v(t,x_{\min })\) and \(v(t,x_{\max })\). Here, as a consequence of the size of the stencil for the spatial BDF2 scheme below, we will assume that values at the two left- and right-most mesh points are given, that is, \(v(t,x_j)\) for \(j\in \{-1,0\}\) as well as \(j\in \{I+1, I+2\}\) are known (corresponding to the values at the points \((x_{-1},x_0,x_{I+1},x_{I+2})\equiv (x_{\min }-h,x_{\min },x_{\max },x_{\max }+h)\)).Footnote 1
We then consider the following scheme, for \(k\ge 2\), \(i\in {\mathbb {I}}\),
where we denote as usual by \([u]_i^k\) the numerical solution excluding at \((t_k,x_i)\), and
(the usual second order approximation of \(v_{xx}\)), \(b^+:=\max (b,0)\) and \(b^-:=\max (-b,0)\) denote the positive and negative part of b, respectively, and where a second order left- or right-sided BDF approximation is used for the first derivative in space:
Note in particular the implicit form of the scheme (3) for the forward Eq. (2). The existence of a unique solution to this nonlinear equation will be addressed later.
We will also define the numerical Hamiltonian associated with the scheme:
As discussed above, the scheme is completed by the following boundary conditions:
Since (3) is a two-step scheme, for the first time step \(k=1\) (and \(i \in {\mathbb {I}}\)), we use a backward Euler approximation scheme :
with the initial condition
Remark 1
As the backward Euler step is only used once, it does not affect the overall second order of the scheme (see also Sect. 6 below).
Remark 2
Most of our results also apply to the scheme obtained by replacing the BDF approximation (5) of the drift term by a centered finite difference approximation:
However, numerical tests (see Sect. 7.1) show that the BDF upwind approximation as in (5) has a better behavior in some extreme cases where the diffusion vanishes. We shall give a rigorous stability estimate for the BDF scheme in the linear case for possibly vanishing diffusion in Sect. 5.2.
2.2 Definitions and main results
In the remainder of this paper, we prove various stability and convergence results for the scheme (3). We state in this section the first main well-posedness and stability results.
Throughout the paper, A will denote the finite difference matrix associated with the second order derivative, i.e.
Let \( \langle x,y\rangle _A:=\langle x,Ay\rangle \). Then we consider the A-norm defined as follows:
(with the convention in (10) that \(x_0=x_{I+1}=0\)). Hence, \(\sqrt{h}|x|_A\) approximates the \(H^1\) semi-norm in \(\Omega \). Similarly, we will consider later the standard Euclidean norm defined by \( \Vert x\Vert ^2:= \langle x,x\rangle \), such that \(\sqrt{h}\Vert x\Vert \) approximates the \(L^2\)-norm. We define therefore the following rescaled norms on \({{\mathbb {R}}}^I\):
Both these norms will be used in the numerical section.
Our first result concerns the solvability of the numerical scheme \({\mathcal {S}}^{(\tau ,h)}\) defined by (3) with respect to its third argument, i.e. seen as an equation for \(u^k_i\), with \((t_n,x_i)\) and \([u]^k_i\) given.
Assumption (A1). The functions \(\sigma , b\) and r are bounded.
Theorem 3
Let (A1) and the following CFL condition hold:
Then, for \(\tau \) small enough and \(C=3/2\) (resp. \(C=1\)) there exists a unique solution of the scheme (3) for \(k\ge 2\) (resp. \(k=1\), for scheme (6)).
The scheme is hence well-defined even if \(\sigma \) vanishes. A uniform ellipticity condition for \(\sigma \) as per Assumption (A2) below will be needed for proving the \(H^1\) stability of the scheme. We provide a relaxation of the ellipticity condition for stability in the Euclidean norm in Sect. 5.2.
Assumption (A2). There exists \(\eta >0\) such that
Let u denote the solution of (3), that is,
with \({\mathcal {E}}^k_i(u)\equiv 0\), and let w be the solution of a perturbed equation
with the same boundary values as u:
(but potentially different initial values \(w^0\) and \(w^1\)).
Denote further
Our main stability result in this setting (which also holds when \({\mathcal {E}}^k(u)\ne 0\)) is the following.
Theorem 4
Assume (A1), (A2), as well as the CFL condition (11). Then there exists a constant \(C\ge 0\) (independent of \(\tau \) and h) and \(\tau _0>0\) such that, for any \(\tau \le \tau _0\), for any \(u=(u^k_i)\) and \(w=(w^k_i)\) with same boundary values (13), it holds:
The proof of Theorem 4 will be the subject of Sect. 4.
As a corollary we can deduce the \(|\cdot |_1\)-seminorm boundedness of the scheme. For instance, let us assume that \(\ell \equiv 0\), and let u be a solution of the scheme (3) (that is, \({\mathcal {E}}^k_i(u)\equiv 0\)), with 0 boundary conditions (\(u^k_i=0\) for all \(k\ge 2\) and \(i\in \{-1,0,I+1,I+2\}\)). Then by taking \(w=0\) in (14), we obtain
A more general bound of \(|u^k|_1\) could also be obtained in the case of non-zero boundary values and non-vanishing \(\ell \), the bound then depending on these data.
In order to obtain stability estimates in other norms, one typically needs some uniform continuity of the coefficients. The analysis of the controlled case, associated with the presence of the supremum operator in (2a), is then made complicated by the fact that even if the solution to (2) is classical and the supremum is attained at some \(a^*(t,x)\) for each t and x [and similarly for each k and i in (3)], the optimal control \(a^*\) in general does not have any regularity as a function of t and x (or k and i, respectively).
However, in certain circumstances, the previous bound holds with the A-norm replaced by the Euclidean norm. In particular, we consider the following assumption:
Assumption (A3). The diffusion coefficient is independent of the control and Lipschitz continuous, i.e. \(\sigma \equiv \sigma (t,x)\) and there exists \(L\ge 0\) such that
Theorem 5
Assume (A1), (A2), (A3), as well as the CFL condition (11). Then there exists \(C\ge 0\) (independent of \(\tau \) and h) and \(\tau _0>0\) such that, for any \(\tau \le \tau _0\), for any \(u=(u^k_i)\) and \(w=(w^k_i)\) with the same boundary values (13), it holds:
As a consequence, we obtain error estimates under the main assumptions (A1), (A2) and (A3), or under some specific regularity assumptions.
We define the following semi-norm on some interval \({\mathcal {I}}=(a,b)\), for \(\alpha \in (0,1]\):
For a given open subset \(\Omega _T^*\) of \((0,T)\times \Omega \), we define \(C^{k,\ell }(\Omega _T^*)\) as the set of functions \(\phi :\Omega _T^*\rightarrow {{\mathbb {R}}}\) which admit continuous derivatives \((\frac{\partial ^{i}\phi }{\partial t^i})_{0\le i\le k}\) and \((\frac{\partial ^{j}\phi }{\partial x^j})_{0\le j\le \ell }\) on \(\Omega _T^*\). We also denote by \(C^{k,\ell }_b(\Omega _T^*)\) the subset of functions with bounded derivatives on \(\Omega _T^*\).
Assumption (A4). \(v \in C^{1,2}((0,T)\times \Omega )\) and for some \(C\ge 0\), \(\delta \in (0,1]\), it holds:
Remark 6
By results in [11] and [17], assumption (A4) is satisfied for sufficiently smooth data and given a uniform ellipticity condition.
We have the following error estimates:
Theorem 7
We assume (A1), (A2), (A3), and the CFL condition (11).
-
(i)
If (A4) holds for some \(\delta \in (0,1]\), then the numerical solution u of (3), (6) converges to v in the \(L^2\)-norm with
$$\begin{aligned} \max _{0\le k\le N}|v^k-u^k|_0 \le C h^{\delta }, \end{aligned}$$for some constant C (possibly different from the one in (A4)).
-
(ii)
If, moreover, \(v\in C^{3,4}_b((0,T)\times \Omega )\), then
$$\begin{aligned} \max _{0\le k\le N} |v^k-u^k|_0 \le C h^2, \end{aligned}$$where C is a constant which depends on the derivatives of v of order 3 and 4 in t and x, respectively.
The proof of these and further error estimates will be the subject of Sect. 6.
The extension of the presented results to other types of nonlinear operators (\(\inf \), \(\sup \inf \) or \(\inf \sup \)) and corresponding equations will also be discussed.
Hereafter, for simplicity, we will consider \({\mathcal {E}}^k(u)\equiv 0\) and will denote \({\mathcal {E}}^k_i:={\mathcal {E}}^k_i(w)\).
3 Proof of Theorem 3 (well-posedness of the scheme)
The scheme (3) at time \(t_k\) (for \(k\ge 2\)) can be written in the following form:
where \(q^k_a \in {{\mathbb {R}}}^I\) and \(M^k_a \in {{\mathbb {R}}}^{I\times I}\) with the following non-zero entries:
with \(\sigma \equiv \sigma (t_k,x_i,a)\), \(b^\pm \equiv b^\pm (t_k,x_i,a)\) and \(r\equiv r(t_k,x_i,a)\). For \(k=1\), the terms are different but the form (and analysis) is similar. The fact that \((M_a)_{i,i\pm 2}\) are nonnegative breaks the monotonicity of the scheme and makes the analysis more difficult compared to the non-degenerate setting and central differences, where M is a diagonally dominant M-matrix for h small enough.
We will use the following lemma, whose proof is given in Appendix A:
Lemma 8
Assume that \(\Lambda \) is some set, \((q_a)_{a\in \Lambda }\) is a family of vectors in \({{\mathbb {R}}}^I\), \((M_a)_{a\in \Lambda } \) is a family of matrices in \({{\mathbb {R}}}^{I\times I}\) such that:
-
(i)
for all \(a\in \Lambda \),
$$\begin{aligned} (M_a)_{ii}>0; \end{aligned}$$ -
(ii)
(a form of diagonal dominance)
$$\begin{aligned} \sup _{a\in \Lambda } \max _{i\in {\mathbb {I}}} \frac{\sum _{j>i} |(M_a)_{ij}|}{|(M_a)_{ii}| - \sum _{j<i} |(M_a)_{ij}|} < 1. \end{aligned}$$(21)
Then there exists a unique solution X in \({{\mathbb {R}}}^n\) of
Remark 9
For a fixed \(a\in \Lambda \), we have
Moreover, if \(\Lambda \) is compact and \(a\rightarrow M_a\) is continuous, then (21) is equivalent to
Proof of Theorem 3
Condition (i) in Lemma 8 is immediately verified, and we turn to proving (ii). We have
(omitting the dependency on k and a in \(\sigma ,b^\pm ,r\)) and
By the CFL condition (11), there exists \(\epsilon >0\) such that \(\frac{\tau \Vert b\Vert _\infty }{h} \le \frac{3}{2}- \epsilon \). This implies
and therefore
Then by using \(\displaystyle \frac{a_1+a_2}{c_1+c_2}\le \max \Big (\frac{a_1}{c_1}, \frac{a_2}{c_2}\Big )\) for numbers \(a_i,c_i\ge 0\), we obtain
Taking \(\tau \) small enough such that for instance \(\frac{\epsilon }{2} + \tau r \ge \frac{\epsilon }{4}\), and since b(.) and \(\sigma (.)\) are bounded functions (by (A1)), we obtain the bound
Since the last bound is a constant \(<1\), we can apply Lemma 8 to obtain the existence and uniqueness of the solution of the BDF2 scheme.
4 Proof of Theorem 4 (stability in the A-norm)
The proof consists of three main steps: first, we show a “linear” recursion for the error (Lemma 10); second, we pass from such a recursion for the error in vector form to a scalar recursion (Lemma 11); finally, we show the stability estimate from this scalar recursion (Lemma 12).
4.1 Treatment of the nonlinearity
Given a function \(\phi :[0,T]\times {{\mathbb {R}}}\times \Lambda \rightarrow {{\mathbb {R}}}\), for any \((t,x)\in [0,T]\times {{\mathbb {R}}}\) we will make use of the notation \(co(\phi (t,x,\Lambda ))\) to indicate the convex hull of \(\phi \) with respect to its third variable, i.e.
First, we have the following:
Lemma 10
Let u be the solution of (3) and w the solution of (12). There exist coefficients \({{\tilde{\sigma }}}^k_i\), \(({{\tilde{b}}}^\pm )^k_i\), \({{\tilde{r}}}^k_i\), such that the error \(E^k=u^k-w^k\) satisfies
for any \(k\ge 2\) and \(i\in {\mathbb {I}}\), where \(({{\tilde{\sigma }}}^2)^k_i\), \(({{\tilde{b}}}^\pm )^k_i\), \({{\tilde{r}}}^k_i\) belong, respectively, to the convex hulls \(co(\sigma ^2(t_k,x_i,\Lambda ))\), \(co(b^\pm (t_k,x_i,\Lambda ))\), \(co(r(t_k,x_i,\Lambda ))\).
Proof
By (12) one has (for \(k\ge 2\), \(1\le i\le I\))
The scheme simply reads
Subtracting (24) from (25), denoting also \(H[u^k]\equiv (H[u^k](t_k,x_i))_{1\le i\le I}\), the following recursion is obtained for the error in \({{\mathbb {R}}}^I\):
For simplicity of presentation, we first consider the case when b and r vanish, i.e. \(\hbox {} b(.)\equiv 0 \text { and } r(.)\equiv 0\), and defer a sketch of the general case to the end of the proof. In this case,
Let us assume that \(\sigma \) and \(\ell \) are continuous functions of a so that the supremum is attained.Footnote 2 For each given k, i, let then \({\bar{a}}^k_i \in \Lambda \) denote an optimal control in (27).
In the same way, let \({{\bar{b}}}^k_i\) denote an optimal control for \(H[v^k]_i\). By using the optimality of \({\bar{a}}^k_i\), it holds
and, in the same way,
Therefore, combining (28) and (29), \(H[u^k]_i - H[w^k]_i\) is a convex combination of \(-\frac{1}{2} \sigma ^2(t_k,x_i,{\bar{a}}^k_i) (D^2 E^k)_i\) and \(-\frac{1}{2} \sigma ^2(t_k,x_i,{\bar{b}}^k_i) (D^2 E^k)_i\). In particular, we can write
where \({{\tilde{\sigma }}}^{2}(t_{k},x_i)\) is a convex combination of \(\sigma ^2(t_k,x_i,{\bar{a}}^k_i)\) and \(\sigma ^2(t_k,x_i,{\bar{b}}^k_i)\). In the general case (i.e. \(b,r\not \equiv 0\)) one can argue in the exact same way to get
where, for \(\phi \in \{\sigma ^2,b,r\}\),
for some \(\gamma ^k_i\in [0,1]\). \(\square \)
The same technique used above to deal with the nonlinear operator applies also to Isaacs equations, i.e. equations of the following form:
where \((t,x)\in [0,T]\times {{\mathbb {R}}}^d\), \(\Lambda _1,\Lambda _2\subset {{\mathbb {R}}}^m\) are compact sets and
To simplify the presentation, let us consider again \(b,r \equiv 0\), and now also \(\ell \equiv 0\) (indeed, one can easily verify that as in (28) the term \(\ell \) would not appear in (34) and (35), and the case of non-zero b and r is treated similar to the Proof of Lemma 10). By analogous definitions and reasoning to above, we get (26), where, for \(\phi \in \{u,w\}\),
Making use of the general inequality (for any real-valued functions \((a,b)\rightarrow F_{a,b}\) and \((a,b)\rightarrow G_{a,b}\))
we obtain
Analogously, one can prove
From these inequalities, an equation exactly as in (23) can be derived, with a suitable convex combination \((\tilde{\sigma ^{_2}})_i^k\) of diffusion coefficients, and similar for the drift and other terms.
As a consequence, Lemma 10 – and by extension Theorem 4 – also hold for Isaacs equations of type (32), with the obvious modifications to the definition of the scheme.
4.2 A scalar error recursion
From the recursion (23) on \(E^k\), (or its corresponding formulation for Isaacs equations), we can derive the following:
Lemma 11
Let assumptions (A1) and (A2) in Theorem 4 be satisfied. Then there exists a constant \(C\ge 0\) such that
Proof
For simplicity of presentation we will assume that b has constant positive sign. The case of b with variable sign can be treated in a similar way obtaining estimates analogous to those below separately for the positive and negative part of b and then summing up.
We remark that for \(E\in {{\mathbb {R}}}^I\), \( - D^2 E = A E,\) where A is the finite difference matrix defined in (9) and \(D^2\) as in (4). By (23), we get the following:
where \(\Delta ^k:=\frac{1}{2} {{\,\mathrm{diag}\,}}( ({{\tilde{\sigma }}}^2)^k_i),\ F^k = {{\,\mathrm{diag}\,}}({{\tilde{b}}}^k_i),\ R_k = {{\,\mathrm{diag}\,}}({{\tilde{r}}}^k_i)\) and
We form the scalar product of (37) with \(AE^k\). By using the identity \( 2 \langle a-b,a\rangle _A=|a|_A^2+|a-b|_A^2-|b|_A^2, \) one has:
where we have also used \(|a+b|^2\le 2|a|^2 + 2|b|^2\). From \((\sigma ^2)^k_i\ge \eta >0\) for all k, i:
where \(\Vert \cdot \Vert \) denotes the canonical Euclidean norm in \({{\mathbb {R}}}^I\).
In order to estimate the drift component, let us introduce the notation
with the convention that \(E_i=0\) for all indices i which are not in \({{\mathbb {I}}}\). It holds:
By using the boundedness of the drift term, and \(\Vert \delta E^k\Vert ,\Vert \delta _2 E^k\Vert \le h |E^k|_A\),
For the last term, using the boundedness of r and the Cauchy-Schwarz inequality,
Therefore, putting (39), (41) and (42) together,
Easy calculus shows that the minimal eigenvalue of A is \(\lambda _{\min }(A)=\frac{4}{h^2} \sin ^2(\frac{\pi h}{2})\ge ~4\). Hence \(\langle X,AX\rangle \ge 4 \langle X,X\rangle \) and therefore \(\Vert X\Vert \le \frac{1}{2} |X|_A\). In the same way, we have also \(|X|_A \le \frac{1}{2} \Vert AX\Vert \). Hence it holds
with \(C_1:=2 \Vert b\Vert _\infty + \frac{1}{2} \Vert r\Vert _\infty \). By using \( C_1 \Vert A E^k\Vert |E^k|_A \le \frac{\eta }{2} \Vert A E^k\Vert ^2 + \frac{1}{2\eta } C_1^2 |E^k|_A^2\),
Then, combining (38) and (45), we obtain the desired inequality with \(C:=\frac{2}{\eta } C_1^2\). \(\square \)
4.3 A universal stability lemma
In the following, it is assumed that \(|\,{\cdot }\,|\) is any vectorial norm. Combined with Lemmas 10 and 11, the following Lemma 12 with the A-norm \(|\,{\cdot }\,|\,{\equiv }\,|\,{\cdot }|_A\) immediately gives Theorem 14. In Sect. 5, we will use the result for the canonical Euclidean norm \(|\cdot |\equiv \Vert \cdot \Vert \) to prove Theorem 5.
In order to prove the following Lemma 12, we will exploit properties of the matrix
in particular the fact that \((M_\tau )^{-1}\ge 0\) for \(\tau \) small enough (which we prove).
Lemma 12
Assume that there exists a constant \(C\ge 0\) such that \(\forall k=2,\dots ,N\):
Then there exists a constant \(C_1\ge 0\) and \(\tau _0>0\) such that \(\forall 0<\tau \le \tau _0\), \(\forall n\le N\):
Proof
Let us denote
so that (47) reads
For a given \(\tau >0\) and given k, let \(M_\tau \in {{\mathbb {R}}}^{(k-1)\times (k-1)}\) as defined in (46). Let \(z, q \in {{\mathbb {R}}}^{k-1}\) be defined by
By (49), we have
We notice that \(M_\tau =(3-C\tau ) I -4 J + J^2\) with
Hence, with
the roots of \(\lambda ^2 - 4\lambda + (3-C\tau ) =0\) for \(3- C\tau \ge 0\), we can write
Furthermore, since \(J^{k-1}=0\), it holds
where
Therefore \(M_\tau ^{-1}\ge 0 \) componentwise (for \(\tau <3/C\)), and using (50) it holds \(z \le M_\tau ^{-1} q\).
It is possible to prove that there exists \(\tau _0>0\) and a constant \(C_0\ge 0\) (depending only on T) such that \(\forall 0<\tau \le \tau _0\) and \(\forall p\ge 0\):
We postpone the Proof of (51) to the end. For the first component of z, we deduce
for all \(k\ge 2\), where, for (52), we have used the fact that \(a_p\le C_0\). Since \(y_j\ge 0\), \(\forall j\), by definition, \(a_{k-2}\le C_0\), \(a_0= \frac{1}{\lambda _1\lambda _2}\ge 0\) and \(a_j-a_{j-1}\ge 0\), \(\forall j\), we obtain
Recalling the definition of \(x_k\) and \(y_k\), for any \(2\le k\le n\) one has:
(where we made use of \(2ab\le \frac{a^2}{K} +K b^2 \) for any \(a,b\ge 0\) and \(K>0\)). Hence, we obtain
with \(C_1 := \max (8C_0, 16 C_0^2 T)\) (we used \(\Big (\sum _{j=2}^n |{\mathcal {E}}^j|\Big )^2 \le n \sum _{j=2}^n |{\mathcal {E}}^j|^2\) and \(n\tau \le T\)).
It remains to prove (51). From the definition of \(a_p\) one has
for \(p=0,\ldots , k-2\). Observing that \(\frac{\lambda _2}{\lambda _1}\le \frac{1}{3}\), it follows that
Notice that \(\sqrt{1+C\tau }\le 1+C\tau \), and also that \(e^{-x} \le 1- x/2\), \(\forall x\in [0,1]\). Hence \((2-\sqrt{1+C\tau })^n\ge (2-(1+C\tau ))^n = (1-C\tau )^n \ge (e^{-2C\tau })^n = e^{-2 C t_n}\) for \(C\tau \le \frac{1}{2}\), and therefore \(a_p\le \frac{3}{2} e^{2Ct_n}\). The desired result follows with \(C_0:=\frac{3}{2} e^{2CT}\) and \(\tau _0:=\frac{1}{2C}\).
Moreover, one has
which is nonnegative for \(\tau \) small enough thanks to the fact that \(\lambda _1,\lambda _2\ge 0\) and \(\lambda _2\le 1\). \(\square \)
Remark 13
From the previous proof and the Proof of Lemma 11 one can deduce that the restriction
(where \(C_1= 2\Vert b\Vert _\infty + \frac{1}{2}\Vert r\Vert _\infty \)) has to be imposed on the time step. From the theoretical point of view this makes the scheme not suitable for nearly-degenerate equations. However, in our numerical tests we did not observe any stability issue even in the case of degenerate problems (see Sect. 7.1).
5 Stability in the Euclidean norm
The fundamental stability result given by Lemma 12 applies to any vectorial norm. In this section, we discuss some special cases where (47) can be obtained for the Euclidean norm \(|\cdot |=\Vert \cdot \Vert \).
We first prove the stability result for this norm under the extra assumption (A3), i.e., the control may appear everywhere except in the diffusion term, which must also be Lipschitz continuous in the following proof (see Assumption (A3)).
5.1 Proof of Theorem 5 (stability in the Euclidean norm)
We consider the scalar product of (37) directly with \(E^k\) (instead of \(A E^k\) previously used), again in the situation where \(b\ge 0\) to simplify the argument (but the general case follows analogous to the Proof of Lemma 11). We obtain:
As in Sect. 4.2, we have
We now focus on bounding the other terms on the left-hand side of (54).
By using the Lipschitz continuity of \(\sigma ^2\) one has
Therefore, by the Cauchy–Schwarz inequality, one obtains
where \(\delta E^k\) is defined by (40). Moreover, for the first order term one has
where for the last equality we have used that \(\Vert \delta _2 E^k\Vert \le \Vert \delta E^k\Vert \). Putting together estimates (57) and (58), using the fact that \(\langle E^k,R^k E^k\rangle \ge -\Vert r\Vert _\infty \Vert E^k\Vert ^2\), we get
where we have denoted \(C_1:=L+4\Vert b\Vert _\infty \) and have used again the Cauchy–Schwarz inequality. Hence, together with (55), this gives (47) with \(|\cdot |=\Vert \cdot \Vert \) and the constant \(C:=4 (\frac{C_1^2}{4\eta }+\Vert r\Vert _\infty )\). By using Lemma 12, this concludes the proof of Theorem 5. \(\Box \)
Remark 14
The step (56) highlights the need for Assumption (A3), Lipschitz regularity of the diffusion coefficient, in order to obtain the one-step stability inequality (47). This can be avoided in the A-norm stability analysis, Lemma 11, by using a different inner product, which directly gives (39) and only requires uniform ellipticity.
The adaptation of (A3) to the controlled case would impose some Lipschitz continuity of the feedback control with respect to the state variable. Such regularity of the control cannot usually be expected (see for instance the tests in Sect. 7.2).
5.2 Linear equation with degenerate diffusion term
The next result concerns the case of a possibly degenerate diffusion term. It will require more restrictive assumptions on the drift and diffusion terms, and we shall assume that there is no control here. Indeed, in this case, one cannot count on the positive term coming from the non-degenerate diffusion which, in the proof of Theorem 5, is used to compensate the negative correction terms coming from the drift term. This leads us to consider the following assumption:
Assumption (A5).
-
(i)
The function r(.) is bounded.
-
(ii)
The drift and diffusion coefficients are independent of the control : \(b \equiv b(t,x)\) and \(\sigma \equiv \sigma (t,x)\).
-
(iii)
there exist \(L_1, L_2\ge 0\) such that, for all t, x, h:
$$\begin{aligned}&|b(t,x)-b(t,y)| \le L_1 |x-y|, \end{aligned}$$(59)$$\begin{aligned}&\frac{\sigma ^2(t,x-h)- 2\sigma ^2(t,x) + \sigma ^2(t,x+h)}{h^2} \ge -L_2. \end{aligned}$$(60)
(The last condition is equivalent to \((\sigma ^2)_{xx}\ge -L_2\) in the differentiable case.)
Proposition 15
Let assumption (A5) be satisfied. Then (47) holds for \(|\cdot |=\Vert \cdot \Vert \).
Proof
We consider again the scalar recursion (54). For any vector \(E=(E_i)_{1\le i\le I}\) (with \(E_j=0\) for \(j\in \{-1,0,I+1,I+2\}\)), it holds:
Hence, by the semi-concavity assumption (60) on \(\sigma ^2\),
Now we focus on a lower bound for \(\langle E^k,F^k B E^k\rangle \). Let \(y^k_i=|E^k_i-E^k_{i-1}|^2\). First,
We assume again \(b_i\ge 0\) for all i to simplify the presentation. The case where \(b_i\le 0\) for some i is similar. Then, the following bound holds:
(where we have used \(y^k_{0}=y^k_{I+2}=0\) and \(\sum _{1\le i\le I+2} b_i (E^k_{i-2})^2 = \sum _{1\le i\le I} b_{i+2} (E^k_i)^2 \) as well as \(\sum _{1\le i\le I+2} b_i (E^k_{i-1})^2 = \sum _{0\le i\le I+1} b_{i+1} (E^k_i)^2 = \sum _{1\le i\le I} b_{i+1} (E^k_i)^2\)). Then, by the Lipschitz continuity of b(.) and the bound \(y^k_i\le 2(E^k_i)^2 + 2(E^k_{i-1})^2\), we have
By combining the bounds (61) and (62), we obtain
Therefore, inequality (47) is obtained with \(C := 4(\frac{L_2}{4} + 3 L_1 + \Vert r\Vert _\infty )\), which leads to the desired stability estimate. \(\square \)
5.3 Extension to a two-dimensional case
Under suitable assumptions, the result of Theorem 5 can be extended to multi-dimensional equations. We only sketch the main extra features and analysis steps as the notation is significantly lengthier. In the nonlinear case of HJB and Isaacs equations, the derivation of a linear error recursion can be carried out exactly as in Sect. 4.1 so that we can restrict ourselves to the following linear case with appropriate assumptions on the coefficients specified below,
for a positive definite matrix \(\Sigma \) and a drift vector b. We consider the two-dimensional case (\(d=2\)), as the approximation of the diffusion term with suitable properties is better understood here for diagonally dominant diffusion tensor (see also Remark 17, (iii)). For simplicity, we take \(r,\ell \equiv 0\), but this condition can easily be removed as in earlier sections. Lastly, we omit for brevity the dependence of the coefficients on the time variable, which is inconsequential for the stability analysis.
Then with
where \(\sigma _1,\sigma _2\ge 0\) and \(\rho \in [-1,1]\) is the correlation parameter, the equation reads (by slight abuse of notation)
The computational domain is given by \(\Omega :=(x_{\min },x_{\max })\times (y_{\min },y_{\max })\). We introduce the discretization in space defined by the steps \(h_x, h_y>0\) and we denote by \({\mathcal {G}}_{(h_x,h_y)}\) the associated mesh. In what follows, given any function \(\phi \) of \((x,y)\in \Omega \), we will denote \(\phi _{ij}=\phi (x_i,y_j)\) for \((i,j)\in {\mathbb {I}}:={\mathbb {I}}_1\times {\mathbb {I}}_2\), where \(\mathbb I_1=\{1, \ldots , I_1\}\), \({\mathbb {I}}_2=\{1, \ldots , I_2\}\).
Assuming that \(\rho \ge 0\) everywhere (the case when \(\rho \le 0\) is similar), we consider a 7-point stencil for the second order derivatives (see [13, Section 5.1.4]):
and the BDF approximation of the first order derivatives
The scheme is therefore defined, for \(k\ge 2\), by
A straightforward calculation shows that
with
The scheme is completed with the following boundary conditions:
For simplicity, assume \(h_x=h_y=: h\). We consider the following assumptions:
Assumptions.
-
(A1’):
\(\Vert b_i\Vert _\infty <\infty \) for \(i=1,2\);
-
(A2’):
\(\exists \eta >0\), \(\forall (x,y)\in \Omega \), \(\forall i\ne j\): \(\sigma _i^2(x,y)-\rho (x,y)\sigma _i(x,y)\sigma _j(x,y)\ge \eta \);
-
(A3’):
\(\forall i,j=1,2\), \(\sigma _i\sigma _j\) is Lipschitz continuous on \(\Omega \).
We then have the following result.
Proposition 16
Let assumptions (A1’),(A2’) and (A3’) be satisfied. Then the stability estimate (16) holds for \(|\cdot |=\Vert \cdot \Vert \).
Proof
The proof follows by similar steps to those of Theorem 5, using (64) with \(\alpha _{ij}, \beta _{ij}\ge \eta /h^2\) and \(\gamma _{ij} \ge 0\) by assumption (A2’). \(\square \)
Remark 17
(i) If \(h_x\ne h_y\) and for instance \(h_y=C h_x\) for some \(C\ge 1\), (A2’) has to hold with \(\sigma _2\) replaced by \(\sigma _2/C\) as a result of the scaling properties of the scheme.
(ii) Observe that assumption (A2’) is equivalent to requiring strong diagonal dominance of the covariance matrix.
(iii) When the strong diagonal dominance of the matrix \(\Sigma \) is not guaranteed, one can consider the generalized finite difference scheme in [8]. However, determining the precise set of assumptions on the coefficients needed to apply the previous arguments does not seem easy from the construction in [8].
6 Error estimates
In this section, we derive detailed error estimates for the implicit BDF2 scheme (3). For brevity, we restrict ourselves to the one-dimensional case.
In the following, we define specific instances of \(w_i^k\), \(E_i^k\) and \({\mathcal {E}}_i^k\), to which we can apply the results from the preceding sections.
Let u denote the solution of (3) and let w be the solution of (1), i.e. the function v. The error associated with the scheme is then defined by
For any function \(\phi \) we will also use the notation \(\phi ^k_i:=\phi (t_k,x_i)\) as well as \(\phi ^k:=(\phi ^k_i)_{1\le i\le I}\) and \([\phi ]_i^k := (\phi ^m_j)_{(j,m)\ne (i,k)}\), and the error vector at time \(t_k\) is defined by
The consistency error will be denoted by \({\mathcal {E}}^k(\phi ):=({\mathcal {E}}^k_i(\phi ))_{1\le i\le I}\in {{\mathbb {R}}}^I\) and for any smooth enough function \(\phi \) is defined, in this section, as follows:
By extension, for the exact solution v of (1), we will simply define
Note that (66) is well-defined for any continuous function.
In particular, for the scheme (3) it is clear that we have second order consistency in space and time, that is,
for any sufficiently regular test function \(\phi \).
To prove convergence of a certain order, we can now follow the standard approach of considering the exact solution to the PDE as a solution of a perturbed finite difference scheme with the truncation error as the right-hand side. The error therefore satisfies precisely Eqs. (14) and (16) under the pertaining assumptions.
When the Euler timestepping scheme (6) is used at the first time step, by the stability of the scheme we expect to have
and (14) simply reads
and similarly for the \(L^2\) error.
6.1 Proof of Theorem 7
We first prove (i). By Taylor expansion, we can write for instance, for some \(\theta _1,\theta _2 \in [0,1]\),
and
Similarly, using the higher spatial regularity, there exists a constant \(C_0\ge 0\) such that
The result (i) now follows directly by inserting the obtained truncation error into the stability estimate of Theorem 5.
For the proof of (ii) (smooth case), expansion up to order 3 and 4 gives the truncation error of higher order for \(k\ge 2\), and we use the fact that the error from the first backward Euler step is bounded by \(\Vert E^1\Vert \le C \tau (\tau + h^2)\); in particular, we use that \((E^1-E^0)/\tau + (\Delta ^1A + F^1 B +R^1) E^1 = - {\mathcal {E}}^1\), with \(\Vert {\mathcal {E}}^1\Vert \le C(\tau + h^2)\), \(E^0=0\) and the bound is otherwise similar and simpler than that for \(k\ge 2\).
6.2 Piecewise smooth solutions
The previous arguments can also be used to derive error estimates for piecewise smooth solutions. In this case, we will need to limit the number of non-regular points that may appear in the exact solution (assumption (A6)(i) is similar to [5]).
Assumption (A6). There exists an integer \(p\ge 1\) and functions \(t\rightarrow (x^*_j(t))_{1\le j\le p}\) for \(t\in [0,T]\), such that, with \(\Omega ^*_T:= (\Omega \times (0,T))\backslash \bigcup _{1\le j\le p} \{(t,x^*_j(t)),\ t\in (0,T)\}\), the following holds:
-
(i)
\(v \in C^{3,4}_b(\Omega ^*_T)\);
-
(ii)
\(\forall j\), \(t\rightarrow x^*_j(t)\) is Lipschitz regular.
We give the following straightforward preliminary result without proof:
Lemma 18
Assume (A6) and the CFL condition (11). Then for all t
and
for some constant \(C\ge 0\) independent of \(\tau ,h\) (“not regular” meaning not \(C^4\) in the first case and not \(C^3\) in the second one).
Such a situation will be illustrated in the numerical example of Sect. 7.2.
Theorem 19
We assume (A1), (A2), (A3) and the CFL condition (11). Let (A4) for some \(\delta \in (0,1]\) and (A6) hold, then the numerical solution u of (3), (6) converges to v in the \(L^2\)-norm with
where C is a constant independent of h.
Proof
Let \({\mathbb {I}}^k\) be the (finite) set of indices i such that v is not regular in \( \{t_k\} \times (x_i-2h,x_i+2 h) \cup (t_k-2\tau ,t_k) \times \{x_i\}\). Then
We then use the fact that \(|{\mathbb {I}}^k|\le C\) for some (different) constant C by Lemma 18 and that \((\tau ^2 + h^2)^2 = O(h^4) = O(h^{2+\delta })\), \(\tau ^\delta +h^\delta = O(h^\delta )\) by the CFL condition (11), in order to obtain the desired result. \(\square \)
Remark 20
-
(i)
Similar results can be derived for errors in the A-norm, however derivatives of one order higher are required due to the derivative in the definition of the norm.
-
(ii)
The estimates in Theorem 7 are not always sharp, as symmetries and the smoothing behaviour of the scheme can result in higher order convergence. We discuss such special cases for Examples 1 and 2 in Sect. 7, Remarks 22 and 23, respectively.
-
(iii)
These error estimates can be compared with [5], where an error bound of order \(h^{1/2}\) was obtained for diffusion problems with an obstacle term, under the main assumption that \(v_{xx}\) is a.e. bounded with a finite number of singularities (instead of (A4)) . In the present context it seems natural to assume the Hölder regularity of \(u_t\) and \(u_{xx}\) coming from the ellipticity assumption (see Remark 6).
7 Numerical tests
We now compare the performance of the BDF2 scheme with other second order finite difference schemes on two examples.
7.1 Test 1: Eikonal equation
The first example is based on a deterministic control problem (\(\sigma \equiv 0\)) and motivates the choice of the BDF2 approximation for the drift term in (5), compared to the more classical centered scheme (8). We consider
with \(v_0(x)=\max (0, 1-x^2)^4\) and \(T=0.2\). The initial datum is shown in Fig. 1 (dashed line). The exact solution is
Remark 21
The Eikonal equation can be written as \(v_t + \max _{a\in \{-1,1\}} (a v_x) = 0\) in HJB form. Note that our theoretical analysis does not cover this example, however, since in the degenerate case assumption (A5) is required, which is not satisfied here.
In Fig. 1, we show the results obtained at the terminal time \(T=0.2\) using schemes (3) with (8) (left) and (3) with(5) (right) with \(\tau /h=0.5\). We numerically observe that the centered approximation generates undesirable oscillations, whereas the BDF2 scheme preserves the total variation.
As stated in Theorem 3, in the case of a degenerate diffusion, a CFL condition of the form \(\tau \le Ch\) has to be satisfied for well-posedness of the BDF2 scheme. Table 2 shows numerical convergence of order 2 in both time and space, although the solution is globally only Lipschitz.
Remark 22
The full convergence order here is due to the particular symmetry of the solution. To confirm this, we report in Table 3 the results obtained for the same equation with initial data
(see also Fig. 2). In this case, there is no such symmetry around the two singular points and as a result the full convergence order is lost numerically: the scheme is globally only of order 1 in the \(H^1\) norm and roughly 1.5 in the \(L^2\) and \(L^\infty \) norms.
7.2 Test 2: A simple controlled diffusion model equation
The second test we propose is a problem with controlled diffusion. We consider
with parameters \(\sigma _{1}=0.1\), \(\sigma _{2}=0.5\), \(T=0.5\).
In spite of the apparent simplicity of the equation under consideration, in [19] an example of non-convergence of the Crank-Nicolson scheme is given for a similar optimal control problem. The BDF2 scheme, in contrast, has shown good performance for that same problem in [6].
Figure 3 (top row) shows the initial data and the value function at terminal time computed using the BDF2 scheme. The error and convergence rate in different norms are reported in Table 4. Here an accurate numerical solution computed by an implicit Euler scheme (which is monotone and hence guaranteed to converge) is used for comparison.
Taking \(\tau \sim h\) the BDF2 scheme gives clear second order convergence, as seen in Table 4. This is not the case for CN as shown in Table 5. The CN scheme also exhibits some instability in the second order derivative for high CFL number, i.e. \(\tau /h\), see Fig. 3 (this is analogous to the finding in [19]). One can verify that for a small CFL number, i.e. \(\tau \sim h^2\), the CN scheme shows convergence of second order.
Remark 23
In this example, due to the strict ellipticity, Assumption (A4) is guaranteed for some \(\delta >0\) (see Remark 6). Then Theorem 7 gives convergence with order \(\delta \). Furthermore, Fig. 3, bottom row, suggests Hölder continuity of \(u_{xx}\) in x, which is expected by virtue of the control being piecewise constant. Therefore, we conjecture that Assumption (A6) is satisfied, such that Theorem 19 would give the higher order \(1/2+\delta \). In the test, in fact the full order 2 is observed (see Table 4).
8 Conclusions
We have proved the well-posedness and stability in \(L^2\) and \(H^1\) norms of a second order BDF scheme for HJB equations with enough regularity of the coefficients. The significance of the results is that this was achieved for a second order (and hence) non-monotone scheme.
One can use the recursion we derived to bound the error of the numerical solution in terms of the truncation error of the scheme. The latter depends on the regularity of the solution and has to be estimated for individual examples. A full analysis was carried out for the semi-linear, uniformly parabolic case.
The numerical tests demonstrate convergence at least as good as predicted by the theoretical results, and often better, due to symmetries of the solution or smoothing properties of the equation and the scheme. This is in contrast to some alternative second order schemes, such as the central spatial difference in the case of a first order equation, or the Crank-Nicolson time stepping scheme for a second order equation, which can show poor or no convergence.
Notes
In practice, this means that a sufficiently accurate approximation of these “boundary values” has to be available. Boundary approximations with modified schemes are commonly used and are not the focus of this paper; it is seen in [18] that the use of a lower order scheme in the vicinity of the boundary does not affect the global provable convergence order.
The general case is obtained easily by considering sequences of \(\epsilon \)-optimal controls and letting \(\epsilon \rightarrow 0\), such that (31) below still holds for a suitably defined \({\tilde{\sigma }}^{_2}\), \({\tilde{b}}^{^{_+}}\), \({\tilde{b}}^{^{_-}}\), \({{\tilde{r}}}\).
References
Barles, G., Jakobsen, E.R.: Error bounds for monotone approximation schemes for parabolic Hamilton–Jacobi–Bellman equations. Math. Comput. 74(260), 1861–1893 (2007)
Barles, G., Souganidis, P.E.: Convergence of approximation schemes for fully nonlinear second order equations. Asymptotic Anal. 4, 271–283 (1991)
Beale, T.: Smoothing properties of implicit finite difference methods for a diffusion equation in maximum norm. SIAM J. Numer. Anal. 47(4), 2476–2495 (2009)
Becker, J.: A second order backward difference method with variable steps for a parabolic problem. BIT Numer. Math. 38(4), 644–662 (1998)
Bokanowski, O., Debrabant, K.: Backward differentiation formula finite difference schemes for diffusion equations with an obstacle term. IMA J Numer. Anal. 41(2), 900–934 (2021). https://doi.org/10.1093/imanum/draa014
Bokanowski, O., Picarelli, A., Reisinger, C.: High-order filtered schemes for time-dependent second order HJB equations. ESAIM Math. Model. Numer. Anal. 54(1), 69–97 (2018)
Bokanowski, Olivier, Falcone, Maurizio, Ferretti, Roberto, Grüne, Lars, Kalise, Dante, Zidani, Hasnaa: Value iteration convergence of \(\epsilon \)-monotone schemes for stationary Hamilton–Jacobi equations. Discrete Contin. Dynam. Syst. A 35(9), 4041–4070 (2015)
Bonnans, J.F., Zidani, H.: Consistency of generalized finite difference schemes for the stochastic HJB equation. SIAM J. Numer. Anal. 41(3), 1008–1021 (2003)
Crandall, M.G., Ishii, H., Lions, P.L.: User’s guide to viscosity solutions of second order partial differential equations. Bull. Amer. Math. Soc. 27(1), 1–67 (1992)
Emmrich, E.: Stability and error of the variable two-step BDF for semilinear parabolic problems. J. Appl. Math. Comput. 19(1–2), 33–55 (2005)
Evans, L.C., Lenhart, S.: The parabolic Bellman equation. Nonlinear Anal. 5(7), 765–773 (1981)
Godunov, S.K.: A difference method for numerical calculation of discontinuous solutions of the equations of hydrodynamics. Matematicheskii Sbornik 89(3), 271–306 (1959)
Hackbusch, W.: Elliptic Differential Equations: Theory and Numerical Treatment, Springer Series in Computational Mathematics, vol. 18. Springer, Berlin (2010)
Hill, A., Süli, E.: Approximation of the global attractor for the incompressible Navier–Stokes equations. IMA J. Numer. Anal. 20(4), 633–667 (2000)
Jensen, M.: \(L^2(H_\gamma ^1)\) finite element convergence for degenerate isotropic Hamilton–Jacobi–Bellman equations. IMA J. Numer. Anal. 37(3), 1300–1316 (2017)
Jensen, M., Smears, I.: On the convergence of finite element methods for Hamilton–Jacobi–Bellman equations. SIAM J. Numer. Anal. 51(1), 137–162 (2013)
Krylov, N.V.: Boundedly nonhomogeneous elliptic and parabolic equations. Izvestiya Rossiiskoi Akademii Nauk. Seriya Matematicheskaya 46(3), 487–523 (1982)
Picarelli, A., Reisinger, C., Rotaetxe, J.: Some regularity and convergence results for parabolic Hamilton–Jacobi–Bellman equations in bounded domains. J. Differ. Equ. 268(12), 7843–7876 (2020)
Pooley, D.M., Forsyth, P.A., Vetzal, K.R.: Numerical convergence properties of option pricing pdes with uncertain volatility. IMA J. Numer. Anal. 23(2), 241–267 (2003)
Smears, I., Süli, E.: Discontinuous Galerkin finite element methods for time-dependent Hamilton–Jacobi–Bellman equations with Cordes coefficients. Numer. Math. 133(1), 141–176 (2016)
Stoer, J., Bulirsch, R.: Introduction to Numerical Analysis, Texts in Applied Mathematics, vol. 12, 3rd edn, p. xvi+744. Springer-Verlag, New York, (1993). Translated from the German by R. Bartels, W. Gautschi and C. Witzgall. https://doi.org/10.1007/978-0-387-21738-3
Süli, E., Mayers, D.F.: An Introduction to Numerical Analysis. Cambridge University Press, Cambridge (2003)
Funding
Open access funding provided by Universitá degli Studi di Verona within the CRUI-CARE Agreement.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Appendix A. Proof of Lemma 8
Appendix A. Proof of Lemma 8
In order to prove the existence and uniqueness of a solution to (22), we consider a fixed-point approach. The initial problem (22) can be written as follows:
where \(L_a\) and \(U_a\) are two matrices such that \(M_a \equiv L_a + U_a\). We consider in particular \(L_a\) to be the lower triangular part of \(M_a\) including the diagonal terms, \((L_a)_{ij}:=(M_a)_{ij} 1_{i\ge j}\), and \(U_a\) the remaining upper triangular part, \((U_a)_{ij}:=(M_a)_{ij} 1_{i<j}\).
For a given vector \(c\in {{\mathbb {R}}}^I\), let \(g(c):=X\) denote the (unique) solution of the following simplified problem:
Indeed, because \((L_a)_{ii}=(M_a)_{ii}>0\), denoting \(v_a:=q_a - U_a c\), it is easy to see by recursion in i that the unique solution of
is given by
Therefore, solving (68) amounts to solving \(g(X)=X\). By elementary compuations one can show that g is \(\delta \)-Lipschitz for the \(\Vert .\Vert _\infty \) norm, with \(\delta :=\sup _a \Vert (L_a)^{-1} U_a\Vert _\infty \).
For a diagonally dominant matrix, the following classical estimate holds
(this is related to the Gauss–Seidel relaxation method; see for instance, Th. 8.2.12 in [21]). By using the assumptions on the matrices \(M_a\), we have \(\delta <1\). Hence, g is a contraction mapping on \({{\mathbb {R}}}^I\) and therefore we obtain the existence and uniqueness of a solution of (68) as desired. \(\square \)
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Bokanowski, O., Picarelli, A. & Reisinger, C. Stability and convergence of second order backward differentiation schemes for parabolic Hamilton–Jacobi–Bellman equations. Numer. Math. 148, 187–222 (2021). https://doi.org/10.1007/s00211-021-01202-x
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00211-021-01202-x