Next Article in Journal
Application of SVM and Chi-Square Feature Selection for Sentiment Analysis of Indonesia’s National Health Insurance Mobile Application
Previous Article in Journal
Product Selection Considering Multiple Consumers’ Expectations and Online Reviews: A Method Based on Intuitionistic Fuzzy Soft Sets and TODIM
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Numerical Method for Fractional-Order Generalization of the Stochastic Stokes–Darcy Model

by
Abdumauvlen Berdyshev
1,2,
Dossan Baigereyev
1,3,* and
Kulzhamila Boranbek
3
1
Institute of Information and Computational Technologies, 28 Shevchenko Str., Almaty 050010, Kazakhstan
2
Department of Mathematics and Mathematical Modeling, Abai Kazakh National Pedagogical University, 86 Tole bi Str., Almaty 050012, Kazakhstan
3
Department of Mathematics, Higher School of IT and Natural Sciences, Sarsen Amanzholov East Kazakhstan University, 148 Shakarim Ave., Ust-Kamenogorsk 070002, Kazakhstan
*
Author to whom correspondence should be addressed.
Mathematics 2023, 11(17), 3763; https://doi.org/10.3390/math11173763
Submission received: 7 August 2023 / Revised: 28 August 2023 / Accepted: 31 August 2023 / Published: 1 September 2023
(This article belongs to the Section Computational and Applied Mathematics)

Abstract

:
This paper is aimed at efficient numerical implementation of the fractional-order generalization of the stochastic Stokes–Darcy model, which has important scientific, applied, and economic significance in hydrology, the oil industry, and biomedicine. The essence of this generalization of the stochastic model is the introduction of fractional time derivatives in the sense of Caputo’s definition to take into account long-term changes in the properties of media. An efficient numerical method for the implementation of the fractional-order Stokes–Darcy model is proposed, which is based on the use of a higher-order approximation formula for the fractional derivative, higher-order finite difference relations, and a finite element approximation of the problem in the spatial direction. In the paper, a rigorous theoretical analysis of the stability and convergence of the proposed numerical method is carried out, which is confirmed by numerous computational experiments. Further, the proposed method is applied to the implementation of the fractional-order stochastic Stokes–Darcy model using an ensemble technique, in which the approximation is carried out in such a way that the resulting systems of linear equations have the same coefficient matrix for all realizations. Furthermore, evaluation of the discrete fractional derivatives is carried out with the use of parallel threads. The efficiency of applying both approaches has been demonstrated in numerical tests.

1. Introduction

The model described by the joint Stokes–Darcy equations occupies an important place in computational fluid dynamics due to its wide application in problems of interaction between surface and underground flows, in predicting processes occurring in oil reservoirs with a cavernous-porous structure, in underground systems of karst aquifers, and others. In addition, this model is used in forecasting and assessing the risk of flooding of territories as a result of groundwater and surface water. In this model, the free fluid flow is described using the Stokes equation, and the flow in a porous medium is described by the Darcy equation. It is believed [1] that the joint Stokes–Darcy model is more adequate than each of the models considered separately.
This model is most fully studied under the assumption that the input parameters of the problem, such as physical quantities describing the model, media properties, exposure conditions, domain geometry, boundary conditions, and initial conditions, are known. In reality, there are many uncertainties that arise from the difficulty in determining real data due to measurement noise, internal variability in physical quantities, and the adoption of simplifying assumptions. As a result, a plausible description of the fluid flow process using classical deterministic partial differential equations seems impossible. This often gives rise to the risks of making inadequate technological and managerial decisions. In practice, knowledge about the qualitative and quantitative properties of a porous medium is often fragmentary, since the input data are formed on the basis of laboratory analysis of samples taken at several rarefied points of the territory with their subsequent interpolation.
The study of the stochastic generalization of the deterministic Stokes–Darcy model is a fairly new and relevant area in modern computational fluid dynamics. The earliest work in this direction, in our opinion, is the paper of Kumar et al. [2] published in 2018. Interest in this model has grown rapidly over the course of 3–4 years, as evidenced by numerous works published to this day [1,3,4,5,6].
A significant drawback of the stochastic Stokes–Darcy model is the neglect of an extremely important property of a porous medium—memory, which largely affects the nature of the fluid flow. The need to take into account this property lies in the fact that the porosity and permeability of the medium change in the process of fluid flow, and more noticeably lead to a deceleration in the flow rate over time. Therefore, the nature of the fluid flow is determined not only by the current state of the porous medium, but also by all its previous states.
Taking into account the importance of this direction, this paper studies a further generalization of the stochastic Stokes–Darcy model, which takes into account long-term changes in the properties of media. Accounting for memory in our work is achieved by using fractional differential calculus; namely, by replacing integer time derivatives with fractional-order derivatives in the sense of Caputo’s definition. This generalization is a natural generalization of the works of scientists in the field of fractional differential fluid flow theory [7,8,9] and is based on the hypotheses put forward in [7].
The main problem associated with the considered model is the complexity of its numerical implementation. For example, the application of the stochastic Galerkin method to this model, which is based on the expansion in generalized polynomial chaos, is difficult due to the complication of using existing solvers without their serious modification [2]. Stochastic collocation methods [10,11] do not have this disadvantage; however, the number of nodes increases with an increase in stochastic dimensions, which leads to a significant increase in computational complexity. The very popular Monte Carlo method, being easy to implement and allowing the use of well-known deterministic algorithms and having a high potential for parallelization, has a rather low convergence rate [3]. Much effort has been put into the development of fast convergent methods, such as quasi-Monte Carlo methods [12], multilevel Monte Carlo methods [2,13,14], centroidal Voronoi tilings [15], and Latin hypercube selection [16]. Despite the fact that these methods make it possible to use existing deterministic algorithms without changes, the complex form of the equations in the proposed fractional-order stochastic model leads to high computational costs. In addition, accounting for uncertainty usually leads to the need to run the solvers of these methods multiple times in order to obtain statistical moments. This drawback is partially overcome in the so-called ensemble algorithms [17], in which the problem is solved simultaneously for all realizations in the ensemble instead of solving the problem individually for each realization. In the latter work, this was achieved by approximating the nonlinear term u · u as follows:
u n · u n + 1 u ¯ n · u n + 1 + u n u ¯ n · u n ,
where u ¯ n is the average velocity for all realizations in the ensemble. As a result of this approximation, the sought coefficients of u n + 1 do not depend on the current realization in the ensemble. Therefore, the systems of linear equations for all realizations have the same coefficient matrix, but different right-hand sides. This makes it possible to use efficient factorization methods for systems of linear equations, which significantly speeds up the solution of the problem.
Since the permeability fields do not have obvious separation of scales, a multiscale method [18,19] is an effective method for solving fluid flow problems because of its usage of limited global information. In particular, in [18] the problem of fluid motion in a porous medium is solved using a stochastic mixed multiscale finite element method (FEM) on a coarse grid. This approach does not require interpolation in the stochastic space and can be combined with approaches based on interpolation on a coarse grid. In addition to this, in [19], a new mixed multiscale FEM is proposed within a heterogeneous multiscale method that provides both local and global mass conservation. In [20], a stochastic FEM solution based on the perturbation method is developed. The paper [5] proposes three algorithms for quantifying uncertainty. Due to the complexity of the media under consideration, the initial data can be characterized by a weak singularity. Recent studies address this class of problems and propose Sinc-collocation methods [21] and methods based on orthogonal spline collocation [22,23] for their solution. In [3], an efficient approach for implementing the stochastic Stokes–Darcy model with a random hydraulic conductivity tensor is proposed, which is based on separation of the Stokes–Darcy system into two subproblems, as well as on assembling a common matrix of coefficients for all realizations in the ensemble. This approach significantly speeds up the solution of the resulting systems of linear equations without affecting the accuracy of calculations. In [24], a stabilized mixed method for solving the problem is proposed that does not use Lagrange multipliers. In [1,25,26], a stochastic collocation method on sparse grids is developed for the Stokes–Darcy model with random hydraulic conductivity. In [27], an ensemble domain decomposition method is proposed, the peculiarity of which is that the solution of the problem is reduced to solving a system of linear algebraic equations with a common matrix of coefficients for each deterministic numerical model.
Recent studies have focused on the construction of higher-order numerical schemes for the Stokes–Darcy equations with integer time derivatives. For example, in [6], a second-order ensemble numerical method is proposed for stochastic Stokes–Darcy equations based on the results of [3,17]. Li et al. [28] constructed a second-order fractional time-stepping method. Qin et al. [29] and Li et al. [30] proposed numerical schemes that combine a time filter and a Backward Euler scheme to increase the convergence order without increasing the amount of computation. Furthermore, [29] obtained a third-order scheme by applying a time filter to the BDF2 scheme. Chen et al. [31] proposed a third-order in time Adam–Moulton–Bashforth method. Further, recent papers have studied the nonlinear generalizations of Stokes–Darcy equations [32,33,34] by applying domain decomposition techniques, optimization methods, and mortar finite element methods. Other effective techniques should be noted, such as the optimal homotopy asymptotic method [35,36], which was successfully applied to studying nonlinear behaviors described by partial differential equations containing fractional-order time derivatives [37,38].
The present study is aimed at continuing the development of ensemble methods for solving stochastic Stokes–Darcy equations for cases when the equations contain fractional time derivatives. This work has several key differences from previous studies. First, an ensemble method for implementing a fractional-order stochastic generalization of the Stokes–Darcy model is constructed in the work. In our opinion, this is the first study of the specified generalization of the model. Secondly, in contrast to the original works [3,6] employing the ensemble technique, the constructed computational scheme has an order of convergence greater than 2 in the time variable. This is achieved by using an approximation formula of the order O τ 3 ν for the fractional derivative in the sense of Caputo, as well as by a special approximation of some terms. Thirdly, the paper proposes a parallel algorithm to accelerate the computation process and analyzes the acceleration rate on a test problem.
The main contribution of this study is a higher-order numerical scheme allowing for parallel execution, which makes it possible to efficiently solve the fractional-order stochastic Stokes–Darcy equations.
The structure of the article is as follows. In the next section, the formulation of a new initial boundary-value problem for the fractional-order stochastic generalization of the Stokes–Darcy equation is given. Section 2.2 proposes a method for solving this problem. Section 2.3 is devoted to the theoretical study of the solution method. Section 3 contains the results of computational experiments to confirm the results of the theoretical analysis. Finally, Section 4 discusses the results obtained.

2. Materials and Methods

2.1. Formulation of the Problem

Consider the fluid flow process in two non-intersecting bounded domains Ω f R d and Ω p R d   d = 2 , 3 separated by an interface I, i.e., Ω f Ω p = , Ω ¯ f Ω ¯ p = I and Ω f Ω p = Ω (Figure 1). It is assumed that a free surface flow occurs in Ω f , then the flow moves into the domain Ω p with a porous medium. Let n f and n p denote outer unit normal vectors to the boundaries Ω f and Ω p , and m i i = 1 , 2 , , d 1 denote an orthonormal system of tangential vectors to the interface I. Further, the fluid flow process is studied on the time interval J ¯ , where J = 0 , T for T > 0 .
Let u and p denote the fluid velocity and pressure in Ω f , respectively; let ϕ be the piezometric head in Ω p ; let μ be the fluid viscosity and K be the hydraulic conductivity tensor of the porous medium. Then, the fractional-order generalization of the linearized Stokes–Darcy model reads as follows:
Problem 1.
Find u , p , ϕ in Ω × J satisfying the following conditions:
0 , t α u μ 2 u + p = f f , x , t Ω f × J , α 0 , 1 ,
· u = 0 , x , t Ω f × J ,
u = 0 , x , t Ω f I × J ,
S 0 , t β ϕ · K ϕ = f p , x , t Ω p × J , β 0 , 1 ,
K ϕ · n p = 0 , x , t Ω p I × J ,
u · n f K ϕ · n p = 0 , x , t I × J ,
p μ n f u · n f = g ϕ , x , t I × J ,
n f · u · m i = α BJS m i · K m i u · m i , x , t I × J , 1 i d 1 ,
u = u 0 , x , t Ω ¯ f × 0 ,
ϕ = ϕ 0 , x , t Ω ¯ p × 0 ,
where the fractional derivative in the sense of Caputo is defined as
0 , t ν f x , t = 1 Γ 1 ν 0 t f t x , θ 1 t θ ν d θ , ν 0 , 1 ,
and S is the reservoir capacity coefficient, g is the gravitational acceleration constant, and α BJS is a dimensionless parameter that depends on the structure of the porous medium.
A feature of this problem is that the hydraulic conductivity K , the initial data u 0 , ϕ 0 , and the right-hand sides f f , f p are not fully known in practice. Most often, the mean and variance of these values are available as a result of geological study. Therefore, there is a high degree of uncertainty that must be taken into account when modeling a fluid flow process in such complex media.
To account for the uncertainty effects, we utilize a commonly acceptable approach, in which a set of input data K ω , u 0 , ω , ϕ 0 , ω , f f , ω , f p , ω ω = 1 N ω is randomly generated, then Problem 1 is solved N ω times with specified data. As a result, one obtains a series of problems instead of Problem 1. Thus, a set of solutions u ω , p ω , ϕ ω ω = 1 N ω is found, with the help of which the statistical moments are subsequently determined.
Therefore, the rest of this section, as well as Section 2.2, Section 2.3 and Section 2.4, are aimed at developing a numerical method for solving the problem for one of the N ω realizations. Further, in Section 3, the proposed method is applied to the solution of a stochastic problem that covers N ω samples of input parameters.
We introduce the following spaces:
X f = v H 1 Ω f d | v = 0 on Ω f I ,
Q f = q L 2 Ω f | Ω f q d x = 0 ,
Q p = ψ H 1 Ω p | ψ = 0 on Ω p I , X = X f × Q p ,
where the standard notation for Sobolev spaces H k Ω and Lebesgue spaces L p Ω is utilized. We use the notation · , · Ω to denote the dot product in L 2 Ω , the notations v Ω f and ψ Ω p stand for v L 2 Ω f and ψ L 2 Ω p for brevity, and the norm in X is defined as
v ^ = v Ω f 2 + ψ Ω p 2 1 / 2 , v ^ X .
In order to construct a weak formulation of Problem 1 for the ω -th implementation, we multiply Equations (1), (2) and (4) by arbitrary elements v X f , q Q f , and g ψ Q p , respectively, then integrate the resulting equations over the corresponding domains Ω f and Ω p , taking into account the boundary conditions (3) and (5)–(8), and use the expansion of the test velocity vector v in terms of its normal and tangential components:
v = v · n f n f + i = 1 d 1 v · m i m i .
Moreover, we introduce the notation u ^ = u , ϕ , v ^ = v , ψ for brevity.
Problem 2
(Weak formulation). Find u ^ ω , p ω : J X × Q f satisfying the identity
D α , β u ^ ω , v ^ + A K ω ; u ^ ω , v ^ B v ^ , p ω + B u ^ ω , q + A I γ ω ; u ^ ω , v ^ I u ^ ω , v ^ = f ^ ω , v ^ ,
for all v ^ , q X × Q f , where
D α , β u ^ ω , v ^ = 0 , t α u ω , v Ω f + g S 0 , t β ϕ ω , ψ Ω p , A K ω ; u ^ ω , v ^ = A f u ^ ω , v ^ + A p K ω ; u ^ ω , v ^ , A f u ^ ω , v ^ = μ u ω , v Ω f , A p K ω ; u ^ ω , v ^ = g K ω ϕ ω , ψ Ω p , A I γ ω ; u ^ ω , v ^ = μ I γ ω u ω · m i v · m i d s , I u ^ ω , v ^ = H I v , ϕ ω H I u ω , ψ , B v ^ , q = q , · v Ω f , f ^ ω , v ^ = f f , ω , v Ω f + g f p , ω , ψ Ω p ,
and the following notation is introduced:
H I v , ϕ ω = g I ϕ ω v · n f d s , γ i , ω = α BJS m i · K ω m i , γ ω = i = 1 d 1 γ i , ω .

2.2. Numerical Method

We construct a numerical method for solving Problem 1 in two stages. First, we discretize the problem with respect to the time variable [39]. To do this, we introduce a uniform partition of the time interval J ¯ τ = t n = n τ , n = 0 , 1 , , N , N τ = T for the time discretization parameter τ > 0 , and the timestamp t = t n will be referred to as the nth time layer. We also introduce the notation f n = f · , t n for convenience.
In general, the construction of our computational method is based on the use of different approaches to discretize the problem on different time layers to increase the accuracy of the method. The first approach is applied to the first two time layers, t 1 and t 2 , and is based on the use of a Crank–Nicolson-type approximation [40]. The second approach covers the rest of the time layers, n 3 , and is based on the use of higher-order approximation formulas. In particular, we employ the following result from [41] in order to approximate fractional derivatives starting from the third time layer.
Lemma 1.
The discrete analogue Δ τ ν f n of the fractional derivative in the sense of Caputo 0 , t ν f t n of order ν 0 , 1 can be represented as [41]
Δ τ ν f n = λ 0 ν τ ν ς 0 ν f n s = 1 n δ n , n s ν f n s , n 3 ,
where
ς 0 ν = Γ 3 ν , λ 0 ν = 2 1 ν 1 + ν 2 , δ 3 , 2 ν = b 1 ν + c 2 ν 2 λ 0 ν , δ 3 , 1 ν = a 1 ν + b 2 ν + ν 2 λ 0 ν , δ 3 , 0 ν = a 2 ν λ 0 ν ,
and in the case of n 4 :
δ n , n 1 ν = b 1 ν + c 2 ν 2 λ 0 ν , δ n , n 2 ν = a 1 ν + b 2 ν + c 3 ν + ν 2 λ 0 ν , δ n , n s ν = a s 1 ν + b s ν + c s + 1 ν λ 0 ν , s = 3 , 4 , , n 2 , δ n , 1 ν = a n 2 ν + b n 1 ν λ 0 ν , δ n , 0 ν = a n 1 ν λ 0 ν ,
and
a s ν = 3 2 2 ν s + 1 1 ν + 1 2 2 ν s 1 ν + s + 1 2 ν s 2 ν , b s ν = 2 2 ν s + 1 1 ν 2 s + 1 2 ν + 2 s 2 ν , c s ν = 1 2 2 ν s + 1 1 ν + s 1 ν + s + 1 2 ν s 2 ν ,
where the quantity R n ν = 0 , t n ν f Δ τ ν f n , n 2 satisfies the estimate
R n ν 3 27 Γ 1 ν + 1 6 Γ 2 ν max t 0 t t n t 3 f t τ 3 ν .
The properties of the coefficients δ n , s ν have been rigorously studied in [41]. The following lemma summarizes the properties that will be used while proving the stability and convergence of the proposed numerical scheme.
Lemma 2.
The coefficients δ n , s ν have the following properties [41]:
(1) δ n , n 1 ν 0 , 4 3 ;
(2) δ n , n 2 ν 1 2 , 1 3 ;
(3) δ n , n s ν > 0 , s = 3 , 4 , , n ;
(4) s = 0 n 1 δ n , s ν = 1 .
Approximation of fractional derivatives on the first and second time layers is carried out according to another formula, which is formulated in the following lemma.
Lemma 3.
The discrete analogue Δ ¯ τ ν f n of the fractional derivative in the sense of Caputo 0 , t ν f t n of order ν 0 , 1 can be represented as [42]
Δ ¯ τ ν f n = τ ν ς ¯ 0 ν s = 1 n δ ¯ n , s ν f s f s 1 , n = 1 , 2 ,
where
δ ¯ n , s ν = n s + 1 1 ν n s 1 ν , ς ¯ 0 ν = Γ 2 ν ,
where the quantity R ¯ n ν = 0 , t ν f t n Δ ¯ τ ν f n satisfies the estimate
R ¯ n ν 5 ν 8 1 ν max 0 t t n t 2 f t τ 2 ν .
By combining the results of Lemmas 1 and 3, we conclude that the following relation holds for the bilinear form D α , β u ^ ω , v ^ on the nth time layer:
D α , β u ^ ω n , v ^ = D τ α , β u ^ ω n , v ^ + r 11 n , v Ω f + r 12 n , ψ Ω p , n 1 ,
where
D τ α , β u ^ ω n , v ^ = Δ τ α u ω n , v Ω f + g S Δ τ β ϕ ω n , ψ Ω p , n 3 , Δ ¯ τ α u ω n , v Ω f + g S Δ ¯ τ β ϕ ω n , ψ Ω p , n = 1 , 2 ,
and r 11 n = O τ 2 α , O τ 2 α , r 12 n = O τ 2 β when n = 1 , 2 ; r 11 n = O τ 3 α , O τ 3 α , r 12 n = O τ 3 β when n 3 .
Further, we transform the terms in (15) as shown below:
A I γ ω ; u ^ ω n , v ^ = A I i = 1 d 1 γ ¯ i + γ i , ω γ ¯ i ; u ^ ω n , v
= A I i = 1 d 1 γ ¯ i ; u ^ ω n , v + A I i = 1 d 1 γ i , ω γ ¯ i ; σ u ^ ω n 1 , v
+ μ i = 1 d 1 I γ i , ω γ ¯ i r 3 n · m i v · m i d s ,
A p K ω ; u ^ ω n , v ^ = A p K ¯ + K ω K ¯ ; u ^ ω n , v ^
= A p K ¯ ; u ^ ω n , v ^ + A p K ω K ¯ ; σ u ^ ω n 1 , v ^ + g K ω K ¯ r 5 n , ψ Ω p ,
I u ^ ω n , v ^ = I σ u ^ ω n 1 , v ^ + H I v , r 2 n H I r 4 n , ψ ,
where
σ u ^ ω n = σ u ω n , σ ϕ ω n , σ u ω n = 3 u ω n 3 u ω n 1 + u ω n 2 , σ ϕ ω n = 3 ϕ ω n 3 ϕ ω n 1 + ϕ ω n 2 ,
γ ¯ i = 1 N ω ω = 1 N ω γ i , ω , K ¯ = 1 N ω ω = 1 N ω K ω ,
r 2 n = O τ 3 , r 3 n = O τ 3 , O τ 3 , r 4 n = O τ 3 , O τ 3 , r 5 n = O τ 3 .
By using the approximations (20)–(24) and introducing the notation
u ^ ω n 1 / 2 = 1 2 u ^ ω n + u ^ ω n 1 ,
we rewrite Problem 2 in the following way.
Problem 3.
Let u ^ ω k , p ω k X × Q f , k = 0 , 1 , , n 1 be known; in particular, u ^ ω 0 = u 0 , ϕ 0 . Find u ^ ω n , p ω n X × Q f , n 1 satisfying the following identities for any v ^ , q X × Q f :
Case I:  when n = 1 , 2 :
D τ α , β u ^ ω n 1 / 2 , v ^ + A K ¯ ; u ^ ω n 1 / 2 , v ^ B v ^ , p ω n 1 / 2 + B u ^ ω n 1 / 2 , q + I u ^ ω n 1 / 2 , v ^ + A I γ ω ; u ^ ω n 1 / 2 , v ^ = f ^ ω n 1 / 2 , v ^ + r 11 n 1 / 2 , v Ω f + r 12 n 1 / 2 , ψ Ω p + H I v , r 2 n 1 / 2 + H I r 4 n 1 / 2 , ψ μ i = 1 d 1 I γ i , ω r 3 n 1 / 2 · m i v · m i d s + g K ω r 5 n 1 / 2 , ψ Ω p ,
Case II:  when n 3 :
D τ α , β u ^ ω n , v ^ + A K ¯ ; u ^ ω n , v ^ B v ^ , p ω n + B u ^ ω n , q + A I i = 1 d 1 γ ¯ i ; u ^ ω n , v ^ + A I i = 1 d 1 γ i , ω γ ¯ i ; σ u ^ ω n 1 , v ^ + I σ u ^ ω n 1 , v ^ + A p K ω K ¯ ; σ u ^ ω n 1 , v ^ = f ^ ω n , v ^ + r 11 n , v Ω f + r 12 n , ψ Ω p + H I v , r 2 n + H I r 4 n , ψ μ i = 1 d 1 I γ i , ω γ ¯ i r 3 n · m i v · m i d s + g K ω K ¯ r 5 n , ψ Ω p .
Now we discretize the problem with respect to spatial variables. To this end, we introduce the partitions T f h and T p h in Ω f and Ω p , respectively, that may consist of triangles, quadrilaterals, prisms, or parallelepipeds, and let T h = T f h T p h . Denote by X f h X f , Q f h Q f , Q p h Q p finite element spaces with the following approximation properties:
inf v h X f h v v h Ω f C h l + 1 v H l + 1 Ω f , v H l + 1 Ω f d , inf v h X f h v v h Ω f C h l v H l + 1 Ω f , v H l + 1 Ω f d , inf q h Q f h q q h Ω f C h l q H l Ω f , q H l Ω f , inf ψ h Q p h ψ ψ h Ω p C h m + 1 ψ H m + 1 Ω p , ψ H m + 1 Ω p , inf ψ h Q p h ψ ψ h Ω p C h m ψ H m + 1 Ω p , ψ H m + 1 Ω p ,
and let X h = X f h × Q p h .
By discarding the error terms in (26) and (27), the following discrete problem can be obtained.
Problem 4.
Let u ^ ω , h k , p ω , h k X h × Q f h , k = 0 , 1 , , n 1 be known; in particular, let u ^ ω , h 0 consist of L 2 -projections of the initial conditions (9), (10). Find u ^ ω , h n , p ω , h n X h × Q f h , n 1 satisfying the following identities for any v ^ h , q h X h × Q f h :
Case I:  when n = 1 , 2 :
D τ α , β u ^ ω , h n 1 / 2 , v ^ h + A K ¯ ; u ^ ω , h n 1 / 2 , v ^ h B v ^ h , p ω , h n 1 / 2 + B u ^ ω , h n 1 / 2 , q h + I u ^ ω , h n 1 / 2 , v ^ h + A I i = 1 d 1 γ i , ω ; u ^ ω , h n 1 / 2 , v ^ h = f ^ ω n 1 / 2 , v ^ h ,
Case II:  when n 3 :
D τ α , β u ^ ω , h n , v ^ h + A K ¯ ; u ^ ω , h n , v ^ h B v ^ h , p ω , h n + B u ^ ω , h n , q h + A I i = 1 d 1 γ ¯ i ; u ^ ω , h n , v ^ h + A I i = 1 d 1 γ i , ω γ ¯ i ; σ u ^ ω , h n 1 , v ^ h + I σ u ^ ω , h n 1 , v ^ h + A p K ω K ¯ ; σ u ^ ω , h n 1 , v ^ h = f ^ ω n , v ^ h .
As in the original papers [3,17], the advantage of the proposed discrete scheme (29) and (30) is that the stiffness matrix is the same for all realizations ω = 1 , 2 , , N ω . When implementing the algorithm, only the right-hand sides of systems of linear algebraic equations are different. This makes it possible to use efficient methods for solving systems of equations and save computational resources. Further implementation details will be covered in Section 2.4 and Section 3.2.

2.3. Theoretical Analysis of the Numerical Method

2.3.1. Preliminaries

This section presents auxiliary results and the assumptions under which we obtain a priori estimates of the stability and convergence for the numerical scheme (29) and (30). First, let us present the following well-known inequalities, which will be used in obtaining the main results:
v I C tr v Ω f 1 / 2 v Ω f 1 / 2 , ψ I C tr ψ Ω p 1 / 2 ψ Ω p 1 / 2 ,
v Ω f C P , f v Ω f , ψ Ω p C P , p ψ Ω p ,
a b ε a 2 + 1 4 ε b 2 , a , b > 0 .
Assumption 1.
Problem 1 has a unique solution having a sufficient number of derivatives required to perform the analysis.
Assumption 2.
Let k min x and k ¯ min x be the minimum eigenvalue of tensors and vectors. Let us assume that the following conditions hold:
γ ¯ i min = min x I γ ¯ i x ,
γ ¯ i max = max x I γ ¯ i x ,
γ ¯ max = max i = 1 , 2 , , d 1 γ ¯ i max ,
γ i , ω max = max x I γ i , ω x γ ¯ i x ,
γ ω max = max i = 1 , 2 , , d 1 γ i , ω max = max i = 1 , 2 , , d 1 max x I γ i , ω x γ ¯ i x ,
κ ω , max = max x Ω p K ω K ¯ ,
μ 1 ϵ γ ¯ i max C tr C P , f μ 0 > 0 ,
where ϵ > 0 , and C tr and C P , f are constants from (31) and (32).
The following Gronwall lemma will be used several times in obtaining the main results.
Lemma 4.
Let non-negative sequences y n , z n , f n satisfy the inequalities y n f n + i = 0 n 1 z i y i . Then, the following inequality holds:
y n f n + i = 0 n 1 f i z i exp j = i + 1 n 1 z j .

2.3.2. Stability of the Numerical Scheme

Now we turn to the proof of the stability of the proposed numerical method (29) and (30) similarly to [43]. Let us first consider the case of n = 1 , 2 . The symbol C with possible subscripts will denote a generic positive constant that may take different values case by case.
Lemma 5.
Let u ^ ω , h n , p ω , h n X h × Q f h be the solution of Problem 4. Then, the following inequality holds under Assumption 2:
E α , β n + u ^ ω , h n 1 / 2 2 C α , β E α , β 0 + s = 1 n f ^ f , ω s 1 / 2 2 , n = 1 , 2 ,
which implies the stability of the numerical method (29) and (30) with respect to the initial data and the right-hand sides of the equations on the first two time layers, where
E α , β n = τ α u ω , h n Ω f 2 + τ β ϕ ω , h n Ω p 2 ,
and C α , β is a positive constant that only depends on the orders of fractional derivatives, α and β.
Proof. 
Choose v ^ h , q h = u ^ ω , h n 1 / 2 , p ω , h n 1 / 2 in the identity (29) to obtain
D τ α , β u ^ ω , h n 1 / 2 , u ^ ω , h n 1 / 2 + A K ¯ ; u ^ ω , h n 1 / 2 , u ^ ω , h n 1 / 2 + A I i = 1 d 1 γ i , ω ; u ^ ω , h n 1 / 2 , u ^ ω , h n 1 / 2
I u ^ ω , h n 1 / 2 , u ^ ω , h n 1 / 2 = f ^ ω n 1 / 2 , u ^ ω , h n 1 / 2 .
Let us estimate the terms of (41). Due to the expansion (19) and the notation (25), the first term on the left-hand side of (41) is estimated as
D τ α , β u ^ ω , h 1 / 2 , u ^ ω , h 1 / 2 = 1 2 Δ ¯ τ α u ω , h 1 , u ω , h 1 / 2 Ω f + g S Δ ¯ τ β ϕ ω , h 1 , ϕ ω , h 1 / 2 Ω p
= 1 4 τ α δ ¯ 1 , 1 α ς ¯ 0 α u ω , h 1 Ω f 2 u ω , h 0 Ω f 2 + g S τ β δ ¯ 1 , 1 β ς ¯ 0 β ϕ ω , h 1 Ω p 2 ϕ ω , h 0 Ω p 2
and
D τ α , β u ^ ω , h 3 / 2 , u ^ ω , h 3 / 2 = 1 2 Δ ¯ τ α u ω , h 2 , u ω , h 3 / 2 Ω f + Δ ¯ τ α u ω , h 1 , u ω , h 3 / 2 Ω f
+ 1 2 g S Δ ¯ τ β ϕ ω , h 2 , ϕ ω , h 3 / 2 Ω p + g S Δ ¯ τ β ϕ ω , h 1 , ϕ ω , h 3 / 2 Ω p
= τ α 4 ς ¯ 0 α δ ¯ 2 , 2 α u ω , h 2 u ω , h 1 , u ω , h 2 + u ω , h 1 Ω f + δ ¯ 2 , 1 α + δ ¯ 1 , 1 α u ω , h 1 u ω , h 0 , u ω , h 3 / 2 Ω f
+ g S τ β 4 ς ¯ 0 β δ ¯ 2 , 2 β ϕ ω , h 2 ϕ ω , h 1 , ϕ ω , h 2 + ϕ ω , h 1 Ω p + δ ¯ 2 , 1 β + δ ¯ 1 , 1 β ϕ ω , h 1 ϕ ω , h 0 , ϕ ω , h 3 / 2 Ω p
τ α 4 ς ¯ 0 α 1 2 δ ¯ 2 , 2 α u ω , h 2 Ω f 2 C α u ω , h 1 Ω f 2 + u ω , h 0 Ω f 2
+ g S τ β 4 ς ¯ 0 β 1 2 δ ¯ 2 , 2 β ϕ ω , h 2 Ω p 2 C β ϕ ω , h 1 Ω f 2 ϕ ω , h 0 Ω f 2 ,
where C ν is a positive constant depending only on ν . For the second term on the left-hand side of (41) we have:
A K ¯ ; u ^ ω , h n 1 / 2 , u ^ ω , h n 1 / 2 μ u ω , h n 1 / 2 Ω f 2 + g k min ϕ ω , h n 1 / 2 Ω p 2 .
Further, by virtue of Assumption 2, relation (14), and inequalities (31) and (32), we arrive at the inequality
A I i = 1 d 1 γ i , ω ; u ^ ω , h n 1 / 2 , u ^ ω , h n 1 / 2 μ γ ¯ i max i = 1 d 1 u ω , h n 1 / 2 · m i I 2 μ γ ¯ i max u ω , h n 1 / 2 I 2 μ γ ¯ i max C tr C P , f u ω , h n 1 / 2 Ω f 2 .
Finally, using (32) and (33) yields
f ^ ω n 1 / 2 , u ^ ω , h n 1 / 2 C P , f f f , ω n 1 / 2 Ω f u ω , h n 1 / 2 Ω f + C P , p g f p , ω n 1 / 2 Ω p ϕ ω , h n 1 / 2 Ω p
ϵ μ u ω , h n 1 / 2 Ω f 2 + ϵ g k min ϕ ω , h n 1 / 2 Ω p 2 + C 1 f f , ω n 1 / 2 Ω f 2 + f p , ω n 1 / 2 Ω p 2 ,
where ϵ is a sufficiently small number and C 1 is a constant depending on the domains Ω f and Ω p .
Making use of the inequalities (42)–(46) and Assumption (40), we obtain from the identity (41) that
τ α u ω , h 1 Ω f 2 + τ β ϕ ω , h 1 Ω p 2 + u ^ ω , h 1 / 2 2
+ C α , β τ α u ω , h 0 Ω f 2 + τ β ϕ ω , h 0 Ω p 2 + f f , ω 1 / 2 Ω f 2 + f p , ω 1 / 2 Ω p 2
and
τ α u ω , h 2 Ω f 2 + τ β ϕ ω , h 2 Ω f 2 + u ^ ω , h 3 / 2 2 τ α u ω , h 1 Ω f 2 + τ β ϕ ω , h 1 Ω f 2
+ τ α u ω , h 0 Ω f 2 + τ β ϕ ω , h 0 Ω f 2 + C α , β f f , ω 3 / 2 Ω f 2 + f p , ω 3 / 2 Ω p 2 .
By estimating the first two terms on the right-hand side of (48) with the use of inequality (47), we obtain
τ α u ω , h 2 Ω f 2 + τ β ϕ ω , h 2 Ω f 2 + u ^ ω , h 3 / 2 2
C α , β τ α u ω , h 0 Ω f 2 + τ β ϕ ω , h 0 Ω f 2 + s = 1 2 f f , ω s 1 / 2 Ω f 2 + f p , ω s 1 / 2 Ω p 2 .
Thus, combining (47) and (49) yields the assertion of the lemma.    □
Before we obtain the main result, let us prove the following auxiliary lemma that will be used while estimating the terms with fractional derivatives in the case of n 3 .
Lemma 6.
The following inequality holds for the bilinear form D τ α , β u ^ n , u ^ n , n 3 :
D τ α , β u ^ n , u ^ n τ α u n Ω f 2 χ α s = 1 n δ n , n s α u n s Ω f 2 + τ β ϕ n Ω p 2 χ β s = 1 n δ n , n s β ϕ n s Ω p 2 ,
where χ α = λ 0 α 2 2 ς 0 α λ 0 α ς 0 α , χ β = g S λ 0 β 2 2 ς 0 β g S λ 0 β ς 0 β .
Proof. 
Choose v ^ = u ^ n in (21) and use the expansion (18) to obtain
D τ α , β u ^ n , u ^ n = λ 0 α τ α ς 0 α u n s = 1 n δ n , n s α u n s , u n Ω f + g S λ 0 β τ β ς 0 β ϕ n s = 1 n δ n , n s β ϕ n s , ϕ n Ω p .
Further, applying the Cauchy inequality and the inequality (33) yields
D τ α , β u ^ n , u ^ n λ 0 α τ α ς 0 α u n Ω f 2 1 4 ε α s = 1 n δ n , n s α u n s Ω f 2 ε α u n Ω f 2 s = 1 n δ n , n s α
+ g S λ 0 β τ β ς 0 β ϕ n Ω p 2 1 4 ε β s = 1 n δ n , n s β ϕ n s Ω p 2 ε β ϕ n Ω p 2 s = 1 n δ n , n s β .
Since it follows from Lemma 2 that δ n , s ν > 0 for s n 2 , and δ n , n 2 ν < 1 2 , it is easy to see that s = 1 n δ n , n s ν < 2 . In this case, it suffices to choose ε α = 1 2 1 ς 0 α λ 0 α , ε β = 1 2 1 ς 0 β g S λ 0 β in (51) to obtain an assertion of the lemma.    □
Now we are ready to prove the stability of the proposed numerical method.
Theorem 1.
Let u ^ ω , h n , p ω , h n X f h × Q p h be the solution of Problem 4. Then, the following inequality holds under Assumption 2:
E α , β n + u ^ ω , h n 2 C α , β E α , β 0 + s = 0 n f ^ f , ω s 2 , n 1 ,
which implies the stability of the numerical method with respect to the initial data and the right-hand sides of Equations (1) and (4), where
E α , β n = τ α u ω , h n Ω f 2 + τ β ϕ ω , h n Ω p 2 ,
and C α , β is a positive constant that only depends on the orders of fractional derivatives, α and β.
Proof. 
Choose v ^ h , q h = u ^ ω , h n , p ω , h n in the identity (30) to obtain
k = 1 7 T k D τ α , β u ^ ω , h n , u ^ ω , h n + A K ¯ ; u ^ ω , h n , u ^ ω , h n + A I i = 1 d 1 γ ¯ i ; u ^ ω , h n , u ^ ω , h n + A I i = 1 d 1 γ i , ω γ ¯ i ; σ u ^ ω , h n 1 , u ^ ω , h n I σ u ^ ω , h n 1 , u ^ ω , h n + A p K ω K ¯ ; σ u ^ ω , h n 1 , u ^ ω , h n f ^ ω , h n , u ^ ω , h n = 0 .
Let us estimate the terms T 1 , T 2 , …, T 7 similarly to Lemma 5 with the use of Lemma 6, Assumption 2, and inequalities (31)–(33):
T 1 τ α u ω , h n Ω f 2 χ α s = 1 n δ n , n s α u ω , h n s Ω f 2 + τ β ϕ ω , h n Ω p 2 χ β s = 1 n δ n , n s β ϕ ω , h n s Ω p 2 ,
T 2 μ u ω , h n Ω f 2 + g k min ϕ ω , h n Ω p 2 ,
T 3 μ γ ¯ max C tr C P , f u ω , h n Ω f 2 ,
T 4 + T 5 μ γ ω max i = 1 d 1 I σ u ω , h n 1 · m i u ω , h n · m i d s + g σ ϕ h n 1 I u ω , h n · n f I + g ϕ h n I σ u ω , h n 1 · n f I μ γ ω max σ u ω , h n 1 I u ω , h n I + g σ ϕ h n 1 I u ω , h n I + g ϕ h n I σ u ω , h n 1 I μ ϵ 2 C tr C P , f u ω , h n I 2 + g k min ϵ 3 C tr C P , p ϕ h n I + C σ u ω , h n 1 I 2 + C σ u ω , h n 1 I 2 + σ ϕ ω , h n 1 I 2 1 2 μ ϵ u ω , h n Ω f 2 + 1 3 g k min ϵ ϕ h n Ω p 2 + C s = n 3 n 1 u ^ ω , h s 2 ,
T 6 g Ω p κ ω x σ ϕ ω , h n 1 2 ϕ ω , h n 2 d x C σ ϕ ω , h n 1 Ω p ϕ ω , h n Ω p C s = n 3 n 1 ϕ ω , h s Ω p 2 + 1 3 ϵ g k min ϕ ω , h n Ω p 2 ,
T 7 f f , ω n Ω f u ω , h n Ω f + g f p , ω n Ω p ϕ ω , h n Ω p 1 2 μ ϵ u ω , h n Ω f 2 + 1 3 ϵ g k min ϕ ω , h n Ω p 2 + C f ^ ω n 2 ,
where | · | 2 denotes the two-norm of a vector.
Then, taking into account the obtained inequalities, we obtain from (52) that
τ α u ω , h n Ω f 2 + τ β ϕ ω , h n Ω p 2 + μ 1 ϵ γ ¯ max C tr C P , f u ω , h n Ω f 2
+ g k min 1 ϵ ϕ ω , h n Ω p 2 τ α χ α s = 1 n δ n , n s α u ω , h n s Ω f 2
+ τ β χ β s = 1 n δ n , n s β ϕ ω , h n s Ω p 2 + C s = n 3 n 1 u ^ ω , h s 2 + C f ^ ω n 2 .
Given the assumption (40), it follows that
τ α u ω , h n Ω f 2 + τ β ϕ ω , h n Ω p 2 + u ^ ω , h n 2
C α , β s = 0 n 1 δ n , s α τ α u ω , h s Ω f 2 + τ β ϕ ω , h s Ω p 2
+ C α , β s = n 3 n 1 δ n , s α u ^ ω , h s 2 + C f ^ ω n 2 ,
where C α , β is a positive constant depending on constants c α , β = max max 1 s n δ n , s α δ n , s β , 1 and c α = max max 1 s 3 1 δ n , n s α , 1 . Further, by estimating the terms u ω , h s Ω f 2 and ϕ ω , h s Ω p 2 for s = 1 , 2 with the use of Lemma 5, we conclude that
τ α u ω , h n Ω f 2 + τ β ϕ ω , h n Ω p 2 + u ^ ω , h n 2
C α , β s = 3 n 1 δ n , s α τ α u ω , h s Ω f 2 + τ β ϕ ω , h s Ω p 2 + u ^ ω , h s 2
+ C α τ α u ω , h 0 Ω f 2 + C β τ β ϕ ω , h 0 Ω p 2 + C f ^ ω n 2 + s = 1 2 f ^ ω n 1 / 2 2 .
Therefore, by virtue of Lemma 4, we obtain the assertion of the theorem.    □

2.3.3. Convergence of the Numerical Scheme

Consider the projection operators Φ h : Q p Q p h , Π h : X f X f h , Ξ h : Q f Q f h satisfying the identities
ψ Φ h ψ , ψ h = 0 , ψ h Q p h ,
· v Π h v , q h = 0 , q h Q f h ,
· v h , q h Ξ h q h = 0 , v h X f h .
Let us introduce the notation
u ω n u ω , h n = u ω n Π h u ω n + Π h u ω n u ω , h n = ξ u n + θ u n , p ω n p ω , h n = p ω n Ξ h p ω n + Ξ h p ω n p ω , h n = ξ p n + θ p n , ϕ ω n ϕ ω , h n = ϕ ω n Φ h ϕ ω n + Φ h ϕ ω n ϕ ω , h n = ξ ϕ n + θ ϕ n ,
where the subscript ω is temporarily omitted.
To increase the convergence order in the time variable on the first and second time layers, a smaller time step in the intervals 0 , t 1 and t 1 , t 2 is chosen. Specifically, assuming that L is the smallest integer such that L τ 2 ν 4 , we introduce the substep τ 1 such that
τ 1 = τ L = τ 6 ν 4 ν ,
where ν = max α , β .
Let us first consider the case of n = 1 , 2 .
Lemma 7.
Let u ω , h n , p ω , h n , ϕ ω , h n X f h × Q f h × Q p h be the solution of Problem 4, and u ω n , p ω n , ϕ ω n X f × Q f × Q p be the solution of Problem 3. Then, the following estimate holds for n = 1 , 2 under Assumptions 1 and 2:
u ω n u ω , h n Ω f 2 + ϕ ω n ϕ ω , h n Ω p 2 + τ 6 ν 1 ν 1 2 4 ν 1 u ω n 1 / 2 u ω , h n 1 / 2 Ω f 2
+ τ 6 ν 1 ν 1 2 4 ν 1 ϕ ω n 1 / 2 ϕ ω , h n 1 / 2 Ω p 2
C α , β τ 6 ν 1 ν 1 2 4 ν 1 h 2 l + 1 + h 2 m + 1 + h 2 l + 2 + h 2 m + 2 + τ 6 ν 1 ,
where ν 1 = max α , β and l and m are defined in (28).
Proof. 
Consider the difference between the identities (26) and (29) with the substep τ 1 . Then, use the notation (57) and choose v h , q h , ψ h = θ u n 1 / 2 , θ p n 1 / 2 , θ ϕ n 1 / 2 to obtain
Δ ¯ τ 1 α θ u n 1 / 2 , θ u n 1 / 2 Ω f + g S Δ ¯ τ 1 β θ ϕ n 1 / 2 , θ ϕ n 1 / 2 Ω p + μ θ u n 1 / 2 , θ u n 1 / 2 Ω f + g K ω θ ϕ n 1 / 2 , θ ϕ n 1 / 2 Ω p + μ i = 1 d 1 I γ i , ω θ u n 1 / 2 · m i 2 d s = Δ ¯ τ 1 α ξ u n 1 / 2 , θ u n 1 / 2 Ω f g S Δ ¯ τ 1 β ξ ϕ n 1 / 2 , θ ϕ n 1 / 2 Ω p + H I ξ u n 1 / 2 , θ ϕ n 1 / 2 H I θ u n 1 / 2 , ξ ϕ n 1 / 2 + H I θ u n 1 / 2 , r 2 n 1 / 2 + H I r 4 n 1 / 2 , θ ϕ n 1 / 2 μ i = 1 d 1 I γ i , ω ξ u n 1 / 2 · m i θ u n 1 / 2 · m i d s + r 11 n 1 / 2 , θ u n 1 / 2 Ω f + r 12 n 1 / 2 , θ ϕ n 1 / 2 Ω p + g K ω r 5 n 1 / 2 , θ ϕ n 1 / 2 Ω p + μ i = 1 d 1 I γ i , ω r 3 n 1 / 2 · m i θ u n 1 / 2 · m i d s .
Estimate the terms in (59) using the technique applied in Lemma 5. For the first and second terms on the left-hand side of (59), we have:
Δ ¯ τ 1 α θ u 1 / 2 , θ u 1 / 2 Ω f + g S Δ ¯ τ 1 β θ ϕ 1 / 2 , θ ϕ 1 / 2 Ω p = 1 4 τ 1 α δ ¯ 1 , 1 α ς ¯ 0 α θ u 1 Ω p 2 + τ 1 β δ ¯ 1 , 1 β ς ¯ 0 β g S θ ϕ 1 Ω p 2 ,
Δ ¯ τ 1 α θ u 3 / 2 , θ u 3 / 2 Ω f + g S Δ ¯ τ 1 β θ ϕ 3 / 2 , θ ϕ 3 / 2 Ω p
τ 1 α 8 ς ¯ 0 α δ ¯ 2 , 2 α θ u 2 Ω f 2 C α θ u 1 Ω f 2 + g S τ 1 β 8 ς ¯ 0 β δ ¯ 2 , 2 β θ ϕ 2 Ω p 2 C β θ ϕ 1 Ω p 2 .
For the third, fourth, and fifth terms, we have:
μ θ u n 1 / 2 , θ u n 1 / 2 Ω f + g K ω θ ϕ n 1 / 2 , θ ϕ n 1 / 2 Ω p
μ θ u n 1 / 2 Ω f 2 + g k min θ ϕ n 1 / 2 Ω p 2 ,
μ i = 1 d 1 I γ i , ω θ u n 1 / 2 · m i 2 d s μ γ ¯ i max C tr C P , f θ u n 1 / 2 Ω f 2 .
Considering that ξ u 0 = 0 and ξ ϕ 0 = 0 , the first term on the right-hand side of (59) is estimated as follows:
Δ ¯ τ 1 α ξ u 1 / 2 , θ u 1 / 2 Ω f g S Δ ¯ τ 1 β ξ ϕ 1 / 2 , θ ϕ 1 / 2 Ω p
ϵ τ 1 α δ ¯ 1 , 1 α 4 ς ¯ 0 α θ u 1 Ω f 2 + ϵ τ 1 β g S δ ¯ 1 , 1 β 4 ς ¯ 0 β θ ϕ 1 Ω p 2 + C α τ 1 α ξ u 1 Ω f 2 + C β τ 1 β ξ ϕ 1 Ω p 2 ,
Δ τ α ξ u 3 / 2 , θ u 3 / 2 Ω f g S Δ τ β ξ ϕ 3 / 2 , θ ϕ 3 / 2 Ω p
ϵ δ ¯ 2 , 2 α τ 1 α 8 ς ¯ 0 α θ u 2 Ω f 2 + ϵ δ ¯ 2 , 2 α τ 1 α 8 ς ¯ 0 α θ u 1 Ω f 2 + C α τ 1 α s = 1 2 ξ u s Ω f 2
+ g S ϵ δ ¯ 2 , 2 β τ 1 β 8 ς ¯ 0 β θ ϕ 2 Ω p 2 + g S ϵ δ ¯ 2 , 2 β τ 1 β 8 ς ¯ 0 β θ ϕ 1 Ω p 2 + C β τ 1 β s = 1 2 ξ ϕ s Ω p 2 .
The remaining terms are estimated as follows:
H I ξ u n 1 / 2 , θ ϕ n 1 / 2 H I θ u n 1 / 2 , ξ ϕ n 1 / 2 + H I θ u n 1 / 2 , r 2 n 1 / 2 + H I r 4 n 1 / 2 , θ ϕ n 1 / 2
2 ϵ μ θ u n 1 / 2 Ω f 2 + 2 ϵ g k min θ ϕ n 1 / 2 Ω p 2
+ C ξ u n 1 / 2 Ω f ξ u n 1 / 2 Ω f + ξ ϕ n 1 / 2 Ω p ξ ϕ n 1 / 2 Ω p
+ C r 2 n 1 / 2 Ω p r 2 n 1 / 2 Ω p + r 4 n 1 / 2 Ω f r 4 n 1 / 2 Ω f ,
μ i = 1 d 1 I γ i , ω ξ u n 1 / 2 · m i θ u n 1 / 2 · m i d s C ξ u n 1 / 2 Ω f ξ u n 1 / 2 Ω f + ϵ μ θ u n 1 / 2 Ω f 2 ,
r 11 n 1 / 2 , θ u n 1 / 2 Ω f C r 11 n 1 / 2 Ω f 2 + ϵ μ θ u n 1 / 2 Ω f 2 ,
r 12 n 1 / 2 , θ ϕ n 1 / 2 Ω p C r 12 n 1 / 2 Ω p 2 + ϵ g k min θ ϕ n 1 / 2 Ω p 2 ,
g K ω r 5 n 1 / 2 , θ ϕ n 1 / 2 Ω p C r 5 n 1 / 2 Ω p 2 + ϵ g k min θ ϕ n 1 / 2 Ω p 2 ,
μ i = 1 d 1 I γ i , ω r 3 n 1 / 2 · m i θ u n 1 / 2 · m i d s C r 3 n 1 / 2 Ω f 2 + ϵ μ θ u n 1 / 2 Ω f 2 .
By taking into account the obtained inequalities and approximation properties (28), we obtain after elementary transformations that
τ 1 α θ u 1 Ω f 2 + τ 1 β θ ϕ 1 Ω p 2 + θ u 1 / 2 Ω f 2 + θ ϕ 1 / 2 Ω p 2
C α , β τ 1 α h 2 l + 2 + τ 1 β h 2 m + 2 + h 2 l + 1 + h 2 m + 1 + τ 1 4 2 α + τ 1 4 2 β
and
τ 1 α θ u 2 Ω f 2 + τ 1 β θ ϕ 2 Ω p 2 + θ u 3 / 2 Ω f 2 + θ ϕ 3 / 2 Ω p 2
C α , β τ 1 α θ u 1 Ω f 2 + τ 1 β θ ϕ 1 Ω p 2 + h 2 m + 1 + h 2 l + 1 + τ 1 α h 2 l + 2
+ C α , β τ 1 β h 2 m + 2 + τ 1 4 2 α + τ 1 4 2 β .
Combining the estimates (60) and (61) yields
θ u n Ω f 2 + θ ϕ n Ω p + τ 1 ν 1 θ u n 1 / 2 Ω f 2 + θ ϕ n 1 / 2 Ω p 2
C α , β τ 1 ν 1 h 2 l + 1 + h 2 m + 1 + h 2 l + 2 + h 2 m + 2 + τ 1 4 ν 1 ,
where ν 1 = max α , β . Finally, taking into account the relation (58), we obtain the assertion of the lemma.    □
We now prove the main result of this section.
Theorem 2.
Suppose that 0 < α β < 1 and denote ν = β α . Let u ω , h n , p ω , h n , ϕ ω , h n X f h × Q f h × Q p h be the solution of Problem 4, and u ω n , p ω n , ϕ ω n X f × Q f × Q p be the solution of Problem 3, n 1 . Then, the following estimate is valid under Assumptions 1 and 2:
τ ν u ω n u ω , h n Ω f 2 + ϕ ω n ϕ ω , h n Ω p 2 + τ β u ω n 1 / 2 u ω , h n 1 / 2 Ω f 2
+ τ β ϕ ω n 1 / 2 ϕ ω , h n 1 / 2 Ω p 2 C α , β τ 2 β 5 2 β 4 β h 2 m + 1 + h 2 l + 1 + τ ν 1 h 2 l + 2
+ C α , β τ 1 h 2 m + 2 + τ β h 2 l + τ β h 2 m + τ 6 2 α + β + τ 6 β ,
which implies the convergence of the approximate solution to the solution of the differential problem, where l and m are defined in (28). In the case of 0 < β α < 1 and ν 1 = α β :
u ω n u ω , h n Ω f 2 + τ ν 1 ϕ ω n ϕ ω , h n Ω p 2 + τ α u ω n 1 / 2 u ω , h n 1 / 2 Ω f 2
+ τ α ϕ ω n 1 / 2 ϕ ω , h n 1 / 2 Ω p 2 C α , β τ 2 α 5 2 α 4 α h 2 m + 1 + h 2 l + 1 + τ ν 1 1 h 2 l + 2
+ C α , β τ 1 h 2 m + 2 + τ α h 2 l + τ α h 2 m + τ 6 + α 2 β + τ 6 α .
Proof. 
Subtract (30) from (27), use the notation (57), then take v h , q h , ψ h = θ u n , θ p n , θ ϕ n to obtain
Δ τ α θ u n , θ u n Ω f + g S Δ τ β θ ϕ n , θ ϕ n Ω p + μ θ u n , θ u n Ω f + g K ¯ θ ϕ n , θ ϕ n Ω p + μ i = 1 d 1 I γ ¯ i θ u n · m i θ u n · m i d s + H I θ u n , 3 θ ϕ n 1 3 θ ϕ n 2 + θ ϕ n 3 H I 3 θ u n 1 3 θ u n 2 + θ u n 3 , θ ϕ n + μ i = 1 d 1 I γ i , ω γ ¯ i 3 θ u n 1 3 θ u n 2 + θ u n 3 · m i θ u n · m i d s + g K ω K ¯ 3 θ ϕ n 1 3 θ ϕ n 2 + θ ϕ n 3 , θ ϕ n Ω p = Δ τ α ξ u n , θ u n Ω f g S Δ τ β ξ ϕ n , θ ϕ n Ω p + H I 3 ξ u n 1 3 ξ u n 2 + ξ u n 3 , θ ϕ n H I θ u n , 3 ξ ϕ n 1 3 ξ ϕ n 2 + ξ ϕ n 3 + μ i = 1 d 1 I γ i , ω γ ¯ i 3 ξ u n 1 3 ξ u n 2 + ξ u n 3 · m i θ u n · m i d s g K ω K ¯ 3 ξ ϕ n 1 3 ξ ϕ n 2 + ξ ϕ n 3 , θ ϕ n Ω p μ i = 1 d 1 I γ ¯ i ξ u n · m i θ u n · m i d s + r 12 n , θ ϕ n Ω p + H I r 4 n , θ ϕ n + H I θ u n , r 2 n + g K ω K ¯ r 5 n , θ ϕ n Ω p + r 11 n , θ u n Ω f + μ i = 1 d 1 I γ i , ω γ ¯ i r 3 n · m i θ u n · m i d s .
Let us estimate the terms in (64). By using the technique applied in Lemma 7, one obtains
τ α 1 ϵ θ u n Ω f 2 + τ β 1 ϵ θ ϕ n Ω p 2
+ μ 1 η ¯ max C tr C P , f 7 ϵ θ u n Ω f 2 + g k min 1 7 ϵ θ ϕ n Ω p 2
τ α χ α s = 1 n δ n , n s α θ u n s Ω f 2 + τ β χ β s = 1 n δ n , n s β θ ϕ n s Ω p 2
+ C s = n 3 n 1 θ u s Ω f 2 + θ ϕ s Ω p 2 + C α τ α s = 0 n ξ u s Ω f 2 + C β τ β s = 0 n ξ ϕ s Ω p 2
+ C s = n 3 n 1 ξ u s Ω f 2 + C s = n 3 n 1 ξ ϕ s Ω p 2 + C ξ u n Ω f ξ u n Ω f
+ C r 11 n Ω f 2 + r 12 n Ω p 2 + r 2 n Ω p 2 + r 3 n Ω f 2 + r 4 n Ω f 2 + r 5 n Ω p 2 .
Applying Assumption (40) and using the technique similarly to obtaining inequality (53), we arrive at the inequality
τ α θ u n Ω f 2 + τ β θ ϕ n Ω p 2 + θ u n Ω f 2 + θ ϕ n Ω p 2
C α , β s = 0 2 δ n , s α τ α θ u s Ω f 2 + τ β θ ϕ s Ω p 2
+ C α , β s = 3 n 1 δ n , s α τ α θ u s Ω f 2 + τ β θ ϕ s Ω p 2 + θ u s Ω f 2 + θ ϕ s Ω p 2
+ C α , β τ α 1 h 2 l + 2 + τ β 1 h 2 m + 2 + h 2 l + h 2 m + τ 6 2 α + τ 6 2 β .
By utilizing the result of Lemma 7 and taking into account the fact that α β , we obtain
τ α θ u n Ω f 2 + τ β θ ϕ n Ω p 2 + θ u n Ω f 2 + θ ϕ n Ω p 2
C α , β s = 3 n 1 δ n , s α τ α θ u s Ω f 2 + τ β θ ϕ s Ω p 2 + θ u s Ω f 2 + θ ϕ s Ω p 2
+ C α , β τ 6 β β 2 4 β h 2 m + 1 + h 2 l + 1 + τ α 1 h 2 l + 2 + τ β 1 h 2 m + 2 + h 2 l + h 2 m + τ 6 2 α + τ 6 2 β .
Finally, applying Lemma 4, we obtain
τ α θ u n Ω f 2 + τ β θ ϕ n Ω p 2 + θ u n Ω f 2 + θ ϕ n Ω p 2
C α , β τ 6 β β 2 4 β h 2 m + 1 + h 2 l + 1 + τ α 1 h 2 l + 2 + τ β 1 h 2 m + 2 + h 2 l + h 2 m + τ 6 2 α + τ 6 2 β ,
which implies the estimate (62). Inequality (63) is proved in a similar way.    □

2.4. Implementation of the Discrete Scheme

Assume that the permeability tensor K ω , fractional derivative orders α , β , initial data u 0 , ω , ϕ 0 , ω , functions S , f f , ω , f p , ω , constants μ , α BJS , and discretization parameter τ are known. Let us present the following Algorithm 1 for solving the ω th realization of the discrete scheme (29) and (30).
Algorithm 1. Implementation of the ω th realization.
1. For the first n = 1 and second n = 2 time layers:
1.1. Introduce subtime layers t n , k = n τ + k τ 1 , k = 0 , 1 , , L , n = 0 , 1 within the time intervals 0 , t 1 and t 1 , t 2 according to (58).
1.2. Calculate the coefficients δ ¯ n , s ν , ν α , β , s = 1 , 2 , , n for the current n.
1.3. Find velocity u ω , h n X f and pressure p ω , h n Q f in Ω f according to (29) with v ^ h = v h , 0 , or equivalently,
τ α δ ¯ n , n α ς ¯ 0 α u ω , h n , v h Ω f + μ u ω , h n , v h Ω f + c I v h , ϕ ω , h n μ i = 1 d 1 I η i , ω u ω , h n · m i v h · m i d s p ω , h n , · v h Ω f τ α δ ¯ n , n α ς ¯ 0 α u ω , h n 1 , v h Ω f + τ α ς ¯ 0 α s = 1 n 1 δ ¯ n , s α + δ ¯ n , s + 1 α u ω , h s u ω , h s 1 , v h Ω f + μ u ω , h n 1 , v h Ω f + c I v h , ϕ ω , h n 1 p ω , h n 1 , · v h Ω f μ i = 1 d 1 I η i , ω u ω , h n 1 · m i v h · m i d s = 2 f f , ω n 1 / 2 , v h Ω f , q h , · u ω , h n Ω f + q h , · u ω , h n 1 Ω f = 0
for all v h , q h X f × Q f .
1.4. Find piezometric head ϕ ω , h n Q p in Ω p according to (29) with v ^ h = 0 , ψ h and q h = 0 , or equivalently,
g τ β δ ¯ n , n β ς ¯ 0 β S ϕ ω , h n , ψ h Ω p + g K ω ϕ ω , h n , ψ h Ω p c I u ω , h n , ψ h + g K ω ϕ ω , h n 1 , ψ h Ω p g τ β δ ¯ n , n β ς ¯ 0 β S ϕ ω , h n 1 , ψ h Ω p c I u ω , h n 1 , ψ h + g τ β ς ¯ 0 β s = 1 n 1 δ ¯ n , s β + δ ¯ n , s + 1 β ϕ ω , h s ϕ ω , h s 1 , S ψ h Ω p = 2 g f p , ω n 1 / 2 , ψ h Ω p
for all ψ h Q p .
2. For the other time layers n = 3 , 4 , , N :
2.1. Calculate the coefficients δ n , s ν , s = 0 , 1 , , n , ν α , β , the sums
s = 1 n δ n , n s α u ω , h n s , v h Ω f and s = 1 n δ n , n s β S ϕ ω , h n s , ψ h Ω p
entering (68) and (69) below, as well as finite element functions σ u ω , h n 1 , σ ϕ ω , h n 1 .
2.2. Find u ω , h n X f and p ω , h n Q f in Ω f according to (30) with v ^ h = v h , 0 , or equivalently,
λ 0 α τ α ς 0 α u ω , h n , v h Ω f + μ u ω , h n , v h Ω f μ i = 1 d 1 Γ η ¯ i u ω , h n · m i v h · m i d s + c I v h , σ ϕ ω , h n 1 λ 0 α τ α ς 0 α s = 1 n δ n , n s α u ω , h n s , v h Ω f p ω , h n , · v h Ω f μ i = 1 d 1 Γ η i , ω η ¯ i σ u ω , h n 1 · m i v h · m i d s = f f , ω n , v h Ω f , q h , · u ω , h n Ω f = 0
for all v h , q h X f × Q f .
2.3. Find ϕ ω , h n Q p in Ω p according to (30) with v ^ h = 0 , ψ h and q h = 0 , or equivalently,
g λ 0 β τ β ς 0 β S ϕ ω , h n , ψ h Ω p + g K ¯ ϕ ω , h n , ψ h Ω p g λ 0 β τ β ς 0 β s = 1 n δ n , n s β S ϕ ω , h n s , ψ h Ω p c I σ u ω , h n 1 , ψ h + g K ω K ¯ σ ϕ ω , h n 1 , ψ h Ω p = g f p , ω n , ψ h Ω p
for all ψ h Q p .
Further implementation of the finite element method is well known (see, for example, [44]).

3. Results

3.1. Verification of the Convergence Order

In this section, we present the results of numerical experiments to illustrate their agreement with theoretical studies. The aim of the first numerical tests is to determine the relation between the empirical convergence order and the orders of fractional derivatives, as well as to compare the empirical convergence order with the theoretical convergence order obtained in Theorem 2. Consider the domains Ω f = x 1 , x 2 R 2 : 0 < x 1 < π , 1 < x 2 < 0 and Ω p = x 1 , x 2 R 2 : 0 < x 1 < π , 0 < x 2 < 1 . Consider Problem 1 in Ω ¯ = Ω ¯ f Ω ¯ p with the input data: α BJS = 10 4 , μ = 10 6 , g = S = 0.01 , K = diag k 11 , k 22 , where the right-hand sides of the equations and the initial conditions are determined from the following exact solution:
u = u 1 , u 2 , u 1 = k 22 t 6 x 1 2 π x 1 2 sin x 1 + 2 x 1 π cos x 1 + π × π 2 x 2 2 1 2 + 12 x 2 2 4 sin π x 2 + 8 π x 2 x 2 2 1 cos π x 2 , u 2 = t 6 k 22 x 1 x 1 π x 2 2 1 cos x 1 4 x 2 sin π x 2 + π x 2 2 1 cos π x 2 , p = t 6 x 1 x 1 π cos x 1 g + μ k 22 π 2 x 2 2 1 2 4 μ k 22 3 x 2 2 1 sin π x 2 8 π μ k 22 x 2 x 2 2 1 cos π x 2 , ϕ = t 6 x 1 x 1 π cos x 1 x 2 2 1 2 sin π x 2 .
Let us describe the procedure for finding the empirical convergence order of the numerical scheme. We consider a set of time discretization parameters τ i , i = 1 , 2 , shown in the first column of Table 1 and generate a finite element mesh with a diameter h i such that h i τ i . Further, we solve Problem 1 several times with the specified discretization parameters and evaluate the corresponding errors E i . The empirical convergence orders are then calculated using the formula
Θ i = log E i / E i 1 log h i / h i 1 , i = 2 , 3 ,
We employ Taylor–Hood elements in all numerical tests, which are known to satisfy the LBB condition.
The stochastic nature of the problem requires that it be solved multiple times with different input data. However, we confine ourselves to two simple cases in this section. The first case assumes that only the components of the hydraulic conductivity tensor K are random parameters. To be precise, consider a set of tensors K ω ω = 1 N ω with constant diagonal components k 11 = k 22 = k , then solve Problem 1 N ω times for each K ω . The results of calculating the errors for N ω = 3 , as well as the empirical order of convergence, are shown in Table 1.
It is assumed throughout the section that the orders of the fractional derivatives satisfy the relation β α . This is due to the fact that the influence of memory effects is usually insignificant in the domain of free fluid flow; therefore, α should be taken close to 1. A completely different situation is usually observed in a porous medium, since its properties change with time, which can significantly affect the nature of the flow in this medium [45]. Thus, we consider the case α = 0.98 and β = 0.6 for definiteness in this numerical test. For convenience, the theoretical orders of convergence predicted in Theorem 2 are given in parentheses for this choice of the parameters.
The second case assumes that only orders of fractional derivatives are random parameters. This assumption is due to the fact that the properties of media can be uncertain. More precisely, the degree of influence of memory on the process of flow cannot be determined unambiguously. Therefore, the study considers the simplest case, when the parameter α = 0.98 is fixed, and the parameter β takes on different values β ω , ω = 1 , 2 , , N ω . The corresponding calculation results are shown in Table 2.
It follows from the results of both computational experiments that the empirical convergence order is in complete agreement with the theoretical order of convergence predicted in Theorem 2.

3.2. Application of the Numerical Method to the Implementation of the Fractional-Order Stochastic Stokes–Darcy Model

In the case of the stochastic Stokes–Darcy model with integer time derivatives, it is known [3] that the assembly of the stiffness matrix is the main bottleneck of the computational process due to the need to solve the problem multiple times with random input parameters. Therefore, the well-known ensemble method significantly reduces the computational complexity of the problem, since the same stiffness matrix is used for all implementations of the ensemble.
As applied to the fractional-order generalization of the stochastic Stokes–Darcy model, this statement is not entirely valid. This is due to the fact that the evaluation of the discrete fractional derivatives (18) and (19) has a greater computational complexity than the assembly of the stiffness matrix. This complexity increases significantly with an increasing time layer number. Let us demonstrate this statement with a simple example.
Consider a set of time discretization parameters τ i equal to 1 / 10 , 1 / 20 , 1 / 40 , 1 / 80 , and 1 / 160 , generate finite element meshes such that τ i h i , then solve the problem studied in Section 3.1 with random hydraulic conductivity tensors K ω , ω = 1 , 2 , , N ω . Note that the time required for evaluation of the discrete fractional derivatives by (18) and (19), as well as the construction of finite element functions for the terms σ u h n and σ ϕ h n , took nearly 10.9 milliseconds for h τ = 1 / 10 (Table 3), which is less than 0.2% of the total CPU time. However, the calculation of the specified data on a finer grid, h τ = 1 / 160 , required approximately 76% of the total CPU time.
Therefore, we extend Algorithm 1 such that the calculation of the discrete fractional derivatives is performed simultaneously for all implementations of the ensemble before the implementation of each time layer along with the ensemble algorithm proposed in [3,17]. The extended algorithm is presented in Algorithm 2.
Algorithm 2. Implementation of the stochastic problem.
1. Set the deterministic input data of the problem μ , S , α BJS , the number of random samples N ω , as well as the mean and variance of random parameters used to generate random physical data.
2. Generate random parameters such as K ω , u 0 , ω , ϕ 0 , ω , f f , ω , and f p , ω for ω = 1 , 2 , , N ω .
3. For each sample number ω , find u ω , h n , p ω , h n , and ϕ ω , h n at the first two time layers according to Steps 1.1–1.4 of Algorithm 1.
4. For the other time layers n = 3 , 4 , , N :
4.1. Calculate in parallel the coefficients δ n , s ν , s = 0 , 1 , , n , ν α , β , the sums (67), as well as finite element functions σ u ω , h n 1 , σ ϕ ω , h n 1 for all ω = 1 , 2 , , N ω .
4.2. Compute the entries of the stiffness matrix and right-hand side for ω = 1 according to (68). Evaluate the right-hand side entries for the rest sample numbers ω = 2 , 3 , , N ω . Then solve the resulting N ω systems of equations with identical matrices.
4.3. Compute the entries of the stiffness matrix and right-hand side for ω = 1 according to (69). Evaluate the right-hand side entries for the other sample numbers ω = 2 , 3 , , N ω . Then solve the resulting N ω systems of equations with identical matrices.
As a result of Steps 4.2 and 4.3, the solution on the nth time layer is obtained for all realizations ω = 1 , 2 , , N ω .
5. Based on the obtained N ω solutions of the stochastic problem, evaluate statistical moments.
Note that Steps 4.2 and 4.3 in Algorithm 2 are also executed in parallel, since the corresponding integral identities do not depend on each other.
Now let us analyze the results of some numerical tests conducted using the presented algorithm. The numerical tests were carried out on a workstation with a 24-core Intel(R) Xeon(R) E5-2650 processor with a clock speed of 2.20 GHz and 64 GB of RAM.
We considered N ω = 1 , 2 , 5 , 10 , 50 , 100 , 500 , and 1000 samples of random permeability tensors. The discretization step was chosen to be τ = 0.1 and triangulation was generated as in Section 3.1. Firstly, the problem was solved individually for all samples without using the ensemble approach. The results of measuring the total time required to solve the problems are given in the column “Serial Algorithm” of Table 4. It can be seen that the implementation of the fractional-order stochastic Stokes–Darcy model took around 47 min for 1000 random samples.
Then, we combined the ensemble approach and the technique of parallel evaluation of the discrete fractional derivatives. It is evident from the results presented in the column “Parallel Ensemble Algorithm” of Table 4 that the calculation time reduced to nearly 7 min for the same number of samples. Thus, an almost seven-fold acceleration was achieved.

4. Discussion

Now let us make a few comments on the results obtained and outline future research directions. As far as we know, a fractional-order stochastic generalization of the Stokes–Darcy model is considered for the first time in our paper. Therefore, in the current work, the main emphasis is on the construction of an efficient finite element method for the implementation of this model. Note that the constructed method has a higher convergence order in time than in original papers [3,6] due to the use of a special approximation of fractional derivatives and some of the terms in a weak formulation. This was demonstrated on a test problem with a known exact solution. The use of the approximation formula for the fractional derivative presented in Lemma 1 did not allow achieving a higher convergence order, unlike [29,31], where the equations contained integer time derivatives. This limitation can be removed by utilizing higher-order approximations of fractional derivatives (see, for example [46]). The authors believe that this study deserves a separate paper.
Since a significant part of the paper is devoted to a theoretical study of the constructed method, little attention has been paid to the features of the fractional-order stochastic Stokes–Darcy model. In particular, in subsequent works, the authors intend to study the influence of the orders of fractional derivatives on the fluid flow pattern. In addition, it will be interesting to study the influence of the spatial fractional derivative orders on the fluid flow in fractal porous media. In a previous study [47], the authors constructed a numerical method for a model space-fractional partial differential equation and proposed a parallel algorithm for its implementation. In future papers, the authors intend to conduct a comprehensive analysis of the time–space fractional generalization of the Stokes–Darcy model and address its parallel implementation.
When implementing a parallel ensemble approach on a test example, an almost seven-fold acceleration of the calculation was obtained. This result is close to the result obtained in [3], where the ensemble approach saved a massive 88% of CPU time in a stochastic problem with integer time derivatives. In contrast to the above work, in our problem most of the CPU time is spent on calculating the discrete fractional derivative with an increase in the number of time layers and the number of degrees of freedom. In subsequent papers, parallelization issues using other parallel architectures will be considered in more detail. This will make it possible to apply the proposed numerical method to model more realistic fluid flows in the case of uncertainties based on the fractional-order stochastic model.

Author Contributions

Conceptualization, A.B. and D.B.; methodology, D.B.; software, D.B.; validation, D.B. and K.B.; formal analysis, A.B., D.B., and K.B.; investigation, D.B. and K.B.; writing—original draft preparation, D.B. and K.B.; writing—review and editing, A.B., D.B., and K.B.; visualization, D.B.; supervision, A.B. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by the Ministry of Science and Higher Education of the Republic of Kazakhstan, Grant No. AP14871299.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Yang, Z.; Li, X.; He, X.; Ming, J. A stochastic collocation method based on sparse grids for a stochastic Stokes-Darcy model. Discret. Contin. Dyn. Syst. 2022, 15, 893–912. [Google Scholar] [CrossRef]
  2. Kumar, P.; Luo, P.; Gaspar, F.J.; Oosterlee, C.W. A multigrid multilevel Monte Carlo method for transport in the Darcy–Stokes system. J. Comput. Phys. 2018, 371, 382–408. [Google Scholar] [CrossRef]
  3. Jiang, N.; Qiu, C. An efficient ensemble algorithm for numerical approximation of stochastic Stokes–Darcy equations. Comput. Methods Appl. Mech. Eng. 2019, 343, 249–275. [Google Scholar] [CrossRef]
  4. He, X.; Jiang, N.; Qiu, C. An artificial compressibility ensemble algorithm for a stochastic Stokes–Darcy model with random hydraulic conductivity and interface conditions. Int. J. Numer. Methods Eng. 2019, 121, 712–739. [Google Scholar] [CrossRef]
  5. Ambartsumyan, I.; Khattatov, E.; Wang, C.; Yotov, I. Stochastic multiscale flux basis for Stokes–Darcy flows. J. Comput. Phys. 2020, 401, 109011. [Google Scholar] [CrossRef]
  6. Jiang, N.; Qiu, C. Numerical analysis of a second order ensemble algorithm for numerical approximation of stochastic Stokes–Darcy equations. J. Comput. Appl. Math. 2022, 406, 113934. [Google Scholar] [CrossRef]
  7. Caputo, M. Models of flux in porous media with memory. Water Resour. Res. 2000, 36, 693–705. [Google Scholar] [CrossRef]
  8. Agarwal, R.; Yadav, M.P.; Baleanu, D.; Purohit, S.D. Existence and uniqueness of miscible flow equation through porous media with a non singular fractional derivative. AIMS Math. 2020, 5, 1062–1073. [Google Scholar] [CrossRef]
  9. Zhong, W.; Li, C.; Kou, J. Numerical fractional-calculus model for two-phase flow in fractured media. Adv. Math. Phys. 2013, 2013, 429835. [Google Scholar] [CrossRef]
  10. Poljak, D.; Šesnić, S.; Cvetković, M.; Šušnjara, A.; Dodig, H.; Lalléchère, S.; Drissi, K.E. Stochastic collocation applications in computational electromagnetics. Math. Probl. Eng. 2018, 2018, 1917439. [Google Scholar] [CrossRef]
  11. Xiu, D. Stochastic collocation methods: A survey. In Handbook of Uncertainty Quantification; Springer International Publishing: Cham, Switzerland, 2015; pp. 1–18. [Google Scholar]
  12. Graham, I.G.; Kuo, F.Y.; Nichols, J.A.; Scheichl, R.; Schwab, C.; Sloan, I.H. Quasi-Monte Carlo finite element methods for elliptic PDEs with lognormal random coefficients. Numer. Math. 2014, 131, 329–368. [Google Scholar] [CrossRef]
  13. Giles, M.B. Multilevel Monte Carlo methods. Acta Numer. 2015, 24, 259–328. [Google Scholar] [CrossRef]
  14. Chen, Q.; Ming, J. The multilevel Monte Carlo method for simulations of turbulent flows. Mon. Weather Rev. 2018, 146, 2933–2947. [Google Scholar] [CrossRef]
  15. Wang, X.; Ying, X.; Liu, Y.-J.; Xin, S.-Q.; Wang, W.; Gu, X.; Mueller-Wittig, W.; He, Y. Intrinsic computation of centroidal Voronoi tessellation (CVT) on meshes. Comput.-Aided Des. 2015, 58, 51–61. [Google Scholar] [CrossRef]
  16. Menčík, J. Latin hypercube sampling. In Concise Reliability for Engineers; InTech: Richardson, TX, USA, 2016. [Google Scholar]
  17. Jiang, N.; Layton, W. An algorithm for fast calculation of flow ensembles. Int. J. Uncertain. Quantif. 2014, 4, 273–301. [Google Scholar] [CrossRef]
  18. Aarnes, J.E.; Efendiev, Y. Mixed multiscale finite element methods for stochastic porous media flows. SIAM J. Sci. Comput. 2008, 30, 2319–2339. [Google Scholar] [CrossRef]
  19. Ma, X.; Zabaras, N. A stochastic mixed finite element heterogeneous multiscale method for flow in porous media. J. Comput. Phys. 2011, 230, 4696–4722. [Google Scholar] [CrossRef]
  20. Chaudhuri, A.; Sekhar, M. Stochastic finite element method for probabilistic analysis of flow and transport in a three-dimensional heterogeneous porous formation. Water Resour. Res. 2005, 41. [Google Scholar] [CrossRef]
  21. Yang, X.; Wu, L.; Zhang, H. A space-time spectral order sinc-collocation method for the fourth-order nonlocal heat model arising in viscoelasticity. Appl. Math. Comput. 2023, 457, 128192. [Google Scholar] [CrossRef]
  22. Zhang, H.; Yang, X.; Tang, Q.; Xu, D. A robust error analysis of the OSC method for a multi-term fourth-order sub-diffusion equation. Comput. Math. Appl. 2022, 109, 180–190. [Google Scholar] [CrossRef]
  23. Yang, X.; Zhang, H.; Tang, J. The OSC solver for the fourth-order sub-diffusion equation with weakly singular solutions. Comput. Math. Appl. 2021, 82, 1–12. [Google Scholar] [CrossRef]
  24. El Moutea, O.; El Amri, H.; El Akkad, A. Finite element method for the Stokes–Darcy problem with a new boundary condition. Numer. Anal. Appl. 2020, 13, 136–151. [Google Scholar] [CrossRef]
  25. Nobile, F.; Tempone, R.; Webster, C.G. An anisotropic sparse grid stochastic collocation method for partial differential equations with random input data. SIAM J. Numer. Anal. 2008, 46, 2411–2442. [Google Scholar] [CrossRef]
  26. Nobile, F.; Tempone, R.; Webster, C.G. A sparse grid stochastic collocation method for partial differential equations with random input data. SIAM J. Numer. Anal. 2008, 46, 2309–2345. [Google Scholar] [CrossRef]
  27. Shi, F.; Sun, Y.; Zheng, H. Ensemble domain decomposition algorithm for the fully-mixed random Stokes–Darcy model with the Beavers-Joseph interface conditions. SIAM J. Numer. Anal. 2023, 61, 1482–1512. [Google Scholar] [CrossRef]
  28. Li, J.; Li, R.; Zhao, X.; Chen, Z. A second-order fractional time-stepping method for a coupled Stokes/Darcy system. J. Comput. Appl. Math. 2021, 390, 113329. [Google Scholar] [CrossRef]
  29. Qin, Y.; Hou, Y. The time filter for the non-stationary coupled Stokes/Darcy model. Appl. Numer. Math. 2019, 146, 260–275. [Google Scholar] [CrossRef]
  30. Li, Y.; Hou, Y.; Layton, W.; Zhao, H. Adaptive partitioned methods for the time-accurate approximation of the evolutionary Stokes–Darcy system. Comput. Methods Appl. Mech. Eng. 2020, 364, 112923. [Google Scholar] [CrossRef]
  31. Chen, W.; Gunzburger, M.; Sun, D.; Wang, X. An efficient and long-time accurate third-order algorithm for the Stokes–Darcy system. Numer. Math. 2016, 134, 857–879. [Google Scholar] [CrossRef]
  32. Hoang, T.-T.-P.; Lee, H. A global-in-time domain decomposition method for the coupled nonlinear Stokes and Darcy flows. J. Sci. Comput. 2021, 87, 22. [Google Scholar] [CrossRef]
  33. Lee, H.; Rife, K. Least squares approach for the time-dependent nonlinear Stokes–Darcy flow. Comput. Math. Appl. 2014, 67, 1806–1815. [Google Scholar] [CrossRef]
  34. Ervin, V.J.; Jenkins, E.W.; Sun, S. Coupling nonlinear Stokes and Darcy flow using mortar finite elements. Appl. Numer. Math. 2011, 61, 1198–1222. [Google Scholar] [CrossRef]
  35. Marinca, V.; Herişanu, N.; Nemeş, I. Optimal homotopy asymptotic method with application to thin film flow. Cent. Eur. J. Phys. 2008, 6, 648–653. [Google Scholar] [CrossRef]
  36. Temimi, H.; Ansari, A.R.; Siddiqui, A.M. An approximate solution for the static beam problem and nonlinear integro-differential equations. Comput. Math. Appl. 2011, 62, 3132–3139. [Google Scholar] [CrossRef]
  37. Alhejaili, W.; Alhazmi, S.E.; Nawaz, R.; Ali, A.; Asamoah, J.K.K.; Zada, L. Numerical investigation of fractional-order Kawahara and modified Kawahara equations by a semianalytical Method. J. Nanomater. 2022, 2022, 1985572. [Google Scholar] [CrossRef]
  38. Sarwar, S.; Alkhalaf, S.; Iqbal, S.; Zahid, M.A. A note on optimal homotopy asymptotic method for the solutions of fractional order heat- and wave-like partial differential equations. Comput. Math. Appl. 2015, 70, 942–953. [Google Scholar] [CrossRef]
  39. Aripov, M.; Utebaev, D.; Nurullaev, Z. Convergence of high-precision finite element method schemes for two-temperature plasma equation. In AIP Conference Proceedings; AIP Publishing: New York, NY, USA, 2021; Volume 2325, p. 020059. [Google Scholar]
  40. Ashyralyev, A.; Okur, U. Crank-Nicolson difference scheme for a stochastic parabolic equation with a dependent operator coefficient. In AIP Conference Proceedings; AIP Publishing: New York, NY, USA, 2016; Volume 1759, p. 020103. [Google Scholar]
  41. Lv, C.; Xu, C. Error analysis of a high order method for time-fractional diffusion equations. SIAM J. Sci. Comput. 2016, 38, A2699–A2724. [Google Scholar] [CrossRef]
  42. Zhang, Y.N.; Sun, Z.Z.; Liao, H.L. Finite difference methods for the time fractional diffusion equation on non-uniform meshes. J. Comput. Phys. 2014, 265, 195–210. [Google Scholar] [CrossRef]
  43. Berdyshev, A.; Aloev, R.; Bliyeva, D.; Dadabayev, S.; Baishemirov, Z. Stability analysis of an upwind difference splitting scheme for two-dimensional Saint–Venant equations. Symmetry 2022, 14, 1986. [Google Scholar] [CrossRef]
  44. Aloev, R.D.; Eshkuvatov, Z.K.; Davlatov, S.O.; Nik Long, N.M.A. Sufficient condition of stability of finite element method for symmetric T-hyperbolic systems with constant coefficients. Comput. Math. Appl. 2014, 68, 1194–1204. [Google Scholar] [CrossRef]
  45. Beybalaev, V.D.; Abduragimov, E.I.; Yakubov, A.Z.; Meilanov, R.R.; Aliverdiev, A.A. Numerical Research of Non-Isothermal Filtration Process in Fractal Medium with Non-Locality in Time. Therm. Sci. 2021, 25, 465–475. [Google Scholar] [CrossRef]
  46. Cao, J.; Li, C.; Chen, Y. High-order approximation to Caputo derivatives and Caputo-type advection-diffusion equations (II). Fract. Calc. Appl. Anal. 2015, 18, 735–761. [Google Scholar] [CrossRef]
  47. Alimbekova, N.B.; Berdyshev, A.S.; Baigereyev, D.R. Parallel implementation of the algorithm for solving a partial differential equation with a fractional derivative in the sense of Riemann-Liouville. In Proceedings of the 2021 IEEE International Conference on Smart Information Systems and Technologies (SIST), Nur-Sultan, Kazakhstan, 28–30 April 2021. [Google Scholar] [CrossRef]
Figure 1. The integration domain Ω , consisting of the domain of free fluid flow Ω f and the domain of porous medium Ω p , separated by an interface I.
Figure 1. The integration domain Ω , consisting of the domain of free fluid flow Ω f and the domain of porous medium Ω p , separated by an interface I.
Mathematics 11 03763 g001
Table 1. L 2 errors and convergence orders obtained for random tensors K ω when α = 0.98 and β = 0.6 .
Table 1. L 2 errors and convergence orders obtained for random tensors K ω when α = 0.98 and β = 0.6 .
τ h k 11 = k 22 = 0.05 k 11 = k 22 = 0.01 k 11 = k 22 = 0.005
u 1 u 1 , h Ω f Order u 2 u 2 , h Ω f Order u 3 u 3 , h Ω f Order
1 / 5 9.4221 × 10 2 2.0260 × 10 2 1.1025 × 10 2
1 / 10 1.8790 × 10 2 2.33 2.30 4.0021 × 10 3 2.34 2.30 2.1937 × 10 3 2.33 2.30
1 / 20 3.7822 × 10 3 2.31 2.30 7.9993 × 10 4 2.32 2.30 4.3934 × 10 4 2.32 2.30
1 / 40 7.6509 × 10 4 2.31 2.30 1.6205 × 10 4 2.30 2.30 8.9009 × 10 5 2.30 2.30
τ h ϕ 1 ϕ 1 , h Ω p Order ϕ 2 ϕ 2 , h Ω p Order ϕ 3 ϕ 3 , h Ω p Order
1 / 5 4.9494 × 10 1 3.9874 × 10 1 3.4272 × 10 1
1 / 10 8.6492 × 10 2 2.52 2.49 7.0000 × 10 2 2.51 2.49 5.9839 × 10 2 2.52 2.49
1 / 20 1.5203 × 10 2 2.51 2.49 1.2358 × 10 2 2.50 2.49 1.0553 × 10 2 2.50 2.49
1 / 40 2.6973 × 10 3 2.49 2.49 2.1954 × 10 3 2.49 2.49 1.8773 × 10 3 2.49 2.49
Table 2. L 2 errors and convergence orders obtained for a fixed α = 0.98 , random parameters β ω , and k 11 = k 22 = 0.01 .
Table 2. L 2 errors and convergence orders obtained for a fixed α = 0.98 , random parameters β ω , and k 11 = k 22 = 0.01 .
τ h β 1 = 0.55 β 2 = 0.60 β 3 = 0.65
u 1 u 1 , h Ω f Order u 2 u 2 , h Ω f Order u 3 u 3 , h Ω f Order
1 / 5 1.8414 × 10 2 2.0260 × 10 2 2.2289 × 10 2
1 / 10 3.6877 × 10 3 2.32 2.28 4.0021 × 10 3 2.34 2.30 4.3719 × 10 3 2.35 2.33
1 / 20 7.4884 × 10 4 2.30 2.28 7.9993 × 10 4 2.32 2.30 8.6350 × 10 4 2.34 2.33
1 / 40 1.5442 × 10 4 2.28 2.28 1.6205 × 10 4 2.30 2.30 1.7174 × 10 4 2.33 2.33
τ h ϕ 1 ϕ 1 , h Ω p Order ϕ 2 ϕ 2 , h Ω p Order ϕ 3 ϕ 3 , h Ω p Order
1 / 5 4.0568 × 10 1 3.9874 × 10 1 3.9081 × 10 1
1 / 10 7.1219 × 10 2 2.51 2.49 7.0000 × 10 2 2.51 2.49 6.8609 × 10 2 2.51 2.49
1 / 20 1.2590 × 10 2 2.50 2.49 1.2358 × 10 2 2.50 2.49 1.2128 × 10 2 2.50 2.49
1 / 40 2.2411 × 10 3 2.49 2.49 2.1954 × 10 3 2.49 2.49 2.1589 × 10 3 2.49 2.49
Table 3. Evaluation timings of discrete fractional derivatives in the case of N ω = 10 .
Table 3. Evaluation timings of discrete fractional derivatives in the case of N ω = 10 .
τ h Degrees of Freedom
in u h n ; ϕ h n
Evaluation of δ n , s ν
and δ ¯ n , s ν
Construction of FE Functions σ u h n and σ ϕ h n Construction of FE Functions with Discrete Fractional Derivatives by (18) and (19)Total
1 / 10 2524 ; 1262 48.1 μ s3.78 ms6.98 ms10.9 ms
1 / 20 10 , 004 ; 5002 218 μ s19.5 ms618 ms638 ms
1 / 40 40 , 164 ; 20 , 082 599 μ s84.4 ms7.23 s7.32 s
1 / 80 160 , 964 ; 80 , 482 2 ms2.71 s111 s114 s
1 / 160 643 , 204 ; 321 , 602 7.55 ms37.1 s1902 s1939 s
Table 4. Discrete fractional derivative evaluation timing (in seconds) in the case of τ = 1 / 10 .
Table 4. Discrete fractional derivative evaluation timing (in seconds) in the case of τ = 1 / 10 .
N ω Serial AlgorithmParallel Ensemble AlgorithmAcceleration Rate
12.68
26.813.711.83
513.455.152.61
1024.526.513.76
50120.1528.044.28
100276.7353.455.18
5001470.68223.146.59
10002823.43419.696.73
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Berdyshev, A.; Baigereyev, D.; Boranbek, K. Numerical Method for Fractional-Order Generalization of the Stochastic Stokes–Darcy Model. Mathematics 2023, 11, 3763. https://doi.org/10.3390/math11173763

AMA Style

Berdyshev A, Baigereyev D, Boranbek K. Numerical Method for Fractional-Order Generalization of the Stochastic Stokes–Darcy Model. Mathematics. 2023; 11(17):3763. https://doi.org/10.3390/math11173763

Chicago/Turabian Style

Berdyshev, Abdumauvlen, Dossan Baigereyev, and Kulzhamila Boranbek. 2023. "Numerical Method for Fractional-Order Generalization of the Stochastic Stokes–Darcy Model" Mathematics 11, no. 17: 3763. https://doi.org/10.3390/math11173763

APA Style

Berdyshev, A., Baigereyev, D., & Boranbek, K. (2023). Numerical Method for Fractional-Order Generalization of the Stochastic Stokes–Darcy Model. Mathematics, 11(17), 3763. https://doi.org/10.3390/math11173763

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop