Skip to main content

ORIGINAL RESEARCH article

Front. Phys., 02 October 2023
Sec. Mathematical Physics

Fuzzy M-fractional integrodifferential models: theoretical existence and uniqueness results, and approximate solutions utilizing the Hilbert reproducing kernel algorithm

Omar Abu Arqub
Omar Abu Arqub1*Riyane MezghicheRiyane Mezghiche2Banan MaayahBanan Maayah2
  • 1Department of Mathematics, Faculty of Science, Al Balqa Applied University, As-Salt, Jordan
  • 2Department of Mathematics, Faculty of Science, The University of Jordan, Amman, Jordan

This article proposes a new approach to solving fuzzy M-fractional integrodifferential models under strongly generalized differentiability using an innovative formulation of the characterization principle. The study presents theoretical effects on the existence-uniqueness of fuzzy two M-solutions and, thus, showcases the solvability of the fuzzy Volterra models. Moreover, the study offers numerical solutions using the Hilbert reproducing kernel algorithm in a new fuzzy look, utilizing two fitting Hilbert spaces. The proposed models and algorithms are under scrutiny, with particular attention given to the analysis of the series solution, the assessment of convergence, and the evaluation of error. The debated Hilbert approach is shown to be effective in solving several fractional Volterra problems under uncertainty, and the numerical impacts manifest the accuracy and competence of the algorithm. Overall, our work contributes to the advancement of mathematical tools for solving complex fractional Volterra problems under uncertainty and shows potential to impact various fields of science and engineering, as depicted in the utilized figures, tables, and comparative analysis. The findings of the study are evaluated based on the analysis conducted, and a numerical algorithm is presented in the final section, along with several suggestions for future research directions.

1 Introduction

In recent years, fuzzy calculus and fuzzy integrodifferential models have gained significant attention due to their ability to model complex real-world problems that are inherently imprecise or uncertain [13]. Fuzzy calculus extends traditional calculus by incorporating the concept of fuzzy sets, which allows for the representation of uncertain or vague data in a mathematical framework. Fuzzy integrodifferential models combine the concepts of fuzzy sets and integrodifferential equations to model systems that involve both memory and uncertainty. In contrast, fractional calculus has emerged as a mighty mathematical tool for the formation of complex systems in various fields of science and engineering [46]. Recently, there has been a growing fascination with extending the concepts of fractional calculus to fuzzy environments, where the parameters of the system are not precisely defined but are instead represented by fuzzy numbers. This has led to the development of fuzzy fractional calculus, which has shown promising results in modeling and analyzing complex systems under uncertainty [79]. In this article, we will explore the concept of fuzzy fractional calculus and its application to FM-FIDMs. We will discuss the fundamental concepts of fuzzy calculus and fractional M-calculus, and then show how the two concepts can be combined to form a powerful tool for modeling and analyzing fuzzy systems represented by Volterra patterns. We will also present some examples of FM-FIDMs and their solutions utilizing HRKA, showcasing the productivity of our approach.

HRKA is a powerful mathematical tool that has found numerous products in assorted areas of stochastics and nonlinear phenomena [1012]. The algorithm is based on the theory of Hilbert spaces, which provides a framework for the study of functions and their properties. HRKA is particularly useful for solving problems involving function approximation, interpolation, and regression, and has been used in applications such as machine learning, signal processing, and control theory [1322]. One of the key characteristics of HRKA is its ability to represent functions in terms of inner products, which allows for efficient computation of function values and derivatives. This property is closely related to the concept of reproducing kernels, which are positive definite functions that satisfy certain properties. The construction of the reproducing kernel is an important aspect of HRKA and involves finding a function that satisfies the reproducing property and other properties that ensure its suitability for the problem at hand.

HRKA is a powerful mathematical framework used in applied mathematics, applied physics, machine learning, and other fields [1012]. It offers several advantages over other approaches when it comes to solving NLDMs. Some of the distinguishing features of HRKA are as follows:

1. Nonlinear modeling: HRKA can capture nonlinear relationships between variables, making it a powerful tool for modeling NLDMs.

2. Flexibility: HRKA is very flexible and can be used to model a wide range of NLDMs, including those with complex constraint conditions.

3. High-dimensional feature space: HRKA maps data points into a high-dimensional feature space, where linear methods can be used to perform nonlinear tasks. This makes it possible to solve complex NLDMs using simple successive techniques.

4. Reproducing property: HRKA has a unique property called the reproducing property, which allows the evaluation of functions in the reproducing Hilbert space at any point in the input space. This means that it can be used to interpolate solutions to NLDMs and make predictions at any point in the input space.

5. Regularization: HRKA uses regularization to control the complexity of the model and prevent overfitting. This is performed by introducing a penalty term in the objective function that penalizes large coefficients in the model.

Indeed, when using HRKA to solve NLDMs, these advantages translate into several distinct benefits.

1. Accuracy: The flexibility of HRKA allows it to accurately model complex NLDMs, producing solutions with high accuracy.

2. Efficiency: The use of high-dimensional feature space and simple successive techniques can make HRKA more computationally efficient than other methods for solving NLDMs.

3. Interpolation: The reproducing property of HRKA allows it to interpolate solutions to NLDMs, making it possible to accurately predict values at any point in the input space.

4. Regularization: The use of regularization helps prevent overfitting, producing more reliable solutions to NLDMs.

Generally, HRKA offers several advantages over other approaches when it comes to solving NLDMs. Its ability to model nonlinear relationships, flexibility, use of high-dimensional feature space, reproducing property, and regularization all contribute to its accuracy, efficiency, and ability to interpolate solutions.

This article delves into two important mathematical concepts: the existence-uniqueness and characterization theorems, and the simulated HRKA. In the first part, we explore the theorem’s significance in proving the existence-uniqueness of fuzzy two M-solutions, and we will discuss how the characterization theorem helps us provide a framework for understanding the proof. In the second part, we delve into HRKA, which is a powerful tool for analyzing numerical approximations and their properties. Through this, we will explore our requirements for the following general model:

RMv,wͷ=hͷ,ͷ+0ͷkͷ,x,xdx,0=Ɯ.(1)

Here, ͷ:=0,1, x0,ͷ, vD(0,1, w>0, ƜR, ,R, h×R,R, and k2×R,R. Indeed, RMv,wͷ is the FM-D of order v, concerning the Mittag–Leffler parameter w, and R denotes the set of fuzzy numbers.

FM-D is a relatively new concept in the field of fractional calculus. It was introduced as an innovative class of fractional derivatives that has some advantages over other fractional approaches, such as Riemann or Caputo derivatives. One of the main advantages of FM-D is that it preserves the chain rule of differentiation. This means that if we apply FM-D to a composite function, we can use the chain rule to simplify the result. This property is not shared by other fractional derivatives, which can make it difficult to apply them in practice. Another advantage of FM-D is that it is more closely related to the ordinary derivative than other fractional derivatives. In particular, it satisfies a version of the Leibniz rule, which allows us to differentiate products of functions naturally. This makes it easier to use FM-D in applications where we need to differentiate products of functions, such as in physics and engineering [2328]. It also has some interesting mathematical properties that make it an attractive tool for studying fractional models. For example, it has been shown that FM-D can be used to obtain exact solutions for certain types of fractional models. This could be useful in applications where we need to solve NLDMs that involve fractional derivatives. Other theoretical and application results concerning fractional calculus patterns with several constraints and types can be collected from [2935]. Overall, FM-D is a promising new tool in the branch of calculus, and it shows potential to be useful in a wide range of applications.

After the preliminary stage and the problem formulation phase, the study is structured as follows: Section 2 provides an overview of fuzzy calculus and FM-D. Section 3 introduces fuzzy FM-D as differentiation and continuity, followed by fuzzy FM-I as integration and inversion. In Section 4, we examine FM-FIDM as structures, tools, and steps, while Section 5 presents a new characterization theorem. Section 6 introduces HRKA in terms of structures and tools, and Section 7 implements HRKA as structures and tools. Section 8 showcases the numerical implementations and computed results. Finally, Section 9 presents the key points and summary of the study.

2 Outline of fuzzy calculus and FM-D

Herein, we will delve into the concept of fuzzy numbers, which are an essential tool in the fuzzy set theory. Fuzzy numbers are a generalization of traditional real numbers, allowing for uncertainty and imprecision to be incorporated into numerical values. We will explore the θ-cut concerning fuzzy numbers, their metric structure, and their fundamental theorem, which establishes the relationship between fuzzy numbers and intervals. Additionally, we will discuss the concept of H-difference.

Specifically, substitute I0,1 and θI0, and set Ɯθ=ƻR|Ɯƻθ and Ɯ0=ƻR|Ɯƻ>0¯. Then, ƜR if Ɯθ is a compact convex in R and Ɯ1ϕ [36]. So, if ƜR, then Ɯθ=Ɯ1θ,Ɯ2θ whenever Ɯ1θ=minƻ|ƻƜθ and Ɯ2θ=maxƻ|ƻƜθ. Hitherto, Ɯθ is the θ-cut of Ɯ. For simplicity, Ɯ1θƜ1θ and Ɯ2θƜ2θ.

Theorem 1. [36] Presume that Ɯ1,2:IR fulfills the following criterion: Ɯ1 nondecreasing bounded and Ɯ2 nonincreasing bounded, limθyƜ1,2θ=Ɯ1,2y and limθ0+Ɯ1,2θ=Ɯ1,20, and yI0: Ɯ11Ɯ21. Then, Ɯ:RI with Ɯƻ=supθ|Ɯ1θƻƜ2θ belongs to R with parameterization Ɯ1θ,Ɯ2θ. Likewise, if Ɯ1,2:IR belongs to R with parameterization Ɯ1θ,Ɯ2θ, then Ɯ1,2 meets the previously mentioned requirements.

For a more in-depth explanation, let Ɯ,Ɯ¯R. If ƜR with Ɯ¯+Ɯ=Ɯ, then Ɯ entitled the H-difference of Ɯ,Ɯ¯ is denoted by ƜƜ¯, whereas implies constantly to the H-difference being mindful of ƜƜ¯Ɯ+1Ɯ¯=ƜƜ¯. Whenever the H-difference ƜƜ¯ exists, ƜƜ¯θ=Ɯ1θƜ¯1θ,Ɯ2θƜ¯2θ.

A metric R,d is complete with d:R2R+0 and dƜ,Ɯ¯=supθImaxƜ1θƜ¯1θ,Ɯ2θƜ¯2θ. R at ͷ* provided ε>0 and ͷ; δ>0 with dͷ,ͷ*<ε whenever ͷͷ*<δ. Undoubtedly, is continuous over ; if it is continuous, ͷ. h×R,R at ͷ*,z* in ×R provided ε>0 and δε,θ>0 with dfͷ,z,fͷ*,z*<ε whenever ͷ*ͷ<δ and dz,z*<δ, ͷ and zR. Similarly, for k2×RR. Indeed, if ,R be the set of all continuous :R mapping, then d1:,R×,RR+0 with d11,2=supͷd1ͷ,2ͷeͷ, 1,2,R, where R is fixed. It is evidenced in [37] that ,R,d1 is a complete metric.

Using a pair of fuzzy functions and the θ-cut approach, the Zadeh extension principle allows us to perform fuzzy arithmetic operations in a fuzzy setting.

Theorem 2. [37] If UCR2R, then CR2R and Ɯ,Ɯ¯θ=UƜθ,Ɯ¯θ, Ɯ,Ɯ¯R, and θI.

In the following paragraphs, we will explore the concept of FM-D, which is a memorization of conformable scaling derivative. We will start by defining FM-D and discussing its mathematical properties, including its relationship to classical derivatives, and its applications in various fields of study. Additionally, we will examine several related results that shed light on the behavior of FM-D and its significance in understanding the complexity of real-world phenomena.

FM-D has several tools in engineering and applied sciences [2328]. For example, it can be used to model non-Newtonian fluids, which exhibit complex and nonlinear behaviors that cannot be described by ordinary derivatives. In addition, it can be used to simulate fractional-order systems, like electrical circuits and control systems, which exhibit memory effects and other non-ideal behaviors. However, FM-D is a generalization of the classical derivative to noninteger values of the differentiation of order vD concerning the Leffler parameter w.

Definition 1. [23] Let UCR. Then, FM-D of order vD concerning the Leffler parameter w of U at ͷ is

RMv,wUͷ=limε0UͷEwεͷvUͷε,ͷ>0,limͷ0+RMv,wUͷ,ͷ=0.(2)

Herein, Ewͷ=y=0ͷyΓwy+1 is the infinite Mittag–Leffler operator with w>0 and ͷ>0. It is assumed that U is v,w-differentiable whenever U is differentiable ͷ. Indeed, RMv,wU0 exists whenever limͷ0+RMv,wUͷ exists.

Using the FM-D definition as our foundation, we can showcase the linearity of FM-D, as well as its adherence to fundamental rules, such as the product, composition, quotient, and chain rules for two v,w-differentiable functions. Additionally, the derivative of a constant is indeed zero. However, whenever UR is v,w-differentiable at ͷ* with vD and w>0, then U is continuous at ͷ*. Indeed, what sets FM-D apart from other fractional approaches is its primary and fundamental differentiation rule, which is RMv,wUͷ=ͷ1vΓw+1Uͷ. For example, RMv,wΓw+1vͷv=1 and RMv,w1=0.

Definition 2. [23] Let UCR. Then, FM-I of order vD with w>0 of U at ͷ is

IMv,wUͷ=Γw+10ͷUxx1vdx.(3)

Next, theoretical results are employed to elucidate the relationship between FM-D and FM-I behaviors. Specifically, the inversion formula and the fundamental theorem of calculus are utilized in the sense of fractional M-calculus.

Theorem 3. [23] For vD, w>0, and ͷ, then

i. If UCR and IMv,wU exists, then RMv,wIMv,wUͷ=Uͷ.

ii. If UR is v,w-differentiable and IMv,wU exists, then IMv,wRMv,wUͷ=UͷU0.

For additional information on the FM-D, FM-I, and Mittag–Leffler parameter, including further results, historical notes, characteristics, applications, and methods, please refer to [2328].

3 Fuzzy FM-D: differentiation and continuity

Foremost, we present the fuzzy FM-D concept, its definitions, and its properties. We utilize a new strongly generalized fuzzy FM-D delineation for a value of order vD with w>0 in two inclusive phases. The derivative representation theory and continuity results are also exhibited.

Definition 3. Let ,R with vD and w>0. Then, is a strongly generalized fuzzy FM-D at ͷ if RMv,wͷR with one among the succeeding is met:

i. ϵ>0 small-scale, ͷEwεͷvͷ exists, and

RMv,wͷ=limε0ͷEwεͷvfͷε,ͷ>0,limͷ0+RMv,wͷ,ͷ=0.(4)

ii. ϵ>0 small-scale, ͷͷEwεͷv exists, and

RMv,wͷ=limε0ͷͷEwεͷvε,ͷ>0,limͷ0+RMv,wͷ,ͷ=0.(5)

Definition 4. Let C,R with vD and w>0. Then,

i. is apparently v1,w-fuzzy FM-D on if concerning (4) is v,w-differentiable.

ii. is apparently v2,w-fuzzy FM-D on if concerning (5) is v,w-differentiable.

Undoubtedly, the fuzzy FM-Ds of will be characterized as RMv1,w and RMv2,w in phases (i) and (ii), sequentially. The next termination pertains to the intersection of fuzzy FM-D and crisp differentiability.

Theorem 4. Let ,R with vD and w>0. Then,

i. If is v1,w-fuzzy FM-D, then 1θͷ and 2θͷ are v,w-differentiable on with

RMv1,wͷθ=RMv,w1θͷ,RMv,w2θͷ.(6)

ii. If is v2,w-fuzzy FM-D, then 1θͷ and 2θͷ are v,w-differentiable on with

RMv2,wͷθ=RMv,w2θͷ,RMv,w1θͷ.(7)

Proof. Here, our attention will be directed toward (i), while a comparable proof can be utilized for (ii). Assuming that ͷ is fixed, according to the given assumptions, one obtains

ͷEwεͷvͷθ=1θͷEwεͷv1θͷ,2θͷEwεͷv2θͷ.(8)

Multiplying by 1ε, we get

ͷEwεͷvͷεθ=1θͷEwεͷv1θͷε,2θͷEwεͷv2θͷε.(9)

Passing to the limit, we get 1θ and 2θ as v,w-differentiable on with

RMv1,wͷθ=RMv,w1θͷ,RMv,w2θͷ.(10)

Theorem 5. Let C,R with vD and w>0. If R1ͷθ=1θͷ,2θͷ and R2ͷθ=2θͷ,1θͷ, then

i. If is v1,w-fuzzy FM-D, then

RMv1,wͷθ=ͷ1vΓw+1R1ͷθ.(11)

ii. If is v2,w-fuzzy FM-D, then

RMv2,wͷθ=ͷ1vΓw+1R2ͷθ.(12)

Proof: Here, our attention will be directed toward (i), while a comparable proof can be utilized for (ii). Assuming that ͷ is fixed, according to the given assumptions, one obtains

RMv1,wͷθ=RMv,w1θͷ,RMv,w2θͷ=limε01θͷEwεͷv1θͷε,limε02θͷEwεͷv2θͷε.(13)

Since Ewͷ=y=0ͷyΓwy+1=1+ͷΓw+1+ͷ2Γ2w+1+, so

ͷEwεͷv=y=01εͷvyΓwy+1=ͷ+εͷ1vΓw+1+ͷεͷv2Γ2w+1+=ͷ+εͷ1vΓw+1+Oε2.(14)

Take h=εͷ1v1Γw+1+Oε, so ε=hͷ1v1Γw+1+Oε, wheres if ε0, then h0. Thereafter,

1θͷ+εͷ1vΓw+1+Oε21θͷε=1θͷ+h1θͷhͷv11Γw+11+Γw+1Oε.(15)
2θͷ+εͷ1vΓw+1+Oε22θͷε=2θͷ+h2θͷhͷv11Γw+11+Γw+1Oε.(16)

Thus, one can formulate

RMv1,wͷθ=[ͷ1vΓw+1limh01θͷ+h1θͷh1+Γw+1Oε,ͷ1vΓw+1limh02θͷ+h2θͷh1+Γw+1Oε]=ͷ1vΓw+11θͷ,2θͷ=ͷ1vΓw+1R1ͷθ.(17)

Theorem 6. Let ,R with vD and w>0. Then,

i. If is v1,w-fuzzy FM-D at ͷ*, then Cͷ*,R.

ii. If is v2,w-fuzzy FM-D at ͷ*, then Cͷ*,R.

Proof. Here, our attention will be directed toward (i), while a comparable proof can be utilized for (ii). Assuming that ͷ*, ϵ>0 being small enough, one obtains

ͷ*Ewεͷ*vͷ*=ͷ*Ewεͷ*vͷ*εε.(18)

Catch the limits on both sides of Eq. 18 to obtain

limε0ͷ*Ewεͷ*vͷ*=limε0ͷ*Ewεͷ*vͷ*εε=limε0ͷ*Ewεͷ*vͷ*εlimε0ε.(19)

Utilizing (14), one obtains

limε0ͷ+εͷ1vΓw+1+Oε2ͷ=ͷ1vΓw+1R1ͷ0.(20)

It becomes apparent that limh0ͷ+hͷ=χ0, limh0+ͷ*+hͷ*=χ0, or limh0+ͷ*+h=ͷ*. Thus, one infers that is continuous at ͷ*. ■

4 Fuzzy FM-I: integration and inversion

After utilizing several fuzzy FM-D results, a new approach for the fuzzy FM-I for of order vD with w>0 is suggested together with various properties. Indeed, the fuzzy inversion formulas and the fuzzy fundamental theorem of fuzzy fractional M-calculus are exhibited.

In this section, IMv,w is the fuzzy FM-I of order vD with w>0 concerning the reference point 0.

Definition 5. Assume C,R, vD, and w>0. Then, the fuzzy FM-I of at ͷ is constructed as

IMv,wͷ=Γw+10ͷxx1vdx.(21)

Theorem 7. Let C,R with vD and w>0. Then,

i. IMv,wͷR

ii. IMv,wͷθ=IMv,w1θͷ,IMv,w2θͷ.

Proof. First, ͷ with ͷ>0 define g:R as gͷ=0ͷ2θxx1v1θxx1vdx. Because 2θx1θx0 and x1v>0 yield 2θͷͷ1v1θͷͷ1v>0 or g is increasing, so gͷ>g0 or 0ͷ2θxx1vdx>0ͷ1θxx1vdx. In other formations, IMv,w2θͷ>IMv,w1θͷ or IMv,wͷR.

For part (ii) take Sͷ,θ:=IMv,w1θͷ,IMv,w2θͷ, then ͷ and θI; Sͷ,θ is a compact convex in R with Sͷ,1ϕ. So,

Sͷ,θ=0ͷΓw+1x1v1θxdx,0ͷΓw+1x1v2θxdx=0ͷΓw+1x1v1θx,2θxdx=0ͷΓw+1x1vxθdx=0ͷΓw+1x1vxdxθ=IMv,wͷθ.(22)

The results in [36] produce Sͷ,θR and Sͷ,θ=IMv,wͷθ. ■

Theorem 8. Let C,R with vD and w>0. Then,

i. RMv1,wIMv,wͷ=ͷ when is v1,w-fuzzy FM-D.

ii. RMv2,wIMv,wͷͷ=0 when is v2,w-fuzzy FM-D.

ProofFor part (i), ͷ, utilizing Theorem 6 and Theorem 8 with wD and w>0, one obtains

RMv1,wIMv,wͷθ=ͷ1vΓw+1R1IMv,wͷθ=ͷ1vΓw+1ddͷIMv,w1θͷ,ddͷIMv,w2θͷθ=ͷ1vΓw+1ddͷΓw+10ͷ1θx1vdxͷ,ddͷΓw+10ͷ2θx1vdxͷθ=ͷ1vΓw+1Γw+11θͷ1v,Γw+12θͷ1vθ=1θͷ,2θͷθ=ͷθ.(23)

Thus, RMv1,wIMv,wͷ=ͷ. For part (ii), it is possible to write

RMv2,wIMv,wͷθ=ͷ1vΓw+1R2IMv,wͷθ=ͷ1vΓw+1ddͷIMv,w2θͷ,ddͷIMv,w1θͷ=ͷ1vΓw+1ddͷΓw+10ͷ2θx1vdx,ddͷΓw+10ͷ1θx1vdx=ͷ1vΓw+1Γw+12θͷ1v,Γw+11θͷ1v=2θͷ,1θͷ.(24)

The rearranging of Eq. 24 gives RMv2,wIMv,wͷθͷθ=0 or RMv1,wIMv,wͷͷ=0. ■

Theorem 9. Let C1,R with vD and w>0. Then,

i. IMv,wRMv1,wͷ=ͷ0 when is v1,w-fuzzy FM-D.

ii. 0=ͷIMv,wRMv2,wͷ when is v2,w-fuzzy FM-D.

Proof. For part (i), θI, it holds that

IMv,wRMv1,wͷθ=Γw+10ͷRMv1,wxx1vdxθ=Γw+10ͷRMv,w1θxx1vdx,Γw+10ͷRMv,w2θxx1vdx=0ͷΓw+1x1vx1vΓw+1ddx1θxdx,0ͷΓw+1x1vx1vΓw+1ddx2θxdx=0ͷddx1θxdx,0ͷddx2θxdx=1θx1θ0,2θx2θ0=1θͷ,2θͷ1θ0,2θ0=ͷθ0θ.(25)

Thereafter, IMv,wRMv1,wͷ=ͷ0. Moreover, for part (ii), one obtains

IMv,wRMv2,wͷθ=Γw+10ͷRMv2,wxx1vdxθ=Γw+10ͷRMv,w2θxx1vdx,Γw+10ͷRMv,w1θxx1vdx=0ͷΓw+1x1vx1vΓw+1ddx2θxdx,0ͷΓw+1x1vx1vΓw+1ddx1θxdx=0ͷddx2θxdx,0ͷddx1θxdx=2θx2θ0,1θx1θ0.(26)

The rearranging of Eq. 26 gives

IMv,wRMv2,wͷθ+2θͷ1θͷ=2θ01θ0.(27)

Thus, IMv,wRMv2,wͷθ+ͷθ=0θ or 0=ͷIMv,wRv2,wͷ. ■

5 FM-FIDM: structures, steps, and tools

This section delves into the examination of existence-uniqueness outcomes for coupled fuzzy solutions associated with v1,w- and v1,w-fuzzy FM-D methodologies. Additionally, this part includes the provision of a computational algorithm and characterization theorem.

5.1 FM-FIDM formalism

Applying the strongly generalized v,w-fuzzy FM-D on the considered FM-FIDM; new CM-FIDM coupled equations generate conditionality on v1,w or v1,w differentiability types used.

The functional framework of FM-FIDM utilizing can be prioritized as

RMv,wͷ=hͷ,ͷ+0ͷkͷ,x,xdx,0=Ɯ.(28)

The θ-cut of ͷ,hͷ,ͷ,kͷ,x,x,Ɯ can be swapped in Eq. 33, concerning the next corresponding terms:

hͷ,ͷθ=h1θͷ,1θͷ,2θͷ,h2θͷ,1θͷ,2θͷ,kͷ,x,xθ=k1θͷ,x,1θx,2θx,k2θͷ,x,1θx,2θx.(29)

Thus, this leads to the determination of the subsequent coupled CM-FIDMs concerning v,w-fuzzy FM-D as

RMv1,wͷ=hͷ,ͷ+0ͷkͷ,x,xdx,0=Ɯ.(30)
RMv2,wͷ=hͷ,ͷ+0ͷkͷ,x,xdx,0=Ɯ.(31)

Definition 6. Let C1,R with vD and w>0 be such that RMv1,wͷ or RMv2,wͷ exists. Then,

i. If ͷ and RMv1,wͷ satisfy (Eq. 30), then ͷ is considered a 1-fuzzy M-solution of Eq. 28.

ii. If ͷ and RMv2,wͷ satisfy (Eq. 31), then ͷ is considered a 2-fuzzy M-solution of Eq. 28.

Algorithm 1.To construct a 1 or 2-fuzzy M-solution of Eq. 38, the following coupled CM-FIDMs should be included.

Phase I. If ͷ is v1,w-fuzzy FM-D on , then use (Eq. 33) and apply the following steps:

i. Solve v1,w-CM-FIDMs to the source 1θͷ,2θͷ.

ii. Validate that 1θͷ,2θͷ and RMv,w1θͷ,RMv,w2θͷ are acceptable sets.

iii. Fit a 1-fuzzy M-solution ͷ with ͷθ=1θͷ,2θͷ.

Phase II. If ͷ is v2,w-fuzzy FM-D on , then use (Eq. 31) and apply the following steps:

i. Solve the v2,w-CM-FIDMs to the source 1θͷ,2θͷ.

ii. Validate that 1θͷ,2θͷ and RMv,w2θͷ,RMv,w1θͷ are acceptable sets.

iii. Fit a 2-fuzzy M-solution ͷ with ͷθ=1θͷ,2θͷ.

5.2 Existence-uniqueness of two fuzzy M-solutions

Our focus in this study is to address two main questions. First, we aim to identify the conditions under which solutions for FM-FIDM (28) exist. Second, we aim to determine under what circumstances two unique fuzzy M-solutions exist, with one solution for an individual crosswise fuzzy FM-D.z

Lemma 1. FM-FIDM (28) with hC×RR and kC2×RR is equivalent to

i. ͷ=Ɯ+0ͷΓw+1ƻ1vhƻ,ƻdƻ+0ͷΓw+1ƻ1v0ƻkƻ,x,xdxdƻ.

ii. ͷ=Ɯ10ͷΓw+1ƻ1vhƻ,ƻdƻ10ͷΓw+1ƻ1v0ƻkƻ,x,xdxdƻ.

This depends on v1,w- or v1,w-fuzzy FM-D, sequentially.

Proof. For part (i), because hC×RR and kC2×RR, they are integrable. First, considering v1,w-fuzzy FM-D and applying fuzzy integration once to both sides of Eq. 30, an equivalent form can be expressed as

ͷ=0+0ͷΓw+1ƻ1vhƻ,ƻdƻ+0ͷΓw+1ƻ1v0ƻkƻ,x,xdxdƻ.(32)

Considering v2,w-fuzzy FM-D and applying fuzzy integration once to both sides of Eq. 31, an equivalent form can be expressed as

0=ͷ+10ͷΓw+1ƻ1vhƻ,ƻdƻ+10ͷΓw+1ƻ1v0ƻkƻ,x,xdxdƻ.(33)

This is tantamount to the format presented in part (ii) of Lemma 1. ■

From Lemma 1, one can consider CR as a solution to (28) if satisfies phases (i) or (ii) of Definition 4 in the sense of v1,w- or v1,w-fuzzy FM-D, sequentially.

Ƥ:,R,R is a contraction on ,R,d. If γR alongside γ<1 with dG,GƔγd,Ɣ, ,Ɣ,R, whilst Ɣ,R is a fixed point of Ƥ when Ƥ=. Moreover, any Ƥ of ,R,d into itself presence of a sole fixed point.

Lemma 2. Both ν,ω:R with R defined as νͷ=121eͷͷeͷ and ωͷ=11eͷ are nondecreasing with ν1=supͷνͷ, ω1=supͷωͷ, and lim+ν1+ω1=0.

Proof. Since νͷ=ͷeͷ>0 and ωͷ=eͷ>0, so ν,ω are , ν1=supͷνͷ, and ω1=supͷωͷ. Indeed, by employing limit techniques, one obtains

Lim+ν1+ω1=lim+121ee+11e=lim+11+11e2e=0.(34)

It is important to note that the presence of a unique fixed point is assured by Lemma 2, which is relevant to the subsequent theorem. This means that a distinct fuzzy M-solution exists for (28) for every type of differentiability.

Theorem 10. Let hC×R,R with wD. If K>0, such that ͷ, one has

d1ƻ1vhƻ,ξ1ƻ,1ƻ1vhƻ,ξ2ƻK1dξ1ƻ,ξ2ƻ,d1ƻ1vkƻ,x,ξ1x,1ƻ1vkƻ,x,ξ2xK2dξ1x,ξ2x.(35)

Then,

i. FM-FIDM (28) possesses a unique fuzzy M-solution in concerning v1,w-fuzzy FM-D.

ii. FM-FIDM (28) possesses a unique fuzzy M-solution in concerning v2,w-fuzzy FM-D.

Proof. Here, our attention will be directed toward (i), while a comparable proof can be utilized for (ii). However, ζͷR defines Ƥ:C,RC,R as

Ƥζͷ=Ɯ+0ͷΓw+1ƻ1vhƻ,ζƻdƻ+0ͷΓw+1ƻ1v0ƻkƻ,x,ζxdxdƻ.(36)

First, we want to confirm whether the hypothesis of the Banach theorem is satisfied well by Ƥζ. However, ζ1,ζ2C,R yields

d1Gξ1,Gξ2=supͷdƤξ1ͷ,Ƥξ2ͷeͷ=supͷdƜ+0ͷΓw+1ƻ1vhƻ,ξ1ƻdƻ+0ͷΓw+1ƻ1v0ƻkƻ,x,ξ1xdxdƻ,Ɯ+0ͷΓw+1ƻ1vhƻ,ξ2ƻdƻ+0ͷΓw+1ƻ1v0ƻkƻ,x,ξ2xdxdƻeͷ=Γw+1supͷd0ͷ1ƻ1vhƻ,ξ1ƻdƻ+0ͷ1ƻ1v0ƻkƻ,x,ξ1xdxdƻ,0ͷ1ƻ1vhƻ,ξ2ƻdƻ+0ͷ1ƻ1v0ƻkƻ,x,ξ2xdxdƻeͷΓw+1supͷd0ͷ1ƻ1vhƻ,ξ1ƻdƻ,0ͷ1ƻ1vhƻ,ξ2ƻdƻeͷ+d0ͷ1ƻ1v0ƻkƻ,x,ξ1xdxdƻ,0ͷ1ƻ1v0ƻkƻ,x,ξ2xdxdƻeͷΓw+1supͷd0ͷ1ƻ1vhƻ,ξ1ƻdƻ,0ͷ1ƻ1vhƻ,ξ2ƻdƻ)eͷ+d0ͷ0ƻ1ƻ1vkƻ,x,ξ1xdxdƻ,0ͷ0ƻ1ƻ1vkƻ,x,ξ2xdxdƻeͷΓw+1supͷ0ͷd1ƻ1vhƻ,ξ1ƻ,1ƻ1vhƻ,ξ2ƻ)dƻeͷ+0ͷ0ƻd1ƻ1vkƻ,x,ξ1x,1ƻ1vkƻ,x,ξ2x)dxdƻeͷ}Γw+1supͷ0ͷK1dξ1ƻ,ξ2ƻdƻeͷ+0ͷ0ƻK2dξ1x,ξ2xdxdƻeͷΓw+1maxK1,K2supͷ0ͷd1ξ1,ξ2eƻdƻeͷ+0ͷ0ƻd1ξ1,ξ2exdxdƻeͷΓw+1maxK1,K2d1ξ1,ξ2supͷ0ͷeƻdƻeͷ+0ͷ0ƻexdxdƻeͷΓw+1maxK1,K2d1ξ1,ξ2supͷeͷ0ͷeƻdƻ+eͷ0ͷ0ƻexdxdƻ=Γw+1maxK1,K2d1ξ1,ξ2supͷeͷ12eͷ1ͷ+eͷ1eͷ1=Γw+1maxK1,K2d1ξ1,ξ2supͷ121eͷͷeͷ+11eͷ=Γw+1maxK1,K2d1ξ1,ξ2121eͷe+11e=Γw+1maxK1,K211+11e2ed1ξ1,ξ2.(37)

Utilize Lemma 2 and choose >0 as Γw+1maxK1,K211+11e2e<1. However, Ƥ is contractive, and so, a unique fixed point concerning Ƥ belongs to ,R. By the Banach theorem, FM-FIDM (Eq. 28) has a unique fixed point, ,R or Ƥ=. Thereafter, considering (Eq. 36), one obtains

ͷ=Ɯ+0ͷΓw+1ƻ1vhƻ,ζƻdƻ+0ͷΓw+1ƻ1v0ƻkƻ,x,ζxdxdƻ.(38)

Furthermore, differentiate (Eq. 38) and substitute ͷ=0 to gain the FM-FIDM (Eq. 28). So, any fuzzy M-solution of Eq. 30 must satisfy (Eq. 36), and conversely. ■

6 New characterization theorem

Herein, the characterization theorem suggests a general approach for solving FM-FIDM—we can convert it into a couple of CM-FIDMs, which have extensively studied solution techniques. By solving the crisp system, we can obtain solutions for the original FM-FIDM. Therefore, there is no need to rewrite the algorithms in a fuzzy setting; instead, they can be directly applied to the acquired coupled crisp equations.

An h:×R2R is equicontinuous if ϵ>0 and ͷ,x,y×R2; hͷ,x,yhͷ,x1,y1<ϵ whenever ͷ,x1,y1ͷ,x,y<δ and exhibit uniform boundedness over every bounded set. Similarly, for k:2×R2R.

Theorem 11. Consider FM-FIDM (33), where h:×RR and k:2×RR are such that

i. h1,2θ and k1,2θ exhibit both equicontinuity and uniform boundedness over every bounded set.

ii. L1,L2>0 as

h1,2θͷ,1θͷ,2θͷh1,2θͷ,Ɣ1θͷ,Ɣ2θͷL1max1θͷƔ1θͷ,2θͷƔ2θͷ,k1,2θͷ,x,1θx,2θxk1,2θͷ,x,1θx,2θxL2max1θͷƔ1θͷ,2θͷƔ2θͷ.(39)

Then,

i. For v1,w-fuzzy FM-D, FM-FIDM (Eq. 28) and the coupled CM-FIDMs (Eq. 30) are equivalent.

ii. For v2,w-fuzzy FM-D, FM-FIDM (Eq. 28) and the coupled CM-FIDMs (Eq. 31) are equivalent.

Proof. Here, our attention will be directed toward (i), while a comparable proof can be utilized for (ii). However, it is assumed that is v1,w-fuzzy FM-D. The equicontinuity of h1,2θ and k1,2θ implies the continuity of h and k, sequentially. The Lipschitzian in (ii) ensures that h and k are Lipschitzian, concerning R,d as

dhͷ,ͷ,hͷ,Ɣͷ=supθIdHhͷ,ͷθ,hͷ,Ɣͷθ=supθImaxh1θͷ,ͷh1θͷ,Ɣͷ,h2θͷ,ͷh2θͷ,Ɣͷ=supθImax{h1θͷ,1θͷ,2θͷh1θͷ,Ɣ1θͷ,Ɣ2θͷ,h2θͷ,1θͷ,2θͷh2θͷ,Ɣ1θͷ,Ɣ2θͷ}L1supθImax1θͷƔ1θͷ,2θͷƔ2θͷ=L1supθIdHͷθ,Ɣͷθ=L1dͷ,Ɣͷ.(40)

Similarly, one obtains

dkͷ,x,x,kͷ,x,ƔxL2dx,Ɣx.(41)

The continuity of h and k, the Lipschitzian in Eqs 39, 40, and the property (i) show that FM-FIDM (Eq. 28) owns a unique solution. However, the fuzzy M-solution of Eq. 30 is v1,w-fuzzy FM-D; so, by phase (i) in Theorem 5; 1θ and 2θ are v,w-differentiable. Thereafter, 1θͷ,2θͷ is a crisp solution for the coupled CM-FIDMs (Eq. 30).

Conversely, presume that 1θͷ,2θͷ with θI is fixed is a 1-fuzzy M-solution of Eq. 28 [The property (ii) guarantees the existence of this solution, as can be seen by inspection]. The Lipschitzian in Eqs 40, 41 imply the existence-uniqueness of the 1-fuzzy M-solution ͷ. Seeing as x is v1,w-fuzzy FM-D, so the 1θͷ and 2θͷ endpoints of ͷθ are a solution for CM-FIDMs (Eq. 30). However, the solution of CM-FIDMs (Eq. 30) is unique, so ͷθ=1θͷ,2θͷθ=1θͷ,2θͷθ=ͷθ, or FM-FIDM (Eq. 28) and the coupled CM-FIDMs (Eq. 30) are equivalent. ■

The aim of the following results is not to significantly enhance Theorem 11 but instead to provide alternative criteria that establish the equivalence between FM-FIDM (Eq. 28) and the corresponding coupled CM-FIDMs (Eq. 30) and (Eq. 31).

Corollary 1. Consider FM-FIDM (Eq. 28), where h:×RR and k:2×RR. If L1,L2>0 is

h1,2θͷ1,1θͷ1,2θͷ1h1,2θͷ2,Ɣ1θͷ2,Ɣ2θͷ2L1maxͷ2ͷ1,1θͷ1Ɣ1θͷ2,2θͷ1Ɣ2θͷ2,k1,2θͷ1,x1,1θx1,2θx1k1,2θͷ2,x2,Ɣ1θx2,Ɣ2θx2L2maxͷ1ͷ2,x1x2,1θx1Ɣ1θx2,2θx1Ɣ2θx2,(42)

then,

i. For v1,w-fuzzy FM-D, FM-FIDM (Eq. 28) and the coupled CM-FIDMs (Eq. 30) are equivalent.

ii. For v2,w-fuzzy FM-D, FM-FIDM (Eq. 28) and the coupled CM-FIDMs (Eq. 31) are equivalent.

Proof. Here, our attention will be directed toward (i), while a comparable proof can be utilized for (ii). To achieve this objective, let us presume the hypothesis of Corollary 1. Thus, condition (ii) of Theorem 11 is valid. To prove (i) in Theorem 11, fix ϵ>0, let δ=ϵ/L, and set ͷ,1θͷ,2θͷͷ1,Ɣ1θͷ1,Ɣ2θͷ1<δ. Then,

h1,2θͷ1,1θͷ,2θͷh1,2θͷ2,Ɣ1θͷ1,Ɣ2θͷ1L1maxͷͷ1,1θͷƔ1θͷ1,2θͷƔ2θͷ1L1ͷ,1θͷ,2θͷͷ1,Ɣ1θͷ1,Ɣ2θͷ1L1δ=ϵ.(43)

The claim is to show h1,2θ exhibits both equicontinuity and uniform boundedness over every bounded set. To accomplish this, let S×R2 be any bounded subset. Then, x1,y1,x2,y2R as if w=ͷ,xͷ,yͷS, then ͷ, xͷx1,x2, and yͷy1,y2. Now, fix θ*I, w*S, let K=max1,x2x1,y2y1, and C=L1K+supphw*. Then, h1θwh1θw*L1max1,x2x1,y2y1=L1K and

h1θwh1θ*w*=h1θwh1θw*+h1θw*h1θ*w*h1θwh1θw*+h1θw*h1θ*w*=L1K+suppfw*=C.(44)

Since h1θwh1θ*w*h1θwh1θ*w*C or h1θwC+h1θ*w*, then h1θ is uniformly bounded on S and similarly h2θ‏. The same procedure can apply for k1,2θ as well. ■

7 HRKA: structures and tools

Although the tools of HRKA have been widely studied and operated in assorted areas of engineering and sciences [1022], the principle of reproducing kernels continues to be extensively researched. Nonetheless, HRKA has proven to be a beneficial scheme for solving a broad range of stochastics and nonlinear equations in a fractional sense and provides a generic numerical scheme for handling solution performances.

7.1 Principles and requirements

Given the Hilbert space on , a kernel ΨC2,R is reproducing for when it meets the following: first, ͷΛ:Ψ,ͷ. Second, ψ and ͷ: ψ,Ψ,ͷ=ψͷ. Here, CC,R, ͷ,θ,I, ͷθ=1θͷ,2θͷ, and Ɣͷθ=Ɣ1θͷ,Ɣ2θͷ. On account of this, ͷθ=1θͷ,2θͷ and Ɣͷθ=Ɣ1θͷ,Ɣ2θͷ,

the following requirements are essential to apply the HRKA steps:

W=ͷθT:1,2θC,1,2θL2,and 1,2θ0=0ͷθ,ƔͷθW=u=12uθ0Ɣuθ0+uθ0Ɣuθ0+uθͷƔuθͷdͷͷθW=ͷθ,ͷθW,(45)
V=ͷθT:1,2θC,1,2θL2ͷθ,ƔͷθV=u=12uθͷƔuθͷdͷ+uθͷƔuθͷdͷͷθV=ͷθ,ͷθV.,(46)
Ʒͷƻ=16ƻƻ2+3ͷ2+ƻ,ƻͷ,16ͷͷ2+3ƻ2+ͷ,ƻ>ͷ.(47)
ͷƻ=12sinh1coshͷ+ƻ1+coshͷƻ1.(48)

Fundamentally, W and V are completely reproducing kernel with corresponding kernel functions Ʒ¯ͷƻ:=Ʒͷƻ,Ʒͷƻ,¯ͷƻ:=ͷƻ,ͷƻ.

To apply HRKA, we partition upon uniform subintervals. We assume that ͷuu=1 is dense in A, which is a reasonable assumption given that compactness is similar to finiteness. It is worth noting that compactness is often associated with smallness in some sense. Our goal is to cover the entire set with a finite number of subintervals and to achieve a good approximation of using a finite number of steps.

Theorem 12. Ʒ¯ͷuƻu=1 in W is linearly independent.

Proof. We aim to exhibit Ʒ¯ͷuƻu=1m as linearly independent m1. If σuu=1m is selected as u=1mσuƷ¯ͷuƻ=0 and taking hyƻW with hyƻx=δx,y, x=1,2,,m, one possesses for y=1,2,,m that

0=hyƻ,u=1mσuƷ¯ͷuƻW=u=1mσuhyƻ,Ʒ¯ͷuƻW=u=1mσuhyƻu=σu.(49)

7.2 Illustration of the FM-FIDM solution

The HRKA methodology comprises a variety of essential elements, such as constructing Hilbert spaces that are suitable for the problem at hand, creating kernels, identifying linear operators that are appropriate, and employing Mathematica solvers. During the forthcoming, we expound on how the HRKA approach can be employed to create numerical solutions that are highly efficient for tackling FM-FIDM problems.

In our formalism, we will exclusively focus on v1,w-fuzzy FM-D, concerning FM-FIDM. However, a similar formalism can be applied to v2,w-fuzzy FM-D as well. Before we proceed, we require a transformation to appropriately fix the solutions in W. To determine this, apply ͷ:ͷƜ to (Eq. 35). However, the transformed solution is still denoted by ͷ as

RMv1,wͷ=hͷ,ͷ+0ͷkͷ,x,xdx,0=0.(50)

Set Eͷ=0ͷkͷ,x,xdx, Dͷ,ͷ,Exͷ=hͷ,ͷ+0ͷkͷ,x,xdx, and O:WV with Oͷ=Rw1ͷ. Using this, we can transform (Eq. 50) into

Oͷ=Dͷ,ͷ,Exͷ,ͷ0=0.(51)

Herein, substitute Oͷθ=Rw1ͷθ, which implies O11θͷ=RMv,w1θͷͷ and O22θͷ=RMv,w2θͷ. To arrange and build a system of orthogonal functions, substitute Suvͷ=ͷuͷev and Uuvͷ=O*Suvͷ, u=1,2,3,...,v=1,2, and O*=diagO1*,O2*. Next, Algorithm 2 derives U¯uvͷu,v=1,1,2, assuming the Gram–Schmidt scheme.

Algorithm 2.Generating orthogonalization coefficients ωxyuv and orthonormal functions U¯uvͷu,v=1,1,2.

Phase 1: For x=1,2,, y=1,2,,x, u=1,2,3,, and v=1,2, set

ωxyuv=1U11W,x=y=1,1UxyW2p=1x1Uxyͷ,U¯uvͷW2,x=y1,p=yx1Uxyͷ,U¯uvͷWωpyuvUxyW2p=1x1Uxyͷ,U¯uvͷW2,x>y.(52)

Phase 2: For u=1,2,3,... and v=1,2, set

U¯uvͷ=x=1uy=1vωxyuvUxyͷ.(53)

Theorem 13. Uuvͷu,v=1,1,2 is complete and Uuvͷ=OƻƷͷƻƻ=ͷu.

Proof. If ͷθT,UuvͷW=0, u=1,2,..., and v=1,2, then

ͷθT,UuvͷW=ͷθT,O*SuvͷW=OͷθT,SuvͷV=Oͷu=0.(54)

Since ͷθT=v=12vθͷev=v=12θT,GͷevWev, so OͷθT=v=12OͷθT,SuvͷWev=0. Utilizing the density of ͷuu=1, one possesses OͷθT=0. The existence of O1 gives ͷθT=0. Afterward, Uuvͷu,v=1,1,2 is complete in W. To complete, clearly

Uuvͷ=O*Suvͷ=O*Suvƻ,GͷƻW=Suvƻ,OƻGͷƻV=OƻƷͷƻƻ=ͷu.(55)

Call the term on the right of Eq. 51 and refer to it henceforth as

Dͷ,ͷ,Eͷθ=D1θͷ,ͷθT,EͷθT,D2θͷ,ͷθT,EͷθT.(56)

Theorem 14. Whenever n, the solution of Eq. 51 satisfies well

ͷθT=u=1v=12x=1uy=1vωxyuvDyθͷx,ͷxθT,EͷθTU¯uvͷ.(57)

Proof. Initially, ͷθT,SuvͷW=vθͷu, and u=1v=12ͷθT,U¯uvͷWU¯uvͷ is the Fourier around U¯uvͷu,v=1,1,2. Thereafter, it is convergent in W and

ͷθT=u=1v=12ͷθT,U¯uvͷWU¯uvͷ=u=1v=12ͷθT,x=1uy=1vωxyuvUxyͷWU¯uvͷ=u=1v=12x=1uy=1vωxyuvͷθT,O*SxyͷWU¯uvͷ=u=1v=12x=1uy=1vωxyuvOͷθT,SxyͷU¯uvͷ=u=1v=12x=1uy=1vωxyuvDyθͷ,ͷθT,EͷθT,SxyͷU¯uvͷ=u=1v=12x=1uy=1vωxyuvDyθͷx,ͷxθT,EͷθTU¯uvͷ.(58)

Remark 1. To perform numerical computations, we truncated (Eq. 57) and generated an n-term solution of ͷθT from

nͷθT=u=1nv=12x=1uy=1vωxyuvDyθͷx,ͷxθT,EͷxθTU¯uvͷ.(59)

7.3 Mathematical analysis: error and convergence

To analyze the habits of the HRKA solution, we derive convergence analyses and error estimates in W. Specifically, n1θTW is bounded as n, and ͷuu=1 is dense on . So, we can demonstrate the uniqueness of ͷθT in .

Theorem 15. Let Dͷ,ͷθT,EͷθTC×R4,R. If n1θTθTW0, ͷnƻ as n, then Dͷn,n1ͷnθT,En1ͷnθTθDƻ,n1ƻθT,En1ƻθTθ as n.

Proof. First, we will demonstrate that n1ͷnθTƻθT. Clearly,

n1ͷnθTƻθT=n1ͷnθTn1ƻθT+n1ƻθTƻθTn1ͷnθTn1ƻθT+n1ƻθTƻθTn1ξθTͷnƻ+n1ƻθTƻθT,(60)

where ξminͷn,ƻ,maxͷn,ƻ. So, n1ͷnθTsθT0 as n. Employing hͷ,ͷθTC×R2,R and kͷ,x,ͷθTC2×R2,R will imply the demand. ■

Afterward, symbolize Bnvθ=x=1ny=1vωxyuvDyθͷx,ͷxθT,EͷxθT. Thus,

nͷθT=u=1nv=12BuvθU¯uvͷ.(61)

Theorem 16. For (61), one obtains nͷθTͷθT as n.

Proof. Clearly, n+1ͷθT=nͷθT+v=12Bn+1vθU¯n+1vͷ. The orthogonality of U¯uvͷu,v=1,1,2 leads to

n+1θTW2=nθTW2+v=12Bn+1vθ2=n1θTW2+v=12Bnvθ2+v=12Bn+1vθ2==0θTW2+u=1n+1v=12Buvθ2.(62)

So, n+1θTWnθTW and γR with u=1v=12Buvθ2=γ, which entails v=12Buvθ2u=1x2. Indeed,

mͷθTm1ͷθTm1ͷθTm2ͷθTn+1ͷθTnͷθT.(63)

Thus, for m>n, one obtains

mθTnθTW2=mθTm1θT+m1θT+n+1θTnθTW2=mθTm1θTW2+m1θTm2θTW2+...+n+1θTnθTW2.(64)

Because mθTm1θTW2=v=12Bmvθ2, so, as n,m, one obtains mθTnθTW2=x=n+1mv=12Buvθ20. By the completeness nͷθTW with nͷθTͷθT as n in W. ■

Theorem 17. For (61), ͷθT=u=1v=12BuvθU¯uvͷ as n.

Proof. Taking limn on Eq. 61, one gets ͷθT=u=1v=12BuvθU¯uvͷ. Whilst OͷθT=u=1v=12BuvθOU¯uvͷ, so

OyͷxθT=u=1v=12BuvθOU¯uvͷ,SxyͷV=u=1v=12BuvθU¯uvͷ,O*SxyͷW=u=1v=12BuvθU¯uvͷ,UxyͷW.(65)
x=1xy=1yωxyx y O y ͷ θ T ͷ x = u = 1 v = 1 2 B u v θ U ¯ u v ͷ , x = 1 x y = 1 y ω x y x y U x y ͷ W = u = 1 v = 1 2 B u v θ U ¯ u v ͷ , U ¯ x y ͷ W = B x y θ . ( 66 )

If x = 1 , then O v ͷ 1 θ T = D v θ ͷ 1 , 0 ͷ 1 θ T , E 0 ͷ 1 θ T or O ͷ 1 θ T = D ͷ 1 , 0 ͷ 1 , E 0 ͷ 1 θ . If x = 2 , then O v ͷ 2 θ T = D v θ ͷ 2 , 1 ͷ 2 θ T , E 1 ͷ 2 θ T or O ͷ 2 θ T = D ͷ 2 , 1 ͷ 2 , E 1 ͷ 2 θ . Similarly, the form of the modality is O ͷ n θ T = D ͷ n , n 1 ͷ n , E n 1 ͷ n θ . The density gives ƻ ; ͷ n q q = 1 such that ͷ n q ƻ as q or O ͷ n q θ T = D ͷ n q , n q 1 ͷ n q , E n q 1 ͷ n q θ . Let v , by Theorem 15, one obtains O ƻ θ T = D ƻ , ƻ , E ƻ θ . Since U ¯ u v ͷ W , then ͷ θ T satisfies (51). ■

Theorem 18. If E n = θ T n θ T W , then E n n = 1 decreases in W and E n 0 as n .

Proof. From ͷ θ T and n ͷ θ T utilized in Eqs 57, 59, one obtains

E n 2 = u = n + 1 v = 1 2 ͷ θ T , U ¯ u v ͷ W U ¯ u v ͷ W 2 = u = n + 1 v = 1 2 ͷ θ T , U ¯ u v ͷ W 2 u = n v = 1 2 ͷ θ T , U ¯ u v ͷ W 2 = u = n v = 1 2 ͷ θ T , U ¯ u v ͷ W U ¯ u v ͷ W 2 = E n 1 2 . ( 67 )

Using u = 1 v = 1 2 ͷ θ T , U ¯ u v ͷ W U ¯ u v ͷ < yields that E n 2 0 as n . ■

8 Numerical implementations and computed results

The analytical formalism we have developed is not only useful for verifying the principles of HRKA but also for comparing n ͷ θ T , concerning ͷ θ T and confirming the productivity of the approach used. To demonstrate a high level of accuracy and reliability, we conducted several numerical experiments on two geometries.

8.1 Steps of HRKA and applications

Promoting software packages is a crucial aspect of computational analysis in fields such as applied stochastics and nonlinear engineering. Herein, we will now discuss two applications that can be used to present our constructions. The first application is related to electrical engineering and focuses on the fuzzy IRCC. The second application incorporates a fuzzy forcing term in its nonhomogeneous part.

In Algorithm 3, we have set the number n to 20 for all computational results, tables, and graphics. To perform these computations, we used Mathematics 11.

Algorithm 3.Steps of HRKA for handling FM-FIDM in the case of v 1 , w -fuzzy FM-D.

Phase I: Fix ͷ , ƻ in and perform

• Set ͷ u = 1 n u at u = 0,1 , , n ;

• Set θ η = η m at η = 0,1 , , m ;

• Set U u v ͷ = O ƻ Ʒ ͷ ƻ ƻ = ͷ u at u = 1,2 , , n and v = 1,2 ;

Output: U u v ͷ .

Phase II: For x = 1,2 , and y = 1,2 , , x perform Algorithm 2;

Output: ω x y u v .

Phase III: Set U ¯ u v ͷ = x = 1 u y = 1 v ω x y u v U x y ͷ at u = 1,2 , , n and v = 1,2 ;

Output: U ¯ u v ͷ .

Phase IV: Set 0 ͷ 1 θ T = 0 and at u = 1,2 , , n perform

• Set u ͷ u θ T = u 1 ͷ u θ T ;

• Set B u v θ = x = 1 u y = 1 v ω x y u v D y θ ͷ x , ͷ x θ T , E ͷ x θ T ;

• Set u ͷ θ T = y = 1 u v = 1 2 B u v θ U ¯ u v ͷ ;

Output: n ͷ θ T of ͷ θ T .

To elaborate further, let us start by demonstrating that CM-FIDM can be naturally modeled as FM-FIDM. As evidence, we consider the crisp IRCC j ͷ = R L j ͷ 1 L C 0 ͷ j x d x + v ͷ , 0 ͷ 1 concerning j 0 = a > 0 . Here, R , L , C , v represents (resistance, inductance of the solenoid, capacitance, and voltage). However, environmental factors, inaccuracies in element modeling, electrical noise, leakage, and other parameters can introduce uncertainty into the model. We provide the flowchart of the crisp IRCC in Figure 1.

FIGURE 1
www.frontiersin.org

FIGURE 1. Phasor diagram of the crisp IRCC.

By considering the ambiance fuzzy setting, we can obtain more realistic results and better detect unknown conditions in circuit analysis, as utilized in Application 1.

Application 1. We examine the fuzzy IRCC circuit concerning an AC creator:

R M v , w j ͷ = R L j ͷ + v ͷ 1 L C 0 ͷ j x d x , x < ͷ , j 0 = Ɯ , ( 68 )

concerning precise Ɯ ƻ = 25 ƻ 24 , 0.96 ƻ 1 , 100 ƻ + 101 , 1 ƻ 1.01 , and Ɯ ƻ = 0 elsewhere.

Herein, Ɯ θ = 24 25 + 1 25 θ , 101 100 1 100 θ and E j ͷ θ = 1 L C 0 ͷ j 2 θ x , 1 L C 0 ͷ j 1 θ x . Here, assuming R , L , C = 1  Ohm , 1  Henry , 1  Farad and v ͷ = sin ͷ . For finding the 1 - and 2 -fuzzy M-HRKA solutions of Eq. 68, which is commensurate to its parameterization, we have a couple of phases:

Phase 1. The coupled equation concerning v 1 , w -fuzzy FM-D is

R M v , w j 1 θ ͷ = j 2 θ ͷ 0 ͷ j 2 θ x d x + sin ͷ , R M v , w j 2 θ ͷ = j 1 θ ͷ 0 ͷ j 1 θ x d x + sin ͷ , j 1 θ 0 = 24 25 + 1 25 θ , j 2 θ 0 = 101 100 1 100 θ . ( 69 )

The exact 1 -fuzzy M-solution concerning Phase 1 is

j 1 θ ͷ = p 1 θ e 1 2 5 2 ͷ + p 2 θ e 1 2 + 5 2 ͷ + e 1 2 ͷ p 3 θ cos 3 2 ͷ + p 4 θ sin 3 2 ͷ + sin ͷ , j 2 θ ͷ = p 1 θ e 1 2 5 2 ͷ p 2 θ e 1 2 + 5 2 ͷ + e 1 2 ͷ p 3 θ cos 3 2 ͷ + p 4 θ sin 3 2 ͷ + sin ͷ . ( 70 )

Herein, p 1,2,3,4 are p 1 θ = 5 5 20 Ɯ 1 θ Ɯ 2 θ , p 2 θ = 5 + 5 20 Ɯ 1 θ Ɯ 2 θ , p 3 θ = 1 2 Ɯ 1 θ + Ɯ 2 θ , and p 4 θ = 3 6 Ɯ 2 θ Ɯ 1 θ 4 .

Phase 2. The coupled equation concerning v 2 , w -fuzzy FM-D is

R M v , w j 1 θ ͷ = j 1 θ ͷ 0 ͷ j 1 θ x d x + sin ͷ , R M v , w j 2 θ ͷ = j 2 θ ͷ 0 ͷ j 2 θ x d x + sin ͷ , j 1 θ 0 = 24 25 + 1 25 θ , j 2 θ 0 = 101 100 1 100 θ . ( 71 )

The exact 2 -fuzzy M-solution concerning Phase 2 is

j 1 θ ͷ = sin ͷ + 24 25 + 1 25 θ e 1 2 ͷ cos 3 2 ͷ + e 1 2 ͷ sin 3 2 ͷ 2 3 1 3 24 25 + 1 25 θ , j 2 θ ͷ = sin ͷ + 101 100 1 100 θ e 1 2 ͷ cos 3 2 ͷ + e 1 2 ͷ sin 3 2 ͷ 2 3 1 3 101 100 1 100 θ . ( 72 )

Application 2. We examine how FM-FIDM incorporates a fuzzy forcing term in its nonhomogeneous component:

R M v , w ͷ = F ͷ Ɯ 2 e ͷ ͷ + 0 ͷ ͷ x d x , x < ͷ , 0 = Ɯ , ( 73 )

concerning precise F ͷ = sinh ͷ 1 ͷ + e 2 ͷ + 1 and Ɯ ƻ = max 0,1 ƻ 2 , s R .

Herein, Ɯ θ = 1 θ , 1 θ and E j ͷ θ = 0 ͷ ͷ 1 θ x d x , 0 ͷ ͷ 2 θ x d x . For finding the 1 - and 2 -fuzzy M-HRKA solutions of Eq. 73, we have a couple of phases:

Phase 1 The coupled equation concerning v 1 , w -fuzzy FM-D is

D M v , w 1 θ ͷ = F ͷ 1 θ 2 e ͷ 1 θ ͷ + 0 ͷ ͷ 1 θ x d x , D M v , w 2 θ ͷ = F ͷ 1 θ 2 e ͷ 2 θ ͷ + 0 ͷ ͷ 2 θ x d x , 1 θ 0 = 1 θ , 1 θ 0 = 1 θ . ( 74 )

The exact 1 -fuzzy M-solution concerning Phase 1 is

1 θ ͷ = 1 θ cosh ͷ , 2 θ ͷ = 1 θ cosh ͷ . ( 75 )

Phase 2 The coupled equation concerning v 2 , w -fuzzy FM-D is

D M v , w 1 θ ͷ + 2 e ͷ 2 θ ͷ = F ͷ 1 θ + 0 ͷ ͷ 2 θ x d x , D M v , w 2 θ ͷ + 2 e ͷ 1 θ ͷ = F ͷ 1 θ + 0 ͷ ͷ 1 θ x d x , 1 θ 0 = 1 θ , 2 θ 0 = 1 θ . ( 76 )

The exact series 1 -fuzzy M-solution concerning Phase 2 is

1 θ ͷ = 1 θ [ 1 + 21996379091399 25681904547644 88921857024000 237557617065707 1 + 1 e ͷ + 9155426817577 25681904547644 88921857024000 237557617065707 1 + 1 e ͷ 2 + + 156045941495845980212393 16791784149188346794496000 3814938928760 237557617065707 1 + 1 e ͷ 15 + ] , 1 θ ͷ = 1 θ [ 1 + 21996379091399 25681904547644 88921857024000 237557617065707 1 + 1 e ͷ + 9155426817577 25681904547644 88921857024000 237557617065707 1 + 1 e ͷ 2 + + 156045941495845980212393 16791784149188346794496000 3814938928760 237557617065707 1 + 1 e ͷ 15 + ] . ( 77 )

8.2 Findings and analysis

For computations concerning j n ͷ u θ η T n ͷ u θ η T : ͷ u = u n at u = 0,1 , , n = 21 in and θ η = η m at η = 0,1,3 , m = 4 in I . By executing Algorithm 3, a set of numerical outcomes is generated and displayed in a tabular format, accompanied by a variety of graphical illustrations. Additionally, we employ HRKA to analyze the previous two applications at ͷ , v D , w > 0 , and θ I in v 1 , w - and v 2 , w -fuzzy FM-Ds. Next, ȹ n ͷ u , θ η determines the errors in j n ͷ u θ η T n ͷ u θ η T .

The key goal is to exemplify the uncertain behaviors of the HRKA 1 - and 2 -fuzzy M-solutions at dissimilar nodes; Tables 1, 2 show ȹ n ͷ u , θ η in numerically approximating j n ͷ θ of j ͷ θ concerning Phase 1 and Phase 2, sequentially in Application 1. Tables 3, 4 show ȹ n ͷ u , θ η in numerically approximating n ͷ θ of ͷ θ throughout the HRKA 1 - and 2 -fuzzy M-solutions concerning Phase 1 and Phase 2, sequentially in Application 2.

TABLE 1
www.frontiersin.org

TABLE 1. ȹ n ͷ u , θ η concerning HRKA 1 -fuzzy M-solutions for j n ͷ u θ η in Application 1 in Phase 1 at v = w = 1 .

TABLE 2
www.frontiersin.org

TABLE 2. ȹ n ͷ u , θ η concerning HRKA 2 -fuzzy M-solutions for j n ͷ u θ η in Application 1 in Phase 2 at v = w = 1 .

TABLE 3
www.frontiersin.org

TABLE 3. ȹ n ͷ u , θ η concerning HRKA 1 -fuzzy M-solutions for n ͷ u θ η in Application 2 in Phase 1 at v = w = 1 .

TABLE 4
www.frontiersin.org

TABLE 4. ȹ n ͷ u , θ η concerning HRKA 2 -fuzzy M-solutions for n ͷ u θ η in Application 2 in Phase 2 at v = w = 1 .

As is evident from the tabulated digits in Tables 14, j 1 θ η n ͷ u 1 θ η n ͷ u and j 2 θ η n ͷ u 2 θ η n ͷ u correspond to the HRKA solutions j 1 θ ͷ 1 θ ͷ and j 2 θ ͷ 2 θ ͷ and are harmonized and approximately similar in their behavior. The tabulated digits in Tables 3, 4 satisfy the property that 1 θ n ͷ = 2 θ n ͷ for each θ and ͷ in the two phases to agree the natural constraint appears in Eq. 74 as Ɯ θ = 1 θ , 1 θ . Altogether, the HRKA aligns well with the numerical results, indicating a high level of agreement between them.

Our research focuses on exploring the HRKA’s vibrant and structural characteristics, and remembrance and heritage features. In pursuit of this, we provide geometric certifications for ͷ u and θ η at v D , w > 0 , and θ I . Figures 2, 3 display the HRKA 1 - and 2 -fuzzy M-solutions in the phase of v 1 , w and v 2 , w -fuzzy FM-D concerning Application 1. Likewise, Figures 4, 5 exhibit similar computations concerning Application 2.

FIGURE 2
www.frontiersin.org

FIGURE 2. Plot of HRKA 1 - and 2 -fuzzy M-solutions j n ͷ u θ η in Application 1 in the phase of v 1 , w -fuzzy FM-D: (A) at v , w = 1,1 , (B) at v , w = 0.9,1 , (C) at v , w = 0.8,1 , and (D) at v , w = 0.7,1 . Herein, green represents j 1 θ η n ͷ u , and blue represents j 2 θ η n ͷ u .

FIGURE 3
www.frontiersin.org

FIGURE 3. Plot of HRKA 1 - and 2 -fuzzy M-solutions j n ͷ u θ η in Application 1 in the phase of v 2 , w -fuzzy FM-D: (A) at v , w = 1,1 , (B) at v , w = 0.9,1 , (C) at v , w = 0.8,1 , and (D) at v , w = 0.7,1 . Herein, green represents j 1 θ η n ͷ u and blue represents j 2 θ η n ͷ u .

FIGURE 4
www.frontiersin.org

FIGURE 4. Plot of HRKA 1 - and 2 -fuzzy M-solutions j n ͷ u θ η in Application 2 in the phase of v 1 , w -fuzzy FM-D: (A) at v , w = 1,1 , (B) at v , w = 0.9,1 , (C) at v , w = 0.8,1 , and (D) at v , w = 0.7,1 . Herein, green represents 1 θ η n ͷ u and blue represents 2 θ η n ͷ u .

FIGURE 5
www.frontiersin.org

FIGURE 5. Plot of HRKA 1 - and 2 -fuzzy M-solutions j n ͷ u θ η in Application 2 in the phase of v 2 , w -fuzzy FM-D: (A) at v , w = 1,1 , (B) at v , w = 0.9,1 , (C) at v , w = 0.8,1 , and (D) at v , w = 0.7,1 . Herein, green represents 1 θ η n ͷ u and blue represents 2 θ η n ͷ u .

Ultimately, we provide ȹ n ͷ u , θ η geometric certifications for ͷ u and θ η at v D , w > 0 , and θ I as visualized in Figure 6 for targeted cases and applications concerning the HRKA 1 - and 2 -fuzzy M-solutions in the phase of v 1 , w and v 2 , w -fuzzy FM-D.

FIGURE 6
www.frontiersin.org

FIGURE 6. Plot of ȹ n ͷ u , θ η at v , w = 1,1 gained from HRKA 1 - and 2 -fuzzy M-solutions: (A) in Application 1 in the phase of v 1 , w -fuzzy FM-D, (B) in Application 1 in the phase of v 2 , w -fuzzy FM-D, (C) in Application 2 in the phase of v 1 , w -fuzzy FM-D, and (D) in Application 2 in the phase of v 2 , w -fuzzy FM-D.

Based on the obtained plots, it is evident that the graphs demonstrate close agreement and similar behaviors, especially when analyzing the classical derivative. It is important to take note that the model profiles can exhibit unusual behaviors when the value of v , w deviates from the classical value as fuzzy FM-D can have a significant impact on the results.

9 Key points and summary

In this exploration research, FM-D, FM-I, and FM-FIDM are examined and analyzed for the first time. Alongside, the existence-uniqueness of fuzzy two M-solutions jointly with the characterization theorem is employed as pioneering results as well. Indeed, triplet-simulated pseudocodes related to characterizing 1 - and 2 -fuzzy M-solutions are given in terms of algorithms. In this approach, the iterative HRKA in a new perspective is fitted and built to attain a series approximation of 1 - and 2 -fuzzy M-solutions for a couple of noninteger uncertain real-world models to ratify and attest to the new scheme as pioneering results as well. Thereafter, computational convergence and error analysis together with the series symbolization of fuzzy two M-solutions are inferred. In conclusion, the obtained novel theories and data outcomes demonstrate the fidelity and productivity of our proposed adaptation. This approach can be potently used as a preference scheme in handling assorted types of fractional M-models manifesting in applied physics and nonlinear engineering. Our manuscript provides a valuable contribution to the field and opens up new avenues for future studies. Our future article will talk about the fractional M-models where v ϵ ( 1,2 and w > 0 .

Data availability statement

The original contributions presented in the study are included in the article/Supplementary Material; further inquiries can be directed to the corresponding author.

Author contributions

OA: data curation, investigation, software, methodology, validation, writing–original draft, and writing–review and editing. RM: funding acquisition, investigation, resources, supervision, visualization, and writing–original draft. BM: conceptualization, formal analysis, investigation, project administration, software, and writing–review and editing. All authors contributed to the article and approved the submitted version.

Acknowledgments

The authors would like to express their gratitude to the unknown reviewers for carefully reading the paper and for their helpful comments.

Conflict of interest

The authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.

Publisher’s note

All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors, and the reviewers. Any product that may be evaluated in this article, or claim that may be made by its manufacturer, is not guaranteed or endorsed by the publisher.

Abbreviations

FM-FIDM, fuzzy M-fractional integrodifferential model; CM-FIDM, crisp M-fractional integrodifferential model; HRKA, Hilbert reproducing kernel algorithm; FM-D, fractional M-derivative; FM-I, fractional M-integral; NLDM, nonlinear differential model; IRCC, inductance–resistance–capacitance circuit.

References

1. Chakraverty S, Tapaswini S, Behera D. Fuzzy differential equations and applications for engineers and scientists. USA: CRC Press (2016).

Google Scholar

2. Gomes LT, de Barros LC, Bede B. Fuzzy differential equations in various approache. Germany: Springer (2015).

Google Scholar

3. Rajab N, Ahmed AM, Al-Faour OM. On fuzzy linear integro-deffrential equations of Volterra type: Approximated solutions of fuzzy linear Volterra integro-differential equations. Moldova: LAP LAMBERT Academic Publishing (2013).

Google Scholar

4. Herrmann R. Fractional calculus: An introduction for physicists. Singapore: World Scientific (2014).

Google Scholar

5. Tarasov VE. Fractional dynamics: Applications of fractional calculus to dynamics of particles, fields and media. Germany: Springer (2011).

Google Scholar

6. West BJ. Fractional calculus view of complexity: Tomorrow’s science. UK: Taylor & Francis (2015).

Google Scholar

7. Shabestari MR, Ezzati R, Allahviranloo T. Numerical solution of fuzzy fractional integro-differential equation via two-dimensional Legendre wavelet method. J Intell Fuzzy Syst (2018) 34:2453–65. doi:10.3233/jifs-171707

CrossRef Full Text | Google Scholar

8. Alikhani R, Bahrami F. Global solutions for nonlinear fuzzy fractional integral and integrodifferential equations. Commun Nonlinear Sci Numer Simulation (2013) 18:2007–17. doi:10.1016/j.cnsns.2012.12.026

CrossRef Full Text | Google Scholar

9. Salahshour S, Allahviranloo T, Abbasbandy S. Solving fuzzy fractional differential equations by fuzzy Laplace transforms. Commun Nonlinear Sci Numer Simulation (2012) 17:1372–81. doi:10.1016/j.cnsns.2011.07.005

CrossRef Full Text | Google Scholar

10. Cui M, Lin Y. Nonlinear numerical analysis in the reproducing kernel space. USA: Nova Science (2009).

Google Scholar

11. Berlinet A, Agnan CT. Reproducing kernel Hilbert space in probability and statistics. USA: Kluwer Academic Publishers (2004).

Google Scholar

12. Daniel A. Reproducing kernel spaces and applications. Basel, Switzerland: Springer (2003).

Google Scholar

13. Jiang W, Chen Z. A collocation method based on reproducing kernel for a modified anomalous subdiffusion equation. Numer Methods Partial Differential Equations (2014) 30:289–300. doi:10.1002/num.21809

CrossRef Full Text | Google Scholar

14. Geng FZ, Qian SP, Li S. A numerical method for singularly perturbed turning point problems with an interior layer. J Comput Appl Math (2014) 255:97–105. doi:10.1016/j.cam.2013.04.040

CrossRef Full Text | Google Scholar

15. Akram G, Rehman HU. Solution of fifth order boundary value problem in the reproducing kernel space. Middle East J Scientific Res (2011) 10:191–5.

Google Scholar

16. Akgül A, Bonyah E. Reproducing kernel Hilbert space method for the solutions of generalized Kuramoto–Sivashinsky equation. J Taibah Univ Sci (2019) 13:661–9. doi:10.1080/16583655.2019.1618547

CrossRef Full Text | Google Scholar

17. Akgül A. A novel method for a fractional derivative with non-local and non-singular kernel. Chaos, Solitons and Fractals (2018) 114:478–82. doi:10.1016/j.chaos.2018.07.032

CrossRef Full Text | Google Scholar

18. Akram G, Rehman HU. Numerical solution of eighth order boundary value problems in reproducing Kernel space. Numers (2013) 62:527–40. doi:10.1007/s11075-012-9608-4

CrossRef Full Text | Google Scholar

19. Akram G, Rehman HU. Solutions of a class of sixth order boundary value problems using the reproducing kernel space,. Abstract Appl Anal (2013) 2013:560590. doi:10.1155/2013/560590

CrossRef Full Text | Google Scholar

20. Attia N, Akgül A, Seba D, Nour A, Riaz MB. Reproducing kernel Hilbert space method for solving fractal fractional differential equations. Results Phys (2022) 35:105225. doi:10.1016/j.rinp.2022.105225

CrossRef Full Text | Google Scholar

21. Abu Arqub O. Adaptation of reproducing kernel algorithm for solving fuzzy Fredholm-Volterra integrodifferential equations. Neural Comput Appl (2017) 28:1591–610. doi:10.1007/s00521-015-2110-x

CrossRef Full Text | Google Scholar

22. Hasan S, Maayah B, Bushnaq S, Momani S. A modified reproducing kernel Hilbert space method for solving fuzzy fractional integro-differential equations. Boletim da Sociedade Paranaense de Matemática (2023) 41:1–16. doi:10.5269/bspm.52289

CrossRef Full Text | Google Scholar

23. Yépez-Martínez H, Gómez-Aguilar JF. M-derivative applied to the dispersive optical solitons for the Schrödinger-Hirota equation. The Eur Phys J Plus (2019) 134:93. doi:10.1140/epjp/i2019-12459-7

CrossRef Full Text | Google Scholar

24. Sousa JVDC, Oliveira ECD. On the local M-derivative. Prog Fractional Differ Appl (2018) 4:479–92. doi:10.18576/pfda/040403

CrossRef Full Text | Google Scholar

25. Yépez-Martínez H, Gómez-Aguilar JF. Local M-derivative of order $$\alpha$$ α and the modified expansion function method applied to the longitudinal wave equation in a magneto electro-elastic circular rod. Opt Quan Elect (2018) 50:375. doi:10.1007/s11082-018-1643-5

CrossRef Full Text | Google Scholar

26. Yusuf A, Inc M, Baleanu D. Optical solitons with M-truncated and beta derivatives in nonlinear optics. Front Phys (2019) 7:126. doi:10.3389/fphy.2019.00126

CrossRef Full Text | Google Scholar

27. Sousa JVDC, Oliveira ECD. A new truncated M-fractional derivative type unifying some fractional derivative types with classical properties. Int J Anal Appl (2018) 16:83–96. doi:10.28924/2291-8639-16-2018-83

CrossRef Full Text | Google Scholar

28. Mohammed WW, El-Morshedy M, Moumen A, Ali EE, Benaissa M, Abouelregal AE. Effects of M-truncated derivative and multiplicative noise on the exact solutions of the breaking soliton equation. Symmetry (2023) 15:288. doi:10.3390/sym15020288

CrossRef Full Text | Google Scholar

29. Li C, Dao X, Guo P. Fractional derivatives in complex planes. Nonlinear Anal Theor Methods Appl (2009) 71:1857–69. doi:10.1016/j.na.2009.01.021

CrossRef Full Text | Google Scholar

30. Guariglia E. Fractional calculus, zeta functions and Shannon entropy. Open Access (2021) 19:87–100. doi:10.1515/math-2021-0010

CrossRef Full Text | Google Scholar

31. Ortigueira MD, Rodríguez-Germá L, Trujillo JJ. Complex grünwald–letnikov, liouville, riemann–liouville, and Caputo derivatives for analytic functions. Commun Nonlinear Sci Numer Simulation (2011) 16:4174–82. doi:10.1016/j.cnsns.2011.02.022

CrossRef Full Text | Google Scholar

32. Guariglia E. Riemann zeta fractional derivative-functional equation and link with primes. Adv Difference Equations (2019) 2019:261. doi:10.1186/s13662-019-2202-5

CrossRef Full Text | Google Scholar

33. Závada P. Operator of fractional derivative in the complex plane. Commun Math Phys (1998) 192:261–85. doi:10.1007/s002200050299

CrossRef Full Text | Google Scholar

34. Lin SD, Srivastava HM. Some families of the Hurwitz–Lerch Zeta functions and associated fractional derivative and other integral representations. Appl Math Comput (2004) 154:725–33. doi:10.1016/s0096-3003(03)00746-x

CrossRef Full Text | Google Scholar

35. Podlubny I. Geometric and physical interpretation of fractional integration and fractional differentiation. Fractional Calculus Appl Anal (2004) 5:367–86.

Google Scholar

36. Goetschel R, Voxman W. Elementary fuzzy calculus. Fuzzy Sets Syst (1986) 18:31–43. doi:10.1016/0165-0114(86)90026-6

CrossRef Full Text | Google Scholar

37. Kaleva O. Fuzzy differential equations. Fuzzy Sets Syst (1987) 24:301–17. doi:10.1016/0165-0114(87)90029-7

CrossRef Full Text | Google Scholar

Keywords: fuzzy M-fractional integrodifferential model, fractional M-derivative, fractional M-integral, Hilbert reproducing kernel algorithm, fuzzy existence and uniqueness, characterization theorem

Citation: Abu Arqub O, Mezghiche R and Maayah B (2023) Fuzzy M-fractional integrodifferential models: theoretical existence and uniqueness results, and approximate solutions utilizing the Hilbert reproducing kernel algorithm. Front. Phys. 11:1252919. doi: 10.3389/fphy.2023.1252919

Received: 04 July 2023; Accepted: 31 August 2023;
Published: 02 October 2023.

Edited by:

Emanuel Guariglia, São Paulo State University, Brazil

Reviewed by:

Firdous A. Shah, University of Kashmir, India
Hamood Ur Rehman, University of Okara, Pakistan
Tamilvanan Kandhasamy, Kalasalingam University, India

Copyright © 2023 Abu Arqub, Mezghiche and Maayah. This is an open-access article distributed under the terms of the Creative Commons Attribution License (CC BY). The use, distribution or reproduction in other forums is permitted, provided the original author(s) and the copyright owner(s) are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms.

*Correspondence: Omar Abu Arqub, o.abuarqub@bau.edu.jo

Disclaimer: All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors and the reviewers. Any product that may be evaluated in this article or claim that may be made by its manufacturer is not guaranteed or endorsed by the publisher.