
In this article, we investigate some new positivity and negativity results for some families of discrete delta fractional difference operators. A basic result is an identity which will prove to be a useful tool for establishing the main results. Our first main result considers the positivity and negativity of the discrete delta fractional difference operator of the Riemann-Liouville type under two main conditions. Similar results are then obtained for the discrete delta fractional difference operator of the Liouville-Caputo type. Finally, we provide a specific example in which the chosen function becomes nonincreasing on a time set.
Citation: Pshtiwan Othman Mohammed, Hari Mohan Srivastava, Dumitru Baleanu, Ehab E. Elattar, Y. S. Hamed. Positivity analysis for the discrete delta fractional differences of the Riemann-Liouville and Liouville-Caputo types[J]. Electronic Research Archive, 2022, 30(8): 3058-3070. doi: 10.3934/era.2022155
[1] | Yanlong Zhang, Rui Zhang, Li Wang . Oblique impact dynamic analysis of wedge friction damper with Dankowicz dynamic friction. Electronic Research Archive, 2024, 32(2): 962-978. doi: 10.3934/era.2024047 |
[2] | Yang Jin, Wanxiang Li, Hongbing Zhang . Transition characteristics of the dynamic behavior of a vehicle wheel-rail vibro-impact system. Electronic Research Archive, 2023, 31(11): 7040-7060. doi: 10.3934/era.2023357 |
[3] | Junhai Ma, Hui Jiang . Dynamics of a nonlinear differential advertising model with single parameter sales promotion strategy. Electronic Research Archive, 2022, 30(4): 1142-1157. doi: 10.3934/era.2022061 |
[4] | Wenxin Zhang, Lijun Pei . Bifurcation and chaos in N-type and S-type muscular blood vessel models. Electronic Research Archive, 2025, 33(3): 1285-1305. doi: 10.3934/era.2025057 |
[5] | Qixiang Wen, Shenquan Liu, Bo Lu . Firing patterns and bifurcation analysis of neurons under electromagnetic induction. Electronic Research Archive, 2021, 29(5): 3205-3226. doi: 10.3934/era.2021034 |
[6] | Mengting Sui, Yanfei Du . Bifurcations, stability switches and chaos in a diffusive predator-prey model with fear response delay. Electronic Research Archive, 2023, 31(9): 5124-5150. doi: 10.3934/era.2023262 |
[7] | Leiting Wang, Yang Jin, Wangxiang Li, Chenyang Tang . Analysis of the nonlinear dynamic behavior of longitudinal systems in heavy-haul trains. Electronic Research Archive, 2025, 33(2): 582-599. doi: 10.3934/era.2025027 |
[8] | Weiyu Li, Hongyan Wang . Dynamics of a three-molecule autocatalytic Schnakenberg model with cross-diffusion: Turing patterns of spatially homogeneous Hopf bifurcating periodic solutions. Electronic Research Archive, 2023, 31(7): 4139-4154. doi: 10.3934/era.2023211 |
[9] | Zhili Zhang, Aying Wan, Hongyan Lin . Spatiotemporal patterns and multiple bifurcations of a reaction- diffusion model for hair follicle spacing. Electronic Research Archive, 2023, 31(4): 1922-1947. doi: 10.3934/era.2023099 |
[10] | Fengrong Zhang, Ruining Chen . Spatiotemporal patterns of a delayed diffusive prey-predator model with prey-taxis. Electronic Research Archive, 2024, 32(7): 4723-4740. doi: 10.3934/era.2024215 |
In this article, we investigate some new positivity and negativity results for some families of discrete delta fractional difference operators. A basic result is an identity which will prove to be a useful tool for establishing the main results. Our first main result considers the positivity and negativity of the discrete delta fractional difference operator of the Riemann-Liouville type under two main conditions. Similar results are then obtained for the discrete delta fractional difference operator of the Liouville-Caputo type. Finally, we provide a specific example in which the chosen function becomes nonincreasing on a time set.
In recent years, the inverse problem has aroused the research interest of scholars. Keller first proposed the concept of positive and inverse problems in [1]. Solving problems based on known data and definite solution conditions is called a positive problem (also known as a direct problem). On the contrary, problems like those of interest in this paper are called inverse problems if we solve or estimate unknown data based on measurement data. Hadamard [2] first proposed the concept of well-posedness. That is, a problem is well-posed if its solution exists and is unique and stable to the given data. If one of these is not satisfied, then the problem is ill-posed. With the study of the inverse problem, people find that the inverse problem is usually ill-posed. So, studying the solution of the inverse problem is a challenging task. The heat conduction equation is a classical mathematical physics equation, which describes the process of temperature change with time in a certain region. If we already know the initial temperature and boundary conditions of the equation, and we obtain the temperature at any time by solving the equation, this is called the forward heat conduction problem, and the forward problem is well-posed in general. In real life, since the initial temperature in the heat equation is unknown, then we have to use some conditions to obtain the initial temperature and the temperature distribution at any time. This kind of problem is called the backward heat conduction problem. For example, in the field of biomedicine, through changes in the body's perceived temperature, we can determine that a disease is occurring in one of the body's organs [3,4,5]. The BHCP is also called the final value problem [6], which is a seriously ill-posed problem [7]. Usually, there is no solution, or if there is a solution, it will be discontinuously dependent on the given data. So, it is very difficult to get its numerical solution. A specific method (called the regularization method) is required to obtain stable numerical solutions. For this reason, many scholars have done a lot of research.
The Tikhonov regularization method to solve the BHCE by W. B. Muniz et al. was proposed in [8,9]. The author transforms this inverse problem into an optimization problem. The regular term is introduced into the objective function, and a good approximation is obtained. In [10], in order to solve the inverse heat equation, the author proposes a new Tikhonov method. In [11], the Lie-group shooting method is used to numerically integrate the ordinary differential equations. S. M. Kirkup and M. Wadsworth proposed operator splitting in [12] and obtained the solution of the inverse heat equation. The Adomian decomposition method was proposed by G. Adomian, R. Grzymkowski, and M. Pleszczynski in [13,14]. In [15], a new spatiotemporal radial Trefftz collocation method was proposed to solve the inverse heat conduction problem with time-dependent source terms.
In recent years, the Fourier regularization method has been found to be highly efficient in solving inverse problems. In [16,17], Fourier regularization was applied to study the heat equation. In [18], the author studied numerical differentiation. In [19], a posterior truncation method was proposed to solve ill-posed problems. In [20,21], the author solved the Cauchy problem of Helmholtz equation by a truncation method. In [22], the authors studied the Cauchy problem of the inhomogeneous Helmholtz equation. In [23], the initial data of the BHCP with non-uniform time fraction was determined by the Fourier truncation method. In [24], a new technique for determining the truncation singular value when regularization is applied in ill-posed inverse problems is discussed. Besides, the Fourier-type inversion has been characterized in a general setting of the filter regularization operators in [25]. Other methods for solving the inverse problem of heat conduction can be found in references [26,27,28,29,30].
Although the authors in the above literature have obtained the solution of the BHCE through some regularization methods, the error estimation is basically the traditional H¨older type estimation, and the estimation at t=0 is neglected. In addition, the traditional heat conduction equation does not take into account the uncertainty of the parameters and regards the parameters as definite values, which is a big defect when we solve real-world problems. For example, in the process of the spacecraft returning to the land surface, due to the effect of aerodynamic heating of the atmosphere, the temperature of the spacecraft surface rises instantaneously with the passage of time. Therefore, we must get the surface temperature in time to ensure the safety of the astronauts. But, this temperature is often difficult to measure, and when it is measured, it is uncertain. For instance, in the high-temperature smelting furnace in the high-temperature smelting operation, we need to regularly measure the temperature of the furnace surface to ensure safety. However, due to the extremely high temperature of the furnace surface, the data measured by physical means are often uncertain. In order to deal with the uncertainty in parameters, we use fuzzy numbers to model the uncertainty in parameters and define the BHCE with uncertainty. Since the BHCE with uncertainty is a fuzzy differential equation in essence, some literature on fuzzy differential equations is introduced here for the convenience of analysis.
The theories related to fuzzy differential equations have been extensively studied, but because of the operation property of fuzzy subtraction, it is very difficult to define the derivative of fuzzy numbers, which is a great challenge. The development of derivatives of fuzzy numbers is described below.
In 1965, Zadeh proposed the concept of fuzzy sets for the first time in [31]. The fuzzy mapping function was introduced by Chang and Zadeh in [32]. In 1972, under the influence of the extension principle, Dubois et al. [33] proposed elementary fuzzy operation. The cauchy problem for fuzzy differential equations (FDEs) were studied by Kaleva in [34]. The fuzzy initial value problem was studied by Seikkala in [35]. Based on the Hukuhara derivative operation, Bade applied it to the solution of FDEs in [36]. A differential transform method to solve fuzzy partial differential equations (FPDEs) was studied by Mikaeilvand and Khakrangin in [37]. Zadeh's extension principle was applied to the solution of FDEs by M. S. Cecconello, M. Oberguggenberger et al. in [38,39]. S. Abbasbandy and M. Chen proposed solving fuzzy differential equations based on differential inclusion theory in [40,41], which forms a differential inclusion family by taking the level set of fuzzy vector fields. In [42], based on the Hukuhara derivative and the generalized Bede derivative, a fuzzy differential equation was solved by R. Agarwal and M. Chen et al. In 1997, Zadeh put forward the idea of fuzzy information granulation in [43]. In 2018, M. Mazandarani proposed a new method for solving fuzzy differential equations, namely granular differentiability, in [44]. This method overcomes the disadvantages of previous methods and makes the solution of fuzzy differential equations simple and convenient. According to our literature review, the conventional fuzzy differential equation is generally based on the μ-level set of fuzzy numbers into two crisp differential equations to obtain the solution interval. However, in this paper, we use the concept of the granular differentiability to transform the fuzzy differential equation into a granular differential equation, thus improving the efficiency of the calculation.
In this paper, we will regard the parameters in the BHCE as uncertain parameters, and define the BHCE with uncertainty. It is found that most of the papers are on the forward problem of fuzzy differential equations, while there are very few papers on the inverse problem (such as ill-posedness, regularization methods, etc). The representative studies are mainly the following articles by Gong and Yang. In [45], Gong and Yang studied fuzzy initial boundary value problems in 2015. A regularization method was proposed to restore numerical stability. In 2019, Yang and Gong first proposed the concept of ill-posedness of the first kind of the fuzzy Fredholm integral equation in [46]. In [47], Yang and Gong proposed an iterative method for solving the fuzzy integral equation. The error estimation under this method is also given.
The remaining portion of the current paper is arranged as follows. In Section 2, the basic knowledge used in this paper is given. In Section 3, the BHCE with uncertain parameters is defined and the granular representation is derived. Then, it is proved to be a seriously ill-posed equation. In Section 4, the Fourier regularization method is introduced, and the granular representation of the approximate solution is given. Under the condition of proper selection of regularization parameters, the error estimation between approximate solution and exact solution is proved. In Section 5, a numerical example is given to illustrate the feasibility and practicability of the method. Section 6 gives the conclusion of this paper and future prospects.
We stipulate that the fuzzy number space is represented by E1. For 0<μ≤1, the μ-level set of ˜u∈E1 is defined by [˜u]μ={x∈Rn|˜u(x)≥μ}.
Theorem 2.1. ([48]) If ˜u∈E1, then ˜u=⋃μ∈[0,1](μ⋅[˜u]μ).
Definition 2.2. ([44]) Let ˜u:[a,b]⊆Rn→[0,1] be a fuzzy number. The horizontal membership function ugr:[0,1]×[0,1]→[a,b] is a representation of ˜u(x) as ugr(μ,αu)=x in which "gr" stands for the granule of information included in x∈[a,b],μ∈[0,1] is the membership degree of x in ˜u(x),αu∈[0,1] is called relative-distance-measure (RDM) variable, and ugr(μ,αu)=u_μ+(¯uμ−u_μ)αu.
By definition, for fuzzy numbers ˜u=(a,b,c), we have H(˜u)=[a+(b−a)μ]+[(1−μ)(c−a)]αu.
Remark 2.3. ([44]) The horizontal membership function of ˜u(x)∈E1 is also denoted by H(˜u(x))=ugr(μ,αu). Moreover, using
H−1(ugr(μ,αu))=[˜u]μ=[infβ≥μminαuugr(β,αu),supβ≥μmaxαuugr(β,αu)], | (2.1) |
the μ-level sets of the vertical membership function of ˜u(x), which is in fact the span of the information granule, can be obtained.
Example 2.4. For ˜μ=(2,3,5,6)∈E1,
˜μ(x)={x−2,x∈[2,3),1,x∈[3,5],−x+6,x∈(5,6],0,otherwise. | (2.2) |
Figure 1 shows its horizontal membership function.
Definition 2.5. ([44]) Two fuzzy numbers ˜u and ˜v are said to be equal if and only if H(˜u)=H(˜v) for all αu=αv∈[0,1], and μ∈[0,1].
Definition 2.6. ([44,49]) Let ˜f:[a,b]⊆Rn→E1. The horizontal membership function of ˜f(t) at the point t∈[a,b] is denoted by H(˜f(t))≜fgr(t,μ,αf), and defined as fgr:[a,b]×[0,1]×[0,1]×⋯×[0,1]⏟n→[c,d]⊆R in which αf≜(αu1,αu2,⋯,αun) are the RDM variables corresponding to the fuzzy numbers.
Theorem 2.7. ([44]) The fuzzy-number-valued function ˜f:[a,b]⊆Rn→E1 is said to be gr-differentiable at the point t∈[a,b] if and only if its horizontal membership function is differentiable with respect to t at that point. Moreover, H(d˜f(t)dt)=∂fgr(t,μ,αf)∂t.
Definition 2.8. [44] Let ∫ba˜f(t)dt denote the integral of ˜f on [a,b]. Then, the fuzzy function ˜f is said to be granular integrable on [a,b] if there exists a fuzzy number ˜m=∫ba˜f(t)dt such that H(˜m)=∫baH(˜f(t))dt.
Definition 2.9. [44] Let ˜u and ˜v be two fuzzy numbers whose horizontal membership functions are ugr(μ,αu) and vgr(μ,αv), respectively, and "⊙gr" denotes one of the four basic operations, i.e., addition, subtraction, multiplication, and division. Then, ˜u⊙gr˜v is a fuzzy number ˜m such that H(˜m)≜ugr(μ,αu)⊙grvgr(μ,αv).
Remark 2.10. [44] Let ˜m=˜u⊙gr˜v. Then, [˜m]μ=H−1(ugr(μ,αu)⊙grvgr(μ,αv)) always presents μ-level sets of the fuzzy number ˜m.
Remark 2.11. [44] Consider the differential equation
{˙˜x(t)=˜f(t,˜x(t)),t∈[t0,tf],˜x(t0)=˜x0, | (2.3) |
where ˜x:[t0,tf]⊆R→E1 includes n∈N distinct fuzzy numbers ˜u1,˜u2,...,˜un, ˙˜x(t) represents the gr-derivative of ˜x with respect to t, and ˜x0∈E1 is a fuzzy initial condition. Based on Definition 2.5, the fuzzy differential Equation (2.3) can be rewritten as
{H(˙˜x(t))=H(˜f(t,˜x(t))),t∈[t0,tf],H(˜x(t0))=H(˜x0), | (2.4) |
and then, using Theorem 2.7, we have
{∂xgr(t,μ,α)∂t=fgr(t,xgr(t,μ,α),μ,α),t∈[t0,tf],xgr(t0,μ,α)=xgr0(μ,α),α≜(αu1,αu2,...,αun). | (2.5) |
Definition 2.12. Let ˜f(t) be a bounded and continuous fuzzy-number-valued function. Then, the fuzzy Fourier transform of ˜f(t) is given by the following formula:
ˆ˜f(t):=F{˜f(t)}=1√2π∫+∞−∞˜f(t)e−iwtdt=˜F(w). | (2.6) |
Definition 2.13. If ˜F(w) is the fuzzy Fourier transform of ˜f(t), then the inverse fuzzy Fourier transform of ˜F(w) is
F−1{˜F(w)}=1√2π∫+∞−∞˜F(w)eiwtdw=˜f(t). | (2.7) |
Remark 2.14. Let ˜f(x) be a fuzzy-number-valued function. According to Definition 2.8, for any μ,αf,αF∈[0,1], the following formula holds:
F{fgr(t,μ,αf)}=1√2π∫+∞−∞fgr(t,μ,αf)e−iwtdt=Fgr(w,μ,αF), | (2.8) |
and Eq (2.7) can also be rewritten as
F−1{Fgr(w,μ,αF)}=1√2π∫+∞−∞Fgr(w,μ,αF)eiwtdw=fgr(t,μ,αf). | (2.9) |
Example 2.15. [50] Consider the following fuzzy heat conduction equation:
{∂tgr˜u(x,t)⊖grk∂xxgr˜u(x,t)=0,t≥0,˜u(x,0)=˜φ(x),x∈R, | (2.10) |
where k∈R represents the coefficient, and ˜φ(x) is the fuzzy initial condition. If we assume that the exact solution ˜u(x,t) of the above equation has a fuzzy Fourier transform of F{˜u(x,t)} with respect to the variable x, then by Definition 2.12, we have
F{˜u(x,t)}=1√2π∫+∞−∞e−iλx˜u(x,t)dx=˜F(λ,t), | (2.11) |
and according to Definition 2.13, we have
F−1{˜F(λ,t)}=1√2π∫+∞−∞eiλx˜F(λ,t)dλ=˜u(x,t). | (2.12) |
We apply the fuzzy Fourier transform to the variable x in Eq (2.10), and obtain its exact solution by the variable separation method as follows:
˜F(λ,t)=˜F(λ,0)ekλ2t, | (2.13) |
where ˜F(λ,0) is the fuzzy Fourier transform of fuzzy initial data ˜φ(x), i.e.,
˜F(λ,0)=1√2π∫+∞−∞e−iλx˜φ(x)dx. | (2.14) |
Then, we substitute ˜F(λ,t) into the Eq (2.12), and obtain
˜u(x,t)=1√2π∫+∞−∞e−kλ2teiλx˜F(λ,0)dλ=1√2π∫+∞−∞(∫+∞−∞e−iλζ˜φ(ζ)dζ)e−kλ2teiλxdλ=1√2π∫+∞−∞˜φ(ζ)∫+∞−∞e−kλ2teiλ(x−ζ)dλdζ, | (2.15) |
where the exponent part can be written as
−kλ2t+iλ(x−ζ)=−tk(λ2−iλx−ζkt)=−kt[(λ−ix−ζ2kt)2+(x−ζ)24k2t2]. | (2.16) |
Let
G(x,t,ζ)=∫+∞−∞e−kλ2teiλ(x−ζ)dλ=∫+∞−∞e[−kt(λ−ix−ζ2kt)2−(x−ζ)24kt]. | (2.17) |
If we set λ−ix−ζ2kt=l√kt, then dλ=1√ktdl. According to Euler′s equation (denoted as ∫+∞−∞e−l2dl=√π), we obtain
G(x,t,ζ)=∫+∞−∞e−le−[(x−ζ)2kt]1√4kt=√πkte−[(x−ζ)24kt]. | (2.18) |
We get the solution of the fuzzy heat conduction equation as follows:
˜u(x,t)=1√4πkt∫+∞−∞e−(x−ζ)24kt˜φ(ζ)dζ, | (2.19) |
and according to Definition 2.8, we have
ugr(x,t,μ,α)=1√4πkt∫+∞−∞e−(x−ζ)24ktφgr(ζ,μ,α)dζ. | (2.20) |
Definition 2.16. ([51]) Let the fuzzy-number-valued function ˜f(x) be granular improper integrable on the infinite interval [a,∞), where a≥0. For any fixed μ,α∈[0,1], then L2-norm of fgr(x,μ,α) on R is defined as
H(∥˜f(x)∥2)=∥H(˜f(x))∥2=(∫∞a(fgr(x,μ,α))2dx)12. | (2.21) |
In this section, we consider the following BHCE with uncertainty:
{∂tgr˜u(x,t)⊖gr∂xxgr˜u(x,t)=0,−∞<x<+∞,0≤t<T,˜u(x,T)=˜φT(x),−∞<x<+∞, | (3.1) |
where ˜φT(x) is the data known at time T. We want to find the temperature distribution ˜u(⋅,t) at time 0≤t<T from the data we know, ˜φT(x).
According to Remark 2.11, the above Eq (3.1) can be rewritten as
{∂tgrugr(x,t,μ,αu)⊖gr∂xxgrugr(x,t,μ,αu)=0,x∈R;t∈[0,T),ugr(x,T,μ,αu)=φgrT(x,μ,αφ),αu=αφ∈[0,1]. | (3.2) |
Based on the Definition 3.1 below, we will show that the BHCE with uncertainty is seriously ill-posed.
Definition 3.1. An equation is well-posed if its solution satisfies the following three properties:
(1) Existence;
(2) Uniqueness;
(3) Continuous dependence on given data.
On the contrary, if only one of these three conditions is not satisfied, then it is ill-posed.
Theorem 3.2. If Eq (3.2) has no solution, then Eq (3.1) has no solution.
Proof. If Eq (3.2) has no solution, for any μ,α∈[0,1], then ugr(x,t,μ,α) does not exist. From Remark 2.3, we can get that H−1(ugr(x,t,μ,α))=[˜u(x,t)]μ does not exist. According to Theorem 2.1, ˜u(x,t) does not exist. Therefore, Equation (3.1) has no solution.
Theorem 3.3. If the solution of Eq (3.2) exists and it is not unique, then a solution of Eq (3.1) exists and it is not unique.
Proof. For x∈R, t∈(0,T], μ,α∈[0,1], assume ugr1(x,t,μ,αu) and ugr2(x,t,μ,αu) are the solution of Eq (3.2) which correspond to the data φgrT(x,μ,αφ), respectively, and ugr1(x,t,μ,αu)≠ugr2(x,t,μ,αu). According to the Eq (3.2), we have the following equation:
{∂tgrugr1(x,t,μ,αu)⊖gr∂xxgrugr1(x,t,μ,αu)=0,ugr1(x,T,μ,αu)=φgrT(x,μ,αφ), | (3.3) |
{∂tgrugr2(x,t,μ,αu)⊖gr∂xxgrugr2(x,t,μ,αu)=0,ugr2(x,T,μ,αu)=φgrT(x,μ,αφ). | (3.4) |
For Eq (3.3), we have
{∂tgrugr1(x,t,μ,αu)=∂xxgrugr1(x,t,μ,αu),ugr1(x,T,μ,αu)=φgrT(x,μ,αφ). | (3.5) |
For any μ,αu∈[0,1], according to Remark 2.11, we have
{H(∂tgr˜u1(x,t))=H(∂xxgr˜u1(x,t)),H(˜u1(x,T))=H(˜φT(x)). | (3.6) |
For Eq (3.6), we have
{∂tgrH(˜u1(x,t))=∂xxgrH(˜u1(x,t)),H(˜u1(x,T))=H(˜φT(x)), | (3.7) |
and, according to Definition 2.5 and Eq (3.7), we have
{∂tgr˜u1(x,t)=∂xxgr˜u1(x,t),˜u1(x,T)=˜φT(x). | (3.8) |
For Eq (3.8), we have
{∂tgr˜u1(x,t)⊖gr∂xxgr˜u1(x,t)=0,˜u1(x,T)=˜φT(x). | (3.9) |
In the same way, for Eq (3.4), we can also get the following equations:
{∂tgr˜u2(x,t)⊖gr∂xxgr˜u2(x,t)=0,˜u2(x,T)=˜φT(x). | (3.10) |
For any μ,α∈[0,1], because ugr1(x,t,μ,αu) and ugr2(x,t,μ,αu) are the solutions of Eqs (3.2) which correspond to the data φgrT(x,μ,αφ), respectively, and ugr1(x,t,μ,αu)≠ugr2(x,t,μ,αu), according to Remark 2.3, H(u1(x,t,μ,α))≠H(u2(x,t,μ,α)). According to Definition 2.5, ˜u1(x,t)≠˜u2(x,t). From Eqs (3.9) and (3.10), we can obtain that ˜u1(x,t) and ˜u2(x,t) are two different solutions of the Eq (3.1).
Theorem 3.4. For any αφ, μ∈[0,1], a solution of Eq (3.2) does not depend continuously on the data φgrT(x,μ,αφ).
Theorem 3.5. A solution of Eq (3.1) does not depend continuously on the data ˜φT(x).
Proof. Using the fuzzy Fourier transform to Eq (3.1) with respect to the variable x, we can get the fuzzy Fourier transform ˆ˜u(ξ,t) of the exact solution ˜u(x,t) of Eq (3.1)
ˆ˜u(ξ,t)=eξ2(T−t)ˆ˜φT(ξ), | (3.11) |
or equivalently
˜u(x,t)=1√2π∫+∞−∞eiξxeξ2(T−t)ˆ˜φT(ξ)dξ. | (3.12) |
Moreover, there holds
ˆ˜u(ξ,0)=eξ2Tˆ˜φT(ξ), | (3.13) |
or equivalently
˜u(x,0)=1√2π∫+∞−∞eiξxeξ2Tˆ˜φT(ξ)dξ. | (3.14) |
Now we consider Eq (3.12). Assume ˜F:R→E1 is a fuzzy-number-valued function. Let ˜u1(x,t) and ˜u2(x,t) be the solutions of Eq (3.1) which correspond to the data ˜φ1(x)=˜φT(x) and ˜φ2(x)=˜φ1(x)⊕grϵsin(ωx)⊙gr˜F(x) (where ϵ is a nonzero constant). Then, we have the following two equations:
˜u1(x,t)=1√2π∫+∞−∞eiξxeξ2Tˆ˜φ1(ξ)dξ, | (3.15) |
˜u2(x,t)=1√2π∫+∞−∞eiξxeξ2Tˆ˜φ2(ξ)dξ, | (3.16) |
From Eqs (3.15) and (3.16), we have
˜u2(x,t)=˜u1(x,t)⊕gr1√2π∫+∞−∞eiξxeξ2Tϵsin(ωx)⊙gr˜F(x)dξ. | (3.17) |
From Eq (3.17), we obtain
˜u2(x,t)⊖gr˜u1(x,t)=1√2π∫+∞−∞eiξxeξ2Tϵsin(ωx)⊙gr˜F(x)dξ. | (3.18) |
For any μ,α∈[0,1] and Eq (3.18), according to Remark 2.11 and Definition 2.8, we have
ugr2(x,t,μ,α)⊖grugr1(x,t,μ,α)=1√2π∫+∞−∞eiξxeξ2Tϵsin(ωx)⋅Fgr(x,μ,α)dξ. | (3.19) |
From equation ˜φ2(x)=˜φ1(x)⊕grϵsin(ωx)⊙gr˜F(x), we obtain
˜φ2(x)⊖gr˜φ1(x)=ϵsin(ωx)⊙gr˜F(x) | (3.20) |
For any μ,α∈[0,1] and Eq (3.20), according to Remark 2.11 and Definition 2.8, we have
φgr2(x,μ,α)⊖grφgr1(x,μ,α)=ϵsin(ωx)⋅Fgr(x,μ,α), | (3.21) |
and according to the Riemann-Lebesgue Lemma, as ω→0, we have the equation
‖φgr2(x,μ,α)⊖grφgr1(x,μ,α)‖2=|ϵ|{[1√2π∫+∞−∞sin2(ωx)⋅[Fgr(x,μ,α)]2dx]}12→0. | (3.22) |
However, as ω→0,
‖ugr2(x,t,μ,α)⊖grugr1(x,t,μ,α)‖2=|ϵ|{12π∫+∞−∞[∫+∞−∞eiξxeξ2Tsin(ωx)⋅Fgr(x,μ,α)dξ]2dx}12↛0, | (3.23) |
where ‖⋅‖ denotes the L2-norm. (See Definition 2.16.)
The theorem has been proved.
We will give the following example to help understand Theorem 3.5.
Example 3.6. Consider the following BHCE:
{∂tgr˜u(x,t)⊖gr∂xxgr˜u(x,t)=0,x∈[0,l],t∈[0,T),˜u(x,T)=˜φT(x),˜u(0,t)=˜u(l,t)=0. | (3.24) |
According to Remark 2.11, we have the following granular differential equation:
{∂tgrugr(t,μ,αu)⊖gr∂xxgrugr(x,μ,αu)=0,x∈[0,l],t∈[0,T),ugr(x,T,μ,αu)=φgrT(x,μ,αφ),ugr(0,t,μ,αu)=ugr(l,t,μ,αu)=0,αu=αφ∈[0,1]. | (3.25) |
Let ˜φT1(x)=0. Then, the corresponding granular equation is φgrT1(x,μ,αφ)=0. It is easy to verify that, at this time, the solution of the above equation is ugr1(x,t,μ,αu)=0.
Let ˜φT2=˜m⋅1nsinnπlx, where ˜m is a fuzzy-number-valued function, i.e., ˜m=(−1,0,1), which has the following expression:
˜m(t)={t+1,t∈[−1,0),1,t=0,−t+1,t∈(0,1],0,t∈(−∞,−1]∪[1,+∞). | (3.26) |
Then, according to Definition 2.6, we obtain mgr(μ,αm)=−1+μ+2(1−μ)αm. Therefore, the corresponding granular equation is φgrT2(x,μ,αφ)=[−1+μ+2(1−μ)αm]⋅1nsinnπlx, for all μ,αm∈[0.1]. In this case, Equation (3.25) corresponding to the data φgrT2(x,μ,αφ) can be solved by the following granular equation:
{ugrt(t,μ,αu)⊖grugrxx(x,u,αu)=0,x∈[0,l],t∈[0,T),ugr(x,T,μ,αm)=[−1+μ+2(1−μ)αm]⋅1nsinnπlx,ugr(0,t,μ,αu)=ugr(l,t,μ,αu)=0,αu=αm∈[0,1]. | (3.27) |
The solution of the above granular differential equation can be easily obtained by the method of separating variables as follows
ugr2(x,t,μ,αm)=[−1+μ+2(1−μ)αm]e(nπxl)2(T−t)sinnπlx. | (3.28) |
Based on the above discussion, the continuous dependence of the solution on the given data is analyzed, and we have
supx∈R|φgrT1(x,μ,αφ)⊖grφgrT2(x,μ,αφ)|=1n[−1+μ+2(1−μ)αm]→0,n→+∞. | (3.29) |
However, for any μ,αm∈[0,1],
supx∈R|ugr1(x,t,μ,αu)⊖grugr2(x,t,μ,αm)|=e(nπxl)2(T−t)[−1+μ+2(1−μ)αm]↛0,n→+∞. | (3.30) |
Therefore, from Eqs (3.29) and (3.30), we can conclude that Eq (3.22) is seriously ill-posed.
We consider the BHCE with uncertainty
{∂tgr˜u(x,t)⊖gr∂xxgr˜u(x,t)=0,−∞<x<+∞,0≤t<T,˜u(x,T)=˜φT(x),−∞<x<+∞, | (4.1) |
where ˜φT(x) is the data known at time T.
Based on Theorems 3.4 and 3.5, we mainly consider the Fourier regularization of the granular differential equation of the BHCE with uncertainty:
{∂tgrugr(x,t,μ,αu)⊖gr∂xxgrugr(x,t,μ,αu)=0,x∈R;t∈[0,T),ugr(x,T,μ,αu)=φgrT(x,μ,αφ),αu=αφ∈[0,1]. | (4.2) |
We need to determine the temperature distribution ugr(x,t,μ,αu) for 0≤t<T from the given data φgrT(x,μ,αφ). Applying the fuzzy Fourier transform method to Eq (4.2), we can obtain the fuzzy Fourier transform ˆugr(x,t,μ,αu) of the solution ugr(x,t,μ,αu) of Eq (4.2) as follows:
ˆugr(λ,t,μ,αu)=F{ugr(x,t,μ,αu)}=eλ2(T−t)ˆφgrT(λ,μ,αφ), | (4.3) |
and, according to the Definition 2.9 and Remark 2.10, we can obtained the inverse fuzzy Fourier transform of ˆugr(λ,t,μ,αu):
ugr(x,t,μ,αu)=1√2π∫+∞−∞eiλxeλ2(T−t)ˆφgrT(λ,μ,αφ)dλ, | (4.4) |
where ˆφgrT(λ,μ,αφ) is the fuzzy Fourier transform of the given data φgrT(x,μ,αφ).
For Eq (4.3), let t=0. Then, we have
ˆugr(λ,0,μ,αu)=eλ2TˆφgrT(λ,μ,αφ). | (4.5) |
Denoting ugr(x,0,μ,αu)=φgr0(x,μ,αφ), in order to give an error, we make the following assumption:
∥φgr0(x,μ,αφ)∥Hk=∥ugr(x,0,μ,αu)∥Hk≤A, | (4.6) |
where A represents a positive constant, and ∥⋅∥Hk represents the Sobolev norm.
Based on Eq (4.5), Eq (4.6), and the Parseval identity, we have
∥φgr0(x,μ,αφ)∥2=∫+∞−∞|eλ2TˆφgrT(λ,μ,αφ)|2dλ<∞. | (4.7) |
We find that eλ2T→∞ when |λ|→∞, so Eq (4.6) implies a rapid decay of ˆφgrT(λ,μ,αφ) at high frequencies. Since the data φgrδ,T(x,t,μ,αφ) at time t=T is measured by a physical instrument, there is a certain error. We know that the ill-posedness of the BHCE with uncertainty is caused by the high-frequency disturbance in the solution. Therefore, in this paper, we apply the Fourier regularization method to stabilize the numerical solution, and instead consider Eq (4.4) only for |λ|<λmax, where λmax is an appropriate positive constant which will be selected as a regularization parameter so that the solution tends to be stable for given noisy data.
Let φgrT(x,t,μ,αuφ) and φgrδ,T(x,t,μ,αφ) denote the exact data and measured data at t=T, respectively, and they satisfy
∥φgrT(x,t,μ,αφ)⊖grφgrδ,T(x,t,μ,αφ)∥≤δ, | (4.8) |
where δ denotes the error level, and we assume Eq (4.6) holds.
Next, we define a regularization solution of Eq (4.2) for the measured noisy data, which we call the Fourier regular solution of Eq (4.2) as follows:
ugrδ,λmax(x,t,μ,αu)=1√2π∫+∞−∞eiλxeλ2(T−t)ˆφgrδ,T(λ,t,μ,αφ)ζmaxdλ, | (4.9) |
where ˆφgrδ,T(λ,μ,αφ) is the fuzzy Fourier transform of measured the data ˜φδ,T(x,t) at t=T, and ζmax is the characteristic function of the interval [−λmax,λmax], i.e.,
ζmax={1,x∈[−λmax,λmax];0,x∉[−λmax,λmax], | (4.10) |
and λmax will be selected appropriately as a regularization parameter.
The following theorem illustrates that the Fourier regular solution defined by Eq (4.9) continuously depends on the given data φgrδ,T(x,t,μ,αφ).
Theorem 4.1. Let ugrλmax(x,t,μ,αu) and ugrδ,λmax(x,t,μ,αu) be solutions to Eq (4.9) corresponding to the data φgrT(x,t,μ,αφ) and φgrδ,T(x,t,μ,αφ), respectively. Then, for 0≤t<T, there is
∥ugrλmax(⋅,t,μ,αu)⊖grugrδ,λmax(⋅,t,μ,αu)∥≤eλ2max(T−t)∥φgr(x,t,μ,αφ)⊖grφgrδ(x,t,μ,αφ)∥. | (4.11) |
Proof. Due to the Parseval formula
∥ugrλmax(⋅,t,μ,αu)⊖grugrδ,λmax(⋅,t,μ,αu)∥2=∥ˆugrλmax(⋅,t,μ,αu)⊖grˆugrδ,λmax(⋅,t,μ,αu)∥2=∫+∞−∞|[eλ2(T−t)(ˆφgrT(λ,μ,αφ)⊖grˆφgrδ,T(λ,μ,αφ))]|2dλ=∫λmax−λmax|[eλ2(T−t)(ˆφgrT(λ,μ,αφ)⊖grˆφgrδ,T(λ,μ,αφ))]|2dλ≤e2λ2max(T−t)∫+∞−∞|(ˆφgrT(λ,μ,αφ)⊖grˆφgrδ,T(λ,μ,αφ))|2dλ≤e2λ2max(T−t)∥ˆφgrT(λ,μ,αφ)⊖grˆφgrδ,T(λ,μ,αφ)∥2=≤e2λ2max(T−t)⋅δ2, |
we have
∥ugrλmax(⋅,t,μ,αu)⊖grugrδ,λmax(⋅,t,μ,αu)∥≤eλ2max(T−t)⋅δ. | (4.12) |
Therefore, the proof of convergence estimate is completed.
This theorem shows the stability of the Fourier regularization method. When the input data is noisy, the results indicate that the regularized solution can stay within a reasonable and relatively stable range and will not deviate significantly from the original solution. Thus, it can ensure the reliability and effectiveness of the solution in practical applications.
Note that ∥ugrλmax(⋅,t,μ,αu)⊖grugrδ,λmax(⋅,t,μ,αu)∥→0 as δ→0. That is, the Fourier regular solution defined by Eq (4.9) continuously depends on the given data φgrδ,T(x,t,μ,αφ).
Theorem 4.2. Let ugr(x,t,μ,αu) and ugrδ,λmax(x,t,μ,αu) be the exact solution and the Fourier regular solution we defined for the Eq (4.2), respectively. Then, for 0≤t≤T, assuming that conditions (4.6) and Eq (4.8) hold, if we select the regularization parameter
λmax=(ln((Aδ)1T(lnAδ)−k2T))12, | (4.13) |
we have the following conclusion:
∥ugr(⋅)⊖grugrδ,λmax(⋅)∥≤A1−tTδtT(lnAδ)−k2(1+(lnAδ1TlnAδ+ln(lnAδ)−k2T)k2). | (4.14) |
Proof. Due to the Parseval formula and Eqs (4.3)–(4.5), (4.7), and (4.8), we find
∥ugr(⋅,t,μ,αu)⊖grugrδ,λmax(⋅,t,μ,αu)∥=∥ˆu(⋅,t,μ,αu)⊖grˆugrδ,λmax(⋅,t,μ,αu)∥=∥eλ2(T−t)ˆφgrT(λ,μ,αφ)⊖greλ2(T−t)ˆφgrδ,T(λ,μ,αφ)ζmax∥=∥eλ2(T−t)ˆφgrT(λ,μ,αφ)⊖greλ2(T−t)ˆφgrδ,T(λ,μ,αφ)ζmax⊕greλ2(T−t)ˆφgrT(λ,μ,αφ)ζmax⊖greλ2(T−t)ˆφgrT(λ,μ,αφ)ζmax∥≤∥eλ2(T−t)ˆφgrT(λ,μ,αφ)⊖greλ2(T−t)ˆφgrT(λ,μ,αφ)ζmax∥⊕gr∥eλ2(T−t)ˆφgrT(λ,μ,αφ)ζmax⊖greλ2(T−t)ˆφgrδ,T(λ,μ,αφ)ζmax∥=(∫|λ|>λmax|eλ2(T−t)ˆφgrT(λ,μ,αφ)|2dλ)12⊕gr(∫|λ|≤λmax|eλ2(T−t)(ˆφgrδ,T(λ,μ,αφ)⊖grˆφgrT(λ,μ,αφ))|2dλ)12=(∫|λ|>λmax|eλ2(T−t)e−λ2Tˆφgr0(λ,μ,αφ)|2dλ)12⊕gr(∫|λ|≤λmax|eλ2(T−t)(ˆφgrδ,T(λ,μ,αφ)⊖grˆφgrT(λ,μ,αφ))|2dλ)12=(∫|λ|>λmax|e−tλ2ˆφgr0(λ,μ,αφ)|2dλ)12⊕gr(∫|λ|≤λmax|eλ2(T−t)(ˆφgrδ,T(λ,μ,αφ)⊖grˆφgrT(λ,μ,αφ))|2dλ)12≤sup|λ|>λmaxe−tλ2max(1+λ2)k2(∫|λ|>λmax|ˆφgr0(λ,μ,αφ)|2dλ)12⊕grsup|λ|≤λmaxeλ2(T−t)(∫|λ|≤λmax|(ˆφgrδ,T(λ,μ,αφ)⊖grˆφgrT(λ,μ,αφ))|2dλ)12≤e−tln((Aδ)1T(lnAδ))−k2T(ln((Aδ)1T(lnAδ)−k2T))k2⊕gre(T−t)ln((Aδ)1T)δ=(Aδ)−tT(lnAδ)kt2TA(11TlnAδ+ln(lnAδ)−k2T)k2+(Aδ)T−tTδ(lnAδ)−k2=(Aδ)−tT(lnAδ)kt2TA(lnAδ1TlnAδ+ln(lnAδ)−k2T)k2(lnAδ)k2+A1−tTδtT(lnAδ)−k2=A1−tTδtT(lnAδ)−k2(1+(lnAδ1TlnAδ+ln(lnAδ)−k2T)k2). |
Therefore, the proof of convergence estimate is completed.
This theorem shows the error estimation of the Fourier regularization method. When the input data is noisy, the results show that the error between the regularized solution and the exact solution can be effectively controlled within a certain range. When certain conditions are met, with the reduction of the noise level, the regularized solution will converge to the exact solution at a certain rate, which provides a solid theoretical basis for evaluating and optimizing the Fourier regularization method in practical applications.
Remark 4.3. When k=0, Eq (4.14) becomes
∥ugr(⋅,t,μ,αu)⊖grugrδ,λmax(⋅,t,μ,αu)∥≤2A1−tTδtT. | (4.15) |
We know this is a H¨older error estimate. At t=0, it just means that, with 2A as the error bound, you cannot actually tell whether the regular solution is stable at t=0. However, this defect can be corrected by Eq (4.14). In fact, for t=0, Equation (4.14) becomes
∥ugr(⋅,0)⊖grugrδ,λmax(⋅,0)∥≤A(lnAδ)−k2(1+(lnAδ1TlnAδ+ln(lnAδ)−k2T)k2)⟶0, | (4.16) |
as δ⟶0 and k>0.
Remark 4.4. We know that in actual calculation, the prior bound A given by us is unknown. For the convenience of calculation, if we take the prior bound as A=1, then
λmax=(ln((1δ)1T(ln1δ)−k2T))12, | (4.17) |
and we also have the estimate
∥ugr(⋅,t,μ,αu)⊖grugrδ,λmax(⋅,t,μ,αu)∥≤δtT(ln1δ)−k2(1+(lnAδ1Tln1δ+ln(ln1δ)−k2T)k2). | (4.18) |
Example 5.1. The initial value problem of the following form of the BHCE with uncertainty in an unbounded region is considered:
{∂tgr˜u(x,t)⊖gr14∂xxgr˜u(x,t)=0,x∈R;t∈[0,T),˜u(x,0)=˜v(x)e−x2, | (5.1) |
where ˜v(x) is a fuzzy-number-valued function, i.e., ˜v(x)=(−5,0,5), and we have the following expression:
˜v(x)={15x+1,x∈[−5,0),1,x=0,−15x+1,x∈(0,5],0,otherwise, | (5.2) |
and, according to Definition 2.2, vgr(x,μ,αv)=(−5+5μ)+10(1−μ)αv. Based on Remark 2.11, we obtain the granular differential equation as follows:
{∂tgrugr(x,t,μ,αu)⊖gr14∂xxgrugr(x,t,μ,αu)=0,x∈R;t∈[0,T),ugr(x,0,μ,αu)=[(−5+5μ)+10(1−μ)αv]⋅e−x2,αu=αv∈[0,1]. | (5.3) |
Then, from Eq (2.20), the exact solution of Eq (5.3) is
u∗gr(x,t,μ,αu)=[(−5+5μ)+10(1−μ)αv]⋅1√1+te−x21+t, | (5.4) |
and, according to Remark 2.3, the μ-level sets of the exact solution can be obtained as
[˜u∗(x,t)]μ=[−5+5μ,5−5μ]⋅1√1+te−x21+t. | (5.5) |
Therefore, ˜u∗(x,t) is also a solution to the following fuzzy backward heat conduction equation
{∂tgrugr(x,t,μ,αu)⊖gr14∂xxgrugr(x,t,μ,αu)=0,x∈R;t∈[0,T),ugr(x,T,μ,αu)=[(−5+5μ)+10(1−μ)αv]⋅1√1+Te−x21+T,αu=αv∈[0,1]. | (5.6) |
Numerical experiments will be performed below. Then, according to the Fourier regularization method, the Fourier regular solution of the above Eq (5.6) is constructed as follows:
ugrδ,λmax(x,t,μ,αu)=1√πt∫+∞−∞e−(x−λ)2tˆφgrδ,T(λ,μ,αφ)ζmaxdλ, | (5.7) |
where ζmax is the characteristic function of the interval [−λmax,λmax], and ˆφgrδ,T(λ,μ,αφ) is the fuzzy Fourier transform of the measurement data φgrδ,T(x,μ,αφ) obtained by physical instruments at time t=T, which is usually with errors. Noise data is generated by the rand(⋅) function of MATLAB.
(φgrδ,T(x,μ,αφ))i=(φgrT(x,μ,αφ))i+ϵ⋅rand(size(φgrT(x,μ,αφ)))i, | (5.8) |
where (φgrT(x,μ,αφ))i is the exact data and rand(size(φgrT(x,μ,αφ)))i is a random number of the same dimension as (φgrT(x,μ,αφ)) on [0,1]. The magnitude ϵ indicates the noise level of measurement data by physical instruments, and this noise level has an expression as follows:
ϵ:≜∥φgrδ,T(λ,μ,αφ)∥=(1NxNx∑i=1|φgrδ,T(λi,μ,αφ)−φgrT(λi,μ,αφ)|2)12. | (5.9) |
In this experiment, we mainly used MATLABR2016a for numerical simulation and calculation. Before regularization, we first present the results obtained unregularization. Figures 2 and 3 show the results for noise levels ϵ=6×10−2 and ϵ=6×10−4, respectively, with T=1 and t=0.
It is evident that the higher the noise level, the less accurate the unregularized solution becomes. Therefore, when the input data is not processed through regularization, even minor perturbations in the input data can lead to significant changes in the solution, rendering the numerical solution highly unstable.
Figure 4 show the exact solution of the Eq (5.1), taking μ=0, 0.25, 0.5, 0.75, and 1, respectively. In these figures, the upper and lower halves of the graph represent the left and right endpoints of the μ-level sets of the exact solution, respectively, and the red curve represents μ=1.
Figure 5 show the Fourier regular solution of Eq (5.1) obtained by Fourier regularization, taking μ=0, 0.25, 0.5, 0.75, and 1, respectively. The regularization parameter λmax=0.9124.
From Figures 4 and 5, we can clearly see that appropriate selection of regularization parameter values can make regular solutions stably approximate the exact solution. To further investigate this example under the granular differentiability concept, here we take special values x=1 and t=1 to observe the numerical results, i.e., we fix x=1 and t=1, respectively, to observe the relationship between the exact and regular solutions.
Figure 6 shows the exact solution of Eq (5.1) when x=1 is fixed, with μ taking values of 0, 0.25, 0.5, 0.75, and 1, respectively. The blue and red curves show left and right endpoints of the μ-level sets of the exact solution of the Eq (5.1), respectively, and the black curve corresponds to the level μ=1.
Figure 7 shows that when x=1 is fixed, the Fourier regular solution of Eq (5.1) obtained by Fourier regularization takes μ=0, 0.25, 0.5, 0.75, and 1, respectively. The regularization parameter λmax=0.9124.
Figure 8 shows that when t=1 is fixed, the exact solution of Eq (5.1) takes values corresponding μ=0, 0.25, 0.5, 0.75, and 1, respectively.
Figure 9 shows that when t=1 is fixed, the Fourier regular solution of Eq (5.1) obtained by Fourier regularization takes μ=0, 0.25, 0.5, 0.75, and 1, respectively.
The above numerical experiments are done with noise level ϵ=6×10−2 on the given data. As can be seen from Figures 8 and 9, Fourier regularization method can stabilize regular solutions to exact solutions well if appropriate regularization parameter values are selected. From the fixed x=1 and t=1, it is not difficult to find that when μ=1, the solution of the uncertain reverse heat conduction equation obtained by Fourier regularization is completely consistent with the solution in the classical sense.
In the following, we illustrate the numerical results of the Fourier regularization method when taking different regularization parameters. The purpose is to prove that the exact solution can be approached well by selecting suitable regularization parameters, and the optimal regularization parameters can also be found by this method. It can also be further explained that the regularization parameter selection scheme we give, that is, Equation (4.13), is very effective.
Figures 10–12 are the results of Fourier regularization with regularization parameter λmax=1.1736 and noise level ϵ=6×10−2. In Figures 11 and 12, x=1 and t=1 are fixed, respectively. It is obvious that the Fourier regularization results are not optimistic when the regularization parameter values are large.
Figures 13–15 are the results of Fourier regularization when the regularization parameter λmax=0.5697 and the noise level ϵ=6×10−2. In Figures 14 and 15, x=1 and t=1 are fixed, respectively. It is obvious that Fourier regularization results are not optimistic when the regularization parameter values are small.
We can see from the graph above that if the regularization parameter value is large or small, there will be a large error between the regular solution and the exact solution. Therefore, choosing the appropriate regularization parameter value is the key to solving this kind of problem. According to the selection scheme of regularization parameters given in this paper, the regular solution can well approach the exact solution. In this example, we can also observe that when μ=1, the solution of the BHCE with uncertainty is the solution of the BHCE in the classical sense.
This not only shows the validity of our method, but also provides a new solution for solving the inverse problem of the uncertainty equation. Compared with the deterministic equation, the solution of the uncertain equation is an interval, which increases the control range and can improve the precision accordingly.
Through the above analysis, it can be seen that the regularization parameter rule given by Eq (4.13) is valid. For this example, when the value of the regularization parameter is 0.9124, the regular solution and the exact solution have the best stability. The figure below shows that the numerical solution of the proposed method is stable at t=0. This is consistent with our theoretical results.
We already know that, the higher the value of T, the flatter the exact solution. Therefore, as the T-value increases, we also adjust the regularization parameters accordingly, so that the regular solution is stabilizes well to the exact solution. The following two figures show the regularization results for T=10 and T=100, respectively. It can be seen that Fourier regularization yields satisfactory results in these cases.
Through the analysis of the above example, even if there is noise in the given data, we can make it tend to a stable solution through the Fourier regularization method. This numerical example also further verifies the effectiveness and practicability of the Fourier regularization method proposed in this paper.
The following example shows that Fourier regularization is still valid under different fuzzy initial conditions.
Example 5.2. We consider the following BHCE with uncertainty:
{∂tgr˜u(x,t)⊖gr14∂xxgr˜u(x,t)=0,x∈R;t∈[0,T),˜u(x,0)=˜v(x)⋅sinx, | (5.10) |
where ˜v(x)=(−1,0,1) is a fuzzy-number-valued function, and, according to Definition 2.2, we have vgr(x,μ,αv)=(μ−1)+2(1−μ)αu. Based on Remark 2.11, we obtain the granular differential equation as follows:
{∂tgrugr(x,t,μ,αu)⊖gr14∂xxgrugr(x,t,μ,αu)=0,x∈R;t∈[0,T),ugr(x,0,μ,αu)=[(μ−1)+2(1−μ)αv]⋅sinx,αu=αv∈[0,1]. | (5.11) |
The exact solution of Eq (5.11) is
u∗gr(x,t,μ,αu)=[(μ−1)+2(1−μ)αv]⋅e−tsinx, | (5.12) |
and according to Remark 2.3, the μ-level sets of the exact solution can be obtained:
[˜u∗(x,t)]μ=[μ−1,1−μ]⋅e−tsinx. | (5.13) |
Therefore, ˜u∗(x,t) is also a solution to the following fuzzy backward heat conduction equation:
{∂tgrugr(x,t,μ,αu)⊖gr14∂xxgrugr(x,t,μ,αu)=0,x∈R;t∈[0,T),ugr(x,T,μ,αu)=[μ−1)+2(1−μ)αv]⋅e−Tsinx,αu=αv∈[0,1]. | (5.14) |
In the following experiment, we also tested under the software MATLABR2016a. Here, the noise data is generated in the same way as in the previous example. Our main purpose here is to study the accuracy of regularization methods under different fuzzy initial conditions.
Figures 19 and 20 are the result of the unregularization of this example when T=1, and the noise levels ϵ=6×10−2 and ϵ=6×10−4 are taken, respectively.
As can be seen from Figures 19 and 20, in the case of unregularization, small perturbations in the input data will cause huge changes in the solution, and this problem is seriously ill-posed. Next, we apply the regularization method to stabilize the numerical solution.
For this example, we calculated the regularization parameters applicable to this example according to the regularization parameter selection scheme, namely Eq (4.13), and compared the difference between the obtained regularization solution and the exact solution of the equation so as to test the stability of the proposed regularization method.
Figure 21 is the result of Fourier regularization. With regularization parameter λmax=0.9124, it can be seen that the regular solution is effectively stable to the exact solution.
Next, we will discuss the stability of the regularization method when fixing x=1 and t=1, respectively.
Figures 22 and 23 show the interval solution plots for fixed t=1 and x=1, respectively, in this example.
It can be seen from the figure that the interval solution obtained by Fourier regularization method is stable even if t=1 and x=1 are fixed.
Next, we take T=10 and T=100 respectively to observe the stability of Fourier regularization method.
From the above example, we can observe that small perturbations in the data can cause large changes in the solution. Fourier regularization method is used to stabilize the numerical solution. By fixing the graph of t=1 and x=1, respectively, it is not difficult to find that when μ=1, the result obtained is consistent with the result in the classical sense.
The calculation of the above numerical examples were performed using the MATLAB software. Given the small scale of the problem, the limited amount of data, and the high efficiency of the algorithm employed, the computational time for these examples is very brief, typically taking only a few seconds to complete. Specifically, using MATLAB's built-in timer function, we measured the computational time to be approximately 1.2 seconds. This further demonstrates the efficiency and applicability of our algorithm.
In this study, we propose the backward heat conduction equation (BHCE) with uncertainty, in which the uncertainty of parameters is expressed by fuzzy numbers. This equation is essentially an inverse fuzzy differential equation, and we study its numerical solution. Second, it is proved that the backward heat conduction equation (BHCE) with uncertainty is a seriously ill-posed problem, so a specific regularization method is needed to solve its numerical solution. Last, the Fourier regularization method under the granular differentiability concept is used to solve the numerical solution. The granular representation of the regular solution is given, and the convergence and stability estimations of the method are proved under the prior assumptions of the exact solution.
In numerical examples, we use the rand(⋅) function in MATLAB to randomly generate numbers in the interval [0,1] to simulate noise in the given data. In this example, we take the noise level of the data ϵ=6×10−2. We find that when the regularization parameter λmax is calculated according to Eq (4.13), the approximate effect is significant. We also compare different regularization parameters and find that when the regularization parameter is greater than or less than this value, the error between the exact solution and the regular solution is relatively large. At the same time, we also analyze the relationship between the regular solution and the exact solution when μ=0, 0.25, 0.5, 0.75, and 1 with fixed variables x=1 and t=1, respectively. We find that when μ=1, the solution of the uncertain BHCE is exactly that of the classical BHCE. This numerical example also shows the practicability and effectiveness of the proposed method.
At present, we define the inverse heat transfer equation based on the granular differentiability concept of fuzzy numerical functions. When uncertainty is represented by fuzzy numbers, the complexity of fuzzy number operation may affect the efficiency of the model. In the future, we can further expand and deepen the definition of fuzzy number differentiability, explore its application in a wider range of mathematical-physical scenarios, and study the properties and solutions of reverse heat conduction equations under different differentiability conditions. Even though we have used the Fourier regularization method, regularization theory is an evolving field. We can explore other types of regularization methods and compare the advantages and disadvantages of different methods in dealing with uncertain reverse heat conduction equations. In practical engineering, the heat conduction process is often coupled with other physical processes. In the future, our method could be extended to the inverse problems of such multi-physical coupling to study its effectiveness in complex practical scenarios. We can apply this method to the field of real-time monitoring and control, such as real-time monitoring of the heat conduction state and feedback control in the industrial production process. Moreover, we can study how to optimize the method to meet the real-time requirements and enhance its practicality in real-world applications.
The authors declare they have not used Artificial Intelligence (AI) tools in the creation of this article.
This work is supported by National Natural Science Foundation of China (NO. 12161082) and Gansu Province Outstanding Youth Fund project (Grant No. 24JRRA121). The authors are very grateful to the anonymous referees for their valuable suggestions.
The authors declare that they have no conflict of interest.
[1] | C. Goodrich, A. Peterson, Discrete Fractional Calculus, Springer, Berlin, 2015. https://doi.org/10.1007/978-3-319-25562-0 |
[2] |
F. M. Atici, M. Uyanik, Analysis of discrete fractional operators, Appl. Anal. Discrete Math., 9 (2015), 139–149. https://doi.org/10.2298/AADM150218007A doi: 10.2298/AADM150218007A
![]() |
[3] |
F. M. Atici, M. Atici, M. Belcher, D. Marshall, A new approach for modeling with discrete fractional equations, Fract. Equations, 151 (2017), 313–324. https://doi.org/10.3233/FI-2017-1494 doi: 10.3233/FI-2017-1494
![]() |
[4] | F. Atici, S. Sengul, Modeling with discrete fractional equations, J. Math. Anal. Appl., 369 (2010), 1–9. |
[5] |
C. R. Chen, M. Bohner, B. G. Jia, Ulam-Hyers stability of Caputo fractional difference equations, Math. Methods Appl. Sci., 42 (2019), 7461–7470. https://doi.org/10.1002/mma.5869 doi: 10.1002/mma.5869
![]() |
[6] |
C. Lizama, The Poisson distribution, abstract fractional difference equations, and stability, Proc. Am. Math. Soc., 145 (2017), 3809–3827. https://doi.org/10.1090/proc/12895 doi: 10.1090/proc/12895
![]() |
[7] |
C. S. Goodrich, On discrete sequential fractional boundary value problems, J. Math. Anal. Appl., 385 (2012), 111–124. https://doi.org/10.1016/j.jmaa.2011.06.022 doi: 10.1016/j.jmaa.2011.06.022
![]() |
[8] |
A. Silem, H. Wu, D. J. Zhang, Discrete rogue waves and blow-up from solitons of a nonisospectral semi-discrete nonlinear Schrödinger equation, Appl. Math. Lett., 116 (2021), 107049. https://doi.org/10.1016/j.aml.2021.107049 doi: 10.1016/j.aml.2021.107049
![]() |
[9] |
H. M. Srivastava, P. O. Mohammed, C. S. Ryoo, Y. S. Hamed, Existence and uniqueness of a class of uncertain Liouville-Caputo fractional difference equations, J. King Saud Univ., Sci., 33 (2021), 101497. https://doi.org/10.1016/j.jksus.2021.101497 doi: 10.1016/j.jksus.2021.101497
![]() |
[10] |
Q. Lu, Y. Zhu, Comparison theorems and distributions of solutions to uncertain fractional difference equations, J. Comput. Appl. Math., 376 (2020), 112884. https://doi.org/10.1016/j.cam.2020.112884 doi: 10.1016/j.cam.2020.112884
![]() |
[11] | R. W. Ibrahim, H. Natiq, A. Alkhayyat, A. K. Farhan, N. M. G. Al-Saidi, D. Baleanu, Image encryption algorithm based on new fractional beta chaotic maps, Comput. Model. Eng. Sci., 132 (2022). https://doi.org/10.32604/cmes.2022.018343 |
[12] |
L. L. Huang, J. H. Park, G. C. Wu, Z. W. Mo, Variable-order fractional discrete-time recurrent neural networks, J. Comput. Appl. Math., 370 (2020), 112633. https://doi.org/10.1016/j.cam.2019.112633 doi: 10.1016/j.cam.2019.112633
![]() |
[13] |
T. Abdeljawad, S. Banerjee, G. C. Wu, Discrete tempered fractional calculus for new chaotic systems with short memory and image encryption, Optik, 218 (2020), 163698. https://doi.org/10.1016/j.ijleo.2019.163698 doi: 10.1016/j.ijleo.2019.163698
![]() |
[14] |
L. L. Huang, G. C. Wu, D. Baleanu, H. Y. Wang, Discrete fractional calculus for interval-valued systems, Fuzzy Sets. Syst., 404 (2021), 141–158. https://doi.org/10.1016/j.fss.2020.04.008 doi: 10.1016/j.fss.2020.04.008
![]() |
[15] |
P. O. Mohammed, H. M. Srivastava, J. L. G. Guirao, Y. S. Hamed, Existence of solutions for a class of nonlinear fractional difference equations of the Riemann-Liouville type, Adv. Contin. Discrete Models, 2022 (2022), 32. https://doi.org/10.1186/s13662-022-03705-9 doi: 10.1186/s13662-022-03705-9
![]() |
[16] |
F. M. Atici, M. Atici, N. Nguyen, T. Zhoroev, G. Koch, A study on discrete and discrete fractional pharmacokinetics-pharmacodynamics models for tumor growth and anti-cancer effects, Comput. Math. Biophys., 7 (2019), 10–24. https://doi.org/10.1515/cmb-2019-0002 doi: 10.1515/cmb-2019-0002
![]() |
[17] |
P. O. Mohammed, H. M. Srivastava, S. A. Mahmood, K. Nonlaopon, K. M. Abualnaja, Y. S. Hamed, Positivity and monotonicity results for discrete fractional operators involving the exponential kernel, Math. Biosci. Eng., 5 (2022), 5120–5133. https://doi.org/10.3934/mbe.2022239 doi: 10.3934/mbe.2022239
![]() |
[18] |
R. A. C. Ferreira, D. F. M. Torres, Fractional h-difference equations arising from the calculus of variations, Appl. Anal. Discrete Math., 5 (2011), 110–121. https://doi.org/10.2298/AADM110131002F doi: 10.2298/AADM110131002F
![]() |
[19] |
G. Wu, D. Baleanu, Discrete chaos in fractional delayed logistic maps, Nonlinear Dyn., 80 (2015), 1697–1703. https://doi.org/10.1007/s11071-014-1250-3 doi: 10.1007/s11071-014-1250-3
![]() |
[20] | P. O. Mohammed, T. Abdeljawad, Discrete generalized fractional operators defined using h-discrete Mittag-Leffler kernels and applications to AB fractional difference systems, Math. Methods Appl. Sci., 2020. https://doi.org/10.1002/mma.7083 |
[21] | T. Abdeljawad, F. M. Atici, On the definitions of nabla fractional operators, Abstr. Appl. Anal., 2012 (2012). https://doi.org/10.1155/2012/406757 |
[22] | F. M. Atici, P. W. Eloe, A transform method in discrete fractional calculus, Int. J. Differ. Equations, 2 (2007), 165–176. https://ecommons.udayton.edu/mth_fac_pub/110 |
[23] | T. Abdeljawad, On delta and nabla Caputo fractional differences and dual identities, Discrete Dyn. Nat. Soc., 2013 (2013). https://doi.org/10.1155/2013/406910 |
[24] |
T. Abdeljawad, Different type kernel h-fractional differences and their fractional h–sums, Chaos, Solitons Fractals, 116 (2018), 146–156. https://doi.org/10.1016/j.chaos.2018.09.022 doi: 10.1016/j.chaos.2018.09.022
![]() |
[25] |
P. O. Mohammed, T. Abdeljawad, F. K. Hamasalh, On Riemann-Liouville and Caputo fractional forward difference monotonicity analysis, Mathematics, 9 (2021), 1303. https://doi.org/10.3390/math9111303 doi: 10.3390/math9111303
![]() |
[26] | T. Abdeljawad, D. Baleanu, Monotonicity analysis of a nabla discrete fractional operator with discrete Mittag-Leffler kernel, 102 (2017), 106–110. https://doi.org/10.1016/j.chaos.2017.04.006 |
[27] |
C. Goodrich, C. Lizama, Positivity, monotonicity, and convexity for convolution operators, Discrete Contin. Dyn. Syst., 40 (2020), 4961–4983. https://doi.org/10.3934/dcds.2020207 doi: 10.3934/dcds.2020207
![]() |
[28] |
C. Goodrich, B. Lyons, Positivity and monotonicity results for triple sequential fractional differences via convolution, Analysis, 40 (2020), 89–103. https://doi.org/10.1515/anly-2019-0050 doi: 10.1515/anly-2019-0050
![]() |
[29] |
X. Liu, F. Du, D. Anderson, B. Jia, Monotonicity results for nabla fractional h-difference operators, Math. Methods Appl. Sci., 44 (2021), 1207–1218. https://doi.org/10.1002/mma.6823 doi: 10.1002/mma.6823
![]() |