Convergent numerical approximation of the stochastic total variation flow
\v{L}ubom\'ir Ba\v{n}as, Michael R\"ockner, Andr\'e Wilke

TL;DR
This paper investigates the stochastic total variation flow with multiplicative noise, establishing existence of solutions via regularization, proposing an energy-preserving finite element method, and demonstrating convergence through numerical experiments.
Contribution
It introduces a new finite element approximation for the stochastic total variation flow and proves its convergence to the true solution, addressing regularization and numerical stability.
Findings
Numerical solutions converge to the true stochastic total variation flow.
The proposed method preserves energy in the discretization.
Numerical experiments confirm the practicability of the approach.
Abstract
We study the stochastic total variation flow (STVF) equation with linear multiplicative noise. By considering a limit of a sequence of regularized stochastic gradient flows with respect to a regularization parameter we obtain the existence of a unique variational solution of the STVF equation which satisfies a stochastic variational inequality. We propose an energy preserving fully discrete finite element approximation for the regularized gradient flow equation and show that the numerical solution converges to the solution of the unregularized STVF equation. We perform numerical experiments to demonstrate the practicability of the proposed numerical approximation. This paper contains a mistake: in the proof of Lemma 4.4 the last inequality is not valid. Meanwhile, this mistake has been fixed in [6] for a slightly modified numerical approximation in spatial dimension…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Convergent numerical approximation of the stochastic total variation flow
Ľubomír Baňas
Department of Mathematics, Bielefeld University, 33501 Bielefeld, Germany
,
Michael Röckner
Department of Mathematics, Bielefeld University, 33501 Bielefeld, Germany
and
André Wilke
Department of Mathematics, Bielefeld University, 33501 Bielefeld, Germany
Abstract.
We study the stochastic total variation flow (STVF) equation with linear multiplicative noise. By considering a limit of a sequence of regularized stochastic gradient flows with respect to a regularization parameter we obtain the existence of a unique variational solution of the STVF equation which satisfies a stochastic variational inequality. We propose an energy preserving fully discrete finite element approximation for the regularized gradient flow equation and show that the numerical solution converges to the solution of the unregularized STVF equation. We perform numerical experiments to demonstrate the practicability of the proposed numerical approximation.
This paper contains a mistake: in the proof of Lemma 4.4 the last inequality is not valid. Meanwhile, this mistake has been fixed in [6] for a slightly modified numerical approximation in spatial dimension . For the validity of the estimate in Lemma 4.4 is still open but the convergence of the numerical approximation can be shown by a different approach, see [5].
1. Introduction
We study numerical approximation of the stochastic total variation flow (STVF)
[TABLE]
where , is a bounded, convex domain with a piecewise -smooth boundary , and , are constants. We assume that and consider a one dimensional real-valued Wiener process , for simplicity; generalization for a sufficiently regular trace-class noise is straightforward.
Equation (1) can be interpreted as a stochastically perturbed gradient flow of the penalized total variation energy functional
[TABLE]
The minimization of above functional, so-called ROF-method, is a prototypical approach for image denoising, cf. [15]; in this context the function represents a given noisy image and serves as a penalization parameter. Further applications of the functional include, for instance, elastoplasticity and the modeling of damage and fracture, for more details see for instance [4] and the references therein.
The use of stochastically perturbed gradient flows has proven useful in image processing. Stochastic numerical methods for models with nonconvex energy functionals are able to avoid local energy minima and thus achieve faster convergence and/or more accurate results than their deterministic counterparts; see [12] which applies stochastic level-set method in image segmentation, and [16] which uses stochastic gradient flow of a modified (non-convex) total variation energy functional for binary tomography.
Due to the singular character of total variation flow (1), it is convenient to perform numerical simulations using a regularized problem
[TABLE]
with a regularization parameter . In the deterministic setting () equation (1) corresponds to the gradient flow of the regularized energy functional
[TABLE]
It is well-known that the minimizers of the above regularized energy functional converge to the minimizers of (2) for , cf. [9] and the references therein.
Owing to the singular character of the diffusion term in (1) the classical variational approach for the analysis of stochastic partial differential equations (SPDEs), see e.g. [13], [14], is not applicable to this problem. To study well-posedeness of singular gradient flow problems it is convenient to apply the solution framework developed in [3] which characterizes the solutions of (1) as stochastic variational inequalities (SVIs). In this paper, we show the well posedness of SVI solutions using the practically relevant regularization procedure (1) which, in the regularization limit, yields a SVI solution in the sense of [3]. Throughout the paper, we will refer to the solutions which satisfy a stochastic variational inequality as SVI solutions, and to the classical SPDE solutions as variational solutions. Convergence of numerical approximation of (1) in the deterministic setting () has been shown in [9]. Analogically to the deterministic setting, we construct an implementable finite element approximation of the problem (1) via the numerical discretization of the regularized problem (1). The scheme is implicit in time and preserves the gradient structure of the problem, i.e., it satisfies a discrete energy inequality. The deterministic variational inequality framework used in the the numerical analysis of [9] is not directly transferable to the stochastic setting. Instead, we show the convergence of the proposed numerical approximation of (1) to the SVI solution of (1) via an additional regularization step on the discrete level. The convergence analysis of the discrete approximation is inspired by the analytical approach of [10] where the SVI solution concept was applied to the stochastic -Laplace equation. As far as we are aware, the present work is the first to show convergence of implementable numerical approximation for singular stochastic gradient flows in the framework of stochastic variational inequalities.
The paper is organized as follows. In Section 2 we introduce the notation and state some auxiliary results. The existence of a unique SVI solution of the regularized stochastic TV flow (1) and its convergence towards a unique SVI solution of (1) for is shown in Section 3. In Section 4 we introduce a fully discrete finite element scheme for the regularizared problem (1) and show its convergence to the SVI solution of (1). Numerical experiments are presented in Section 5.
2. Notation and preliminaries
Throughout the paper we denote by a generic positive constant that may change from line to line. For , we denote by the standard spaces of -th order integrable functions on , and use and for the -inner product. For we denote the usual Sobolev space on as , and stands for the space with zero trace on with its dual space . Furthermore, we set , where is the duality pairing between and . The functional (4) with will be denoted as . We say that a mapping is -progressively measurable if is -measurable for all .
For the convenience of the reader we state some basic definitions below.
Definition 2.1**.**
Let be a real Banach space, a linear operator and its resolvent set. For a real number we define the resolvent of as
[TABLE]
Furthermore we define the Yosida approximation of as
[TABLE]
Definition 2.2**.**
The mapping which satisfies
[TABLE]
defines the -orthogonal projection onto .
Definition 2.3**.**
A function is called a function of bounded variation, if its total variation
[TABLE]
is finite. The space of functions of bounded variations is denoted by .
For we denote
[TABLE]
The following proposition plays an important role in the analysis below; the proposition holds for convex domains with piecewise smooth boundary, which includes the case of practically relevant polygonal domains, cf. [3, Proposition 8.2 and Remark 8.1].
Proposition 2.1**.**
Let , be a bounded domain with a piecewise -smooth and convex boundary. Let be a continuous and convex function of at most quadratic growth such that , then it holds
[TABLE]
3. Well posedness of STVF
In this section we show existence and uniques of the SVI solution of (1) (see below for a precise definition) via a two-level regularization procedure. To be able to treat problems with -regular data, i.e., , we consider a -approximating sequence s.t. in for and s.t. in for . We introduce a regularization of (1) as
[TABLE]
where is an additional regularization parameter.
We define the operator as
[TABLE]
and note that (3) is equivalent to
[TABLE]
The operator is coercive, demicontinuos and satisfies (cf. [14, Remark 4.1.1])
[TABLE]
The following monotonicity property, which follows from the convexity of the function , will be used frequently in the subsequent arguments
[TABLE]
The existence and uniqueness of a variational solution of (3) is established in the next lemma; we note that the result only requires -regularity of data.
Lemma 3.1**.**
For any and , there exists a unique variational solution of (3). Furthermore, there exists a such that the following estimate holds
[TABLE]
Proof of Lemma 3.1.
On noting the properties (10)-(11) of the operator for the classical theory, cf. [14], implies that for any given data , there exists a unique variational solution of (3) which satisfies the stability estimate. ∎
In next step, we show a priori estimate for the solution of (3) in stronger norms; the estimate requires -regularity of the data.
Lemma 3.2**.**
Let , . There exists a constant such that for any the corresponding variational solution of (3) satisfies
[TABLE]
Proof of Lemma 3.2.
Let be an orthonormal basis of eigenfunctions of the Dirichlet Laplacian on and . Let be the -orthogonal projection onto .
For fixed the Galerkin approximation of satisfies
[TABLE]
By standard arguments, cf. [14, Theorem 5.2.6], there exists a such that in for . We use Itô’s formula for to obtain
[TABLE]
Let be the Yosida-approximation and the resolvent of the Dirichlet Laplacian on , respectively; see Definition 2.1. By the convexity, cf. (3), we get
[TABLE]
where we used Proposition 2.1 in the last step above. The Burkholder-Davis-Gundy inequaltiy for implies that
[TABLE]
After taking supremum over and expectation in (3), using (3) along with the Tonelli and Gronwall lemmas we obtain
[TABLE]
Hence, from the sequence we can extract a subsequence (not relabeled), s.t. for
[TABLE]
By lower-semicontinuity of the norms, we get
[TABLE]
∎
We define the following functionals
[TABLE]
and (for )
[TABLE]
where is the trace of on the boundary and is the Hausdorff measure. and are both convex and lower semicontinuous on and the lower semicontinuous hulls of or respectively, cf. [2, Proposition 11.3.2]. We define the SVI solution of (1) and (1) analogically to [3, Definition 3.1] as a stochastic variational inequality.
Definition 3.1**.**
Let , and and . Then an -adapted stochastic process (denoted by for ) is called an SVI solution of (1) (or (1) if ) if (), and for each -progressively measurable process and for each -adapted -valued process with -a.s. continuous sample paths, s.t. , which satisfy the equation
[TABLE]
it holds for that
[TABLE]
and analogically for it holds that
[TABLE]
In the next theorem we show the existence and uniqueness of a SVI solution to (1) for in the sense of the Definition 3.1.
Theorem 3.1**.**
Let and , . For each there exists a unique SVI solution of (1). Moreover, any two SVI solutions with , and , satisfy
[TABLE]
for all .
Proof of Theorem 3.1.
We show that for fixed the sequence of variational solutions of (3) is a Cauchy-sequence w.r.t. for any fixed , and then show that it is a Cauchy-sequence w.r.t. for .
We denote by the solutions of (3) for , and , , respectively, where , belong to the -approximating sequence of . By Itô’s formula it follows that
[TABLE]
We note that
[TABLE]
Hence by using the convexity (3), Lemma 3.2, the Burkholder-Davis-Gundy inequality for , the Tonelli and Gronwall lemmas we obtain
[TABLE]
Inequality (3) implies for that
[TABLE]
Hence for any fixed , there exists a -adapted process , s.t.
[TABLE]
For fixed , , we get from (3) using (22) by the lower-semicontinuity of norms that
[TABLE]
Since for we deduce from (23) that for any fixed there exists an -adapted process such that
[TABLE]
In the next step, we show that the limiting process is a SVI solution of (1). We subtract the process
[TABLE]
with from (3) and obtain
[TABLE]
The Itô formula implies
[TABLE]
We rewrite the second term on the right-hand side in above inequality as
[TABLE]
The convexity of along with the Cauchy-Schwarz and Young’s inequalities imply that
[TABLE]
By combining two inequalities above with (3) we get
[TABLE]
Since and it holds that and . The lower-semicontinuity of in with respect to convergence in , cf. [1], and (22), (24) and the strong convergence in imply that for and the limiting process satisfies (3.1).
To conclude that is a SVI solution of (1) it remains to show that . Setting in (17) (which implies by (17)) yields
[TABLE]
On noting that (cf. Definition 2.3 or [9, proof of Theorem 1.3])
[TABLE]
and , we deduce from (3) that
[TABLE]
Hence, by the Tonelli and Gronwall lemmas it follows that
[TABLE]
Hence is a SVI solution of (1) for .
In the next step we show the uniqueness of the SVI solution. Let be two SVI solutions to (1) for a fixed with initial values and , respectively. Let be a sequence, s.t. in and be a sequence, s.t. in for and let be a sequence of variational solutions of (3) (for fixed ) with , . We note that the first part of the proof implies that in for , . We set in (3.1) and observe that
[TABLE]
The term is estimated using Young’s inequality as
[TABLE]
We have to show the following estimate
[TABLE]
We consider an approximating sequence , s.t., strongly in and for , cf. [2, Theorem 13.4.1]. Integration by parts then yields
[TABLE]
where is the outer normal vector at almost all . Since for almost all , the second boundary integral vanishes. We estimate the first boundary integral as
[TABLE]
On noting that for a.a. , the convergence for in implies in a.e. in . We further assert that the trace of each approximating function , coincides with the trace of on the boundary of , see [2, Remark 10.2.1]. Hence we obtain by taking the limit for that
[TABLE]
Next, we obtain
[TABLE]
After substituting - into (3) we arrive at
[TABLE]
The convergences (22), (24) imply the convergence in for , . We note that for the fourth term on the right-hand side of (3) vanishes due to Lemma 3.2. Hence, by taking the limits for , in (3), using the strong convergence in for , the lower-semicontinuity of norms and (22), (24) we obtain
[TABLE]
for all . After applying the Tonelli and Gronwall lemmas we obtain (20). ∎
Our second main theorem establishes existence and uniqueness of a SVI solution to (1) in the sense of Definition 3.1. The solution is obtained as a limit of solutions of the regularized gradient flow (1) for .
Theorem 3.2**.**
Let and , be fixed. Let be the SVI solutions of (1) for . Then converges to the unique SVI variational solution of (1) in for , i.e., there holds
[TABLE]
Furthermore, the following estimate holds
[TABLE]
where and are SVI solutions of (1) with , and , , respectively.
Proof of Theorem 3.2.
We consider -approximating sequences and of the initial condition and , respectively. For , we denote by the variational solutions of (3) with , , respectively. By Itô’s formula the difference satisfies
[TABLE]
We estimate the second term on the right-hand side of (3) using the convexity (3)
[TABLE]
Next, we observe that
[TABLE]
Using the inequality above, we get
[TABLE]
Substituting (3) along with the last inequality into (3) yields
[TABLE]
After using the Burkholder-Davis-Gundy inequality for , the Tonelli and Gronwall lemmas we obtain that
[TABLE]
We take the limit for in (36) for fixed and , and obtain using (22) by the lower-semicontinuity of norms that
[TABLE]
Hence, by (24) and the lower-semicontinuity of norms, after taking the limit in (3) for fixed , we get
[TABLE]
The above inequality implies that is a Cauchy Sequence in . Consequently there exists a unique -adapted process with such that
[TABLE]
This concludes the proof of (31).
Next, we show that the limiting process is the SVI solution of (1), i.e., we show that (3.1) holds. We note that (3) implies that
[TABLE]
Hence using (39), (40) we get by Fatou’s lemma and [2, Proposition 11.3.2] that
[TABLE]
By Theorem 3.1 we know that satisfies (3.1) for any . By taking the limit for in (3.1), using the above inequality and (39) it follows that satisfies . Finally, inequality follows after taking the limit for in (39), by (20) and the lower semicontinuity of norms. ∎
4. Numerical Approximation
We construct a fully-discrete approximation of the STVF equation (1) via an implicit time-discretization of the regularized STVF equation (1). For we consider the time-step , set for and denote the discrete Wiener increments as . We combine the discretization in time with a the standard -conforming finite element method, see, e.g., [7], [9], [4]. Given a family of quasi-uniform triangulations \big{\{}\mathcal{T}_{h}\big{\}}_{h>0} of into open simplices with mesh size we consider the associated space of piecewise linear, globally continuous functions and set for the rest of the paper. We set , , where is the -projection onto .
The implicit fully-discrete approximation of (1) is defined as follows: fix , set and determine , as the solution of
[TABLE]
To show convergence of the solution of the numerical scheme (41) we need to consider a discretization of the regularized problem (3). Given , and we choose , in (3). Since the sequences , constitute -approximating sequences of , , respectively. We set , , where is the -projection onto . The fully-discrete Galerkin approximation of (3) for fixed is then defined as follows: fix , set and determine , as the solution of
[TABLE]
The next lemma, cf. [17, Lemma II.1.4] is used to show -a.s. existence of discrete solutions , of numerical schemes (41), (4), respectively.
Lemma 4.1**.**
Let be continuous. If there is such that whenever then there exist satisfying and .
In order to show -measurability of the random variables , we make use of the following lemma, cf. [11, 8].
Lemma 4.2**.**
Let be a measure space. Let be a function that is -measurable in its first argument for every , that is continuous in its second argument for every and moreover such that for every the equation has an unique solution . Then is -measurable.
Below we show the existence, uniqueness and measurability of numerical solutions of (41), (4). We state the result for the scheme (4) only, since the proof also holds for (i.e. for (41)) without any modifications.
Lemma 4.3**.**
Let , and let be fixed. The for any , , there exist -measurable -a.s. unique random variables which solves (4).
Proof of Lemma 4.3.
Assume that the -valued random variables satisfy (4) and that is -measurable for . We show that there is a measurable random variable , that satisfies (41). Let be the basis of . We identify every with a vector with and define a norm on as . For an arbitrary we represent as a vector and define a function component-wise for as
[TABLE]
We show, that for each there exists an such that . We note the following inequality
[TABLE]
On choosing large enough, the existence of for each then follows by Lemma 4.1, since is continuous by the demicontinuity of the operator , which follows from hemicontinuity and and monotonicty of for , , see [14, Remark 4.1.1]. The -measurabilty follows by Lemma 4.2 for unique .
Hence, it remains to show that is -a.s. unique. Assume there are two different solution , s.t. for . Then by the convexity (3) we observe that
[TABLE]
Hence -a.s. ∎
We define the discrete Laplacian by
[TABLE]
To obtain the required the stability properties of the numerical approximation (4) we need the following lemma.
Lemma 4.4**.**
Let be the discrete Laplacian defined by (43). Then for any , the following inequality holds:
[TABLE]
Proof of Lemma 4.4.
Let be the basis of consisting of continuous piecewise linear Lagrange basis functions associated with the nodes of the triangulation . Then any has the representation , where and analogically , with coefficients . From (43) it follows that
[TABLE]
where we denote for .
We rewrite (45) with the mass matrix and the stiffness matrix and as
[TABLE]
where is the vector and is the vector . Since consists of functions, which are piecewise linear on the triangles , is constant on every triangle . We note, that the matrices and are positive definite. We get using the Young’s inequality
[TABLE]
since is positive definite. ∎
In the next lemma we state the stability properties of the numerical solution of the scheme (4) which are discrete analogues of estimates in Lemma 3.1 and Lemma 3.2.
Lemma 4.5**.**
Let and be given. Then there exists a constant such that for any , the solution of scheme (4) satisfies
[TABLE]
and a constant such that for any
[TABLE]
Proof of Lemma 4.5.
We set in (4), use the identity and get for
[TABLE]
We take expected value in (4) and on noting the properties of Wiener increments , and the independence of and we estimate the stochastic term as
[TABLE]
We neglect the positive term
[TABLE]
and get from (4) that
[TABLE]
We sum up the above inequality for and obtain
[TABLE]
By the discrete Gronwall lemma it follows from (4) that
[TABLE]
We substitute the above estimate into the right-hand side of (4) to conclude (4.5). To show the estimate (48) we set in (4) use integration by parts and proceed analogically to the first part of the proof. We note that by Lemma 4.4 it holds that
[TABLE]
Hence we may neglect the positive term and get that
[TABLE]
and obtain (48) after an application of the discrete Gronwall lemma. ∎
We define piecewise constant time-interpolants of the numerical solution of (4) for as
[TABLE]
and
[TABLE]
We note that (4) can be reformulated as
[TABLE]
where and if .
Estimate (4.5) yields the bounds
[TABLE]
Furthermore, (55) and (11) imply
[TABLE]
The estimates in (55) imply for fixed , the existence of a subsequence, still denoted by , and a , s.t., for
[TABLE]
In addition, there exists a such that in as and the estimate (56) implies the existence of a , s.t.,
[TABLE]
The estimates in (55) also implies for fixed , the existence of a subsequence, still denoted by , and a , s.t.,
[TABLE]
Finally, the inequality (4) implies
[TABLE]
which shows that the weak limits of and coincide.
The following result shows that the limit , i.e., that the numerical solution of scheme (4) converges to the unique variational solution of (3) for . Owing to the properties (10), (11) the convergence proof follows standard arguments for the convergence of numerical approximations of monotone equations, see for instance [11], [8], and is therefore omitted. We note that the convergence of the whole sequence follows by the uniqueness of the variational solution.
Lemma 4.6**.**
Let and be given, let , be fixed. Further, let be the unique variational solution of (3) for , and , be the respective time-interpolant (52), (53) of the numerical solution of (4). Then , converge to for in the sense that the weak limits from (4), (58) satisfy , and . In addition it holds for almost all that
[TABLE]
and there is an -valued continuous modification of (denoted again as ) such that for all
[TABLE]
The strong monotonicity property (10) of the operator implies strong convergence of the numerical approximation in .
Lemma 4.7**.**
Let and be given, let , be fixed. Further, let be the variational solution of (3) for , and be the time-interpolant (52) of the numerical solution of (4). Then the following convergence holds true
[TABLE]
Proof of Lemma 4.7.
The proof follows along the lines of [11], [8]. We sketch the main steps of the proof for the convenience of the reader.
We note that satisfies (cf. proof of Lemma 4.5)
[TABLE]
where .
We reformulate the third term on the right-hand side in (4) as
[TABLE]
We substitute the equality above into (4) and obtain for that
[TABLE]
We observe that for . Hence, by the lower-semicontinuity of norms using the convergence properties from Lemma 4.6 and the monotonicity property (10) we get for that
[TABLE]
It is not difficult to see that (61) for implies
[TABLE]
We subtract the equality (65) from (4) and obtain for
[TABLE]
Hence, we conclude that in . ∎
Remark 4.1**.**
It is obvious from the proof of Lemma 4.7 that the strong convergence in remains valid for due to (10) by the Poincaré inequality.
Next lemma guarantees the convergence of the numerical solution of scheme (4) to the numerical solution of scheme (41) for .
Lemma 4.8**.**
Let and be given. Then for each there exists a constant , such that for any , , , the following estimate holds for the difference of numerical solutions of (41) and (4):
[TABLE]
We note that the -dependent constant in the estimate above is due to the a priori estimate (48), for -regular data , it holds that by the stability of the discrete -projection in .
Proof of Lemma 4.8.
We define . From (41) and (4) we get
[TABLE]
We set and obtain
[TABLE]
We note that
[TABLE]
and by the Cauchy-Schwarz and Young’s inequalities
[TABLE]
From the convexity (3) it follows that
[TABLE]
Hence, we obtain that
[TABLE]
We estimate the last term on the right-hand side above as
[TABLE]
and substitute the above identity into (66)
[TABLE]
Next, we sum up the above inequality up to and obtain
[TABLE]
After taking expectation in the above and using the independence properties of Wiener increments and the estimate (48) we arrive at
[TABLE]
with . Finally, the Discrete Gronwall lemma yields for that
[TABLE]
which concludes the proof . ∎
We define piecewise constant time-interpolant of the discrete solution of (41) for as
[TABLE]
We are now ready to state the second main result of this paper which is the convergence of the numerical approximation (41) to the unique SVI solution of the total variation flow (1) (cf. Definition 3.1).
Theorem 4.1**.**
Let be the SVI solution of (1) and let be the time-interpolant (68) of the numerical solution of the scheme (41). Then the following convergence holds true
[TABLE]
Proof of Theorem 4.1.
For and we define the -approximating sequences , , , , via the -projection onto . We consider the solutions of (1), (3), respectively, and denote by the SVI solution of (1) for , . Furthermore, we recall that the interpolant of the numerical solution of (4) was defined in (52).
We split the numerical error as
[TABLE]
By Theorem 3.1 it follows that
[TABLE]
To estimate the second term we consider the solutions of (1) with and . From (20) we deduce that
[TABLE]
We use (22) to estimate the third term as
[TABLE]
The fourth term is estimated by Lemma 4.7
[TABLE]
For the last term we use Lemma 4.8
[TABLE]
Finally, we consecutively take , , and in (4) and use the above convergence of to obtain (69). ∎
Remark 4.2**.**
We note that the convergence analysis simplifies in the case that the problem data have higher regularity. For it is possible to show that the problem (1) admits a unique variational solution (which is also a SVI solution of (1) by uniqueness) by a slight modification of standard monotonicity arguments. This is due to the fact that the operator (8) retains all its properties for except for the coercivity. The coercivity is only required to guarantee -stability of the solution, nevertheless the stability can also be obtained directly by the Itô formula on the continuous level, cf. Lemma 3.2, or analogically to Lemma 4.5 on the discrete level, even for . Consequently, for -data the convergence of the numerical solution can be shown as in Theorem 4.1 without the additional -regularization step.
We conclude this section by showing unconditional stability of scheme (41), i.e., we show that the numerical solution satisfies a discrete energy law which is an analogue of the energy estimate (3).
Lemma 4.9**.**
Let and . Then there exist a constant such that the solutions of scheme (41) satisfy for any ,
[TABLE]
Proof of Lemma 4.9.
We set in (41) and obtain
[TABLE]
Using the the convexity of along with the inequality
[TABLE]
we get from (4) that
[TABLE]
After taking the expectation and summing up over in (4), and noting that we obtain
[TABLE]
Hence (4.9) follows after an application of the discrete Gronwall lemma. ∎
5. Numerical experiments
We perform numerical experiments using a generalization of the fully discrete finite element scheme (41) on the unit square . The scheme for then reads as
[TABLE]
where are suitable approximations of , (e.g., the orthogonal projections onto ), respectively, and is a constant. The multiplicative space-time noise is constructed as follows. The term is taken to be a -valued space-time noise of the form
[TABLE]
where , are independent scalar-valued Wiener processes and is the standard ’nodal’ finite element basis of . In the simulations below we employ three practically relevant choices of : a tracking-type noise , a gradient type noise and the additive noise ; in the first case the noise is small when the solution is close to the ’noisy image’ , in the gradient noise case the noise is localized along the edges of the image. We note that the fully discrete finite element scheme (5) corresponds to an approximation of the regularized equation (1) with a slightly more general space-time noise term of the form .
In all experiments we set , , . If not mentioned otherwise we use the time step , the mesh size and set , . We define as a piecewise linear interpolation of the characteristic function of a circle with radius on the finite element mesh, see Figure 1 (left), and set with , where , are realizations of independent -distributed random variables. If not indicated otherwise we use ; the corresponding realization of is displayed in Figure 1 (right).
We choose , , as parameters for the ’baseline’ experiment; the individual parameters are then varied in order to demonstrate their influence on the evolution. The time-evolution of the discrete energy functional , for a typical realization of the space-time noise is displayed in Figure 2; in the legend of the graph we state parameters which differ from the parameters of the baseline experiment, e.g., the legend ’’ corresponds to the parameters , and the remaining parameters are left unchanged, i.e., . For all considered parameter setups, except for the case of noisier image , the evolution remained close to the discrete energy of the deterministic problem (i.e., (5) with ). The energy decreases over time until the solution is close to the (discrete) minimum of ; to highlight the differences we display a zoom at the graphs. We observe that in the early stages (not displayed) the energy of stochastic evolutions with sufficiently small noise typically remained below the energy of the deterministic problems and the situation reversed as the solution approached the stationary state.
In Figure 3 we display the solution at the final time computed with , for , respectively, and , ; graphically the results of the remaining simulations did not significantly differ from the first case. The displayed results may indicate that the noise yields worse results than the noise and ; however, for sufficiently small value of the results would remain close to the deterministic simulation as well. We have magnified noise intensity to highlight the differences to the other noise types (i.e., the noise is concentrated along the edges of the image). We note that the gradient type noise might be a preferred choice for practical computations, cf. [16].
Acknowledgement
This work was supported by the Deutsche Forschungsgemeinschaft through SFB 1283 “Taming uncertainty and profiting from randomness and low regularity in analysis, stochastics and their applications”. The authors would like to thank the referee for careful reading of the manuscript and constructive comments, as well as to Lars Diening for stimulating discussions. We would also like to thank Martin Ondreját for pointing to us inaccuracies in the proof of uniqueness in Theorem 3.1.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] L. Ambrosio, N. Fusco, and D. Pallara. Functions of bounded variation and free discontinuity problems . Oxford Mathematical Monographs. The Clarendon Press, Oxford University Press, New York, 2000.
- 2[2] H. Attouch, G. Buttazzo, and G. Michaille. Variational analysis in Sobolev and BV spaces , volume 6 of MPS/SIAM Series on Optimization . Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA; Mathematical Programming Society (MPS), Philadelphia, PA, 2006. Applications to PD Es and optimization.
- 3[3] V. Barbu and M. Röckner. Stochastic variational inequalities and applications to the total variation flow perturbed by linear multiplicative noise. Arch. Ration. Mech. Anal. , 209(3):797–834, 2013.
- 4[4] S. Bartels and M. Milicevic. Stability and experimental comparison of prototypical iterative schemes for total variation regularized problems. Comput. Methods Appl. Math. , 16(3):361–388, 2016.
- 5[5] Ľ. Baňas, M. Röckner, and A. Wilke. Convergent numerical approximation of the stochastic total variation flow with linear multiplicative noise: the higher dimensional case, 2022. https://arxiv.org/abs/2211.04162 .
- 6[6] Ľ. Baňas, M. Röckner, and A. Wilke. Correction to: Convergent numerical approximation of the stochastic total variation flow. Stoch PDE: Anal. Comp. , 2022. https://doi.org/10.1007/s 40072-022-00267-5 .
- 7[7] S. C. Brenner and L. R. Scott. The Mathematical Theory of Finite Element Methods (second edition) . Springer-Verlag, New York, 2002.
- 8[8] E. Emmrich and D. Šiška. Nonlinear stochastic evolution equations of second order with damping. Stoch. Partial Differ. Equ. Anal. Comput. , 5(1):81–112, 2017.
