Research article

Application of Fisher information to CMOS noise estimation

  • Analysis of the accuracy of estimated parameters is an important research direction. In the article, the maximum likelihood estimation is used to estimate CMOS image noise parameters and Fisher information is used to analyse their accuracy. The accuracies of the two parameters are different in different situations. Two applications of it are proposed in this paper. The first one is a guide to image representation. The standard pixel image has higher accuracy for signal-dependent noise and higher error for additive noise, in contrast to the normalised pixel image. Therefore, the corresponding image representation is chosen to estimate the noise parameters according to the dominant noise. The second application of the conclusions is a guide to algorithm design. For standard pixel images, the error of additive noise estimation will largely affect the final denoising result if two kinds of noise are removed simultaneously. Therefore, a divide-and-conquer hybrid total least squares algorithm is proposed for CMOS image restoration. After estimating the parameters, the total least square algorithm is first used to remove the signal-dependent noise of the image. Then, the additive noise parameters of the processed image are updated by using the principal component analysis algorithm, and the additive noise in the image is removed by BM3D. Experiments show that this hybrid method can effectively avoid the problems caused by the inconsistent precision of the two kinds of noise parameters. Compared with the state-of-art methods, the new method shows certain advantages in subjective visual quality and objective image restoration indicators.

    Citation: Mingying Pan, Xiangchu Feng. Application of Fisher information to CMOS noise estimation[J]. AIMS Mathematics, 2023, 8(6): 14522-14540. doi: 10.3934/math.2023742

    Related Papers:

    [1] Nader Al-Rashidi . Innovative approaches to fractional modeling: Aboodh transform for the Keller-Segel equation. AIMS Mathematics, 2024, 9(6): 14949-14981. doi: 10.3934/math.2024724
    [2] Humaira Yasmin, Aljawhara H. Almuqrin . Analytical study of time-fractional heat, diffusion, and Burger's equations using Aboodh residual power series and transform iterative methodologies. AIMS Mathematics, 2024, 9(6): 16721-16752. doi: 10.3934/math.2024811
    [3] Muhammad Imran Liaqat, Sina Etemad, Shahram Rezapour, Choonkil Park . A novel analytical Aboodh residual power series method for solving linear and nonlinear time-fractional partial differential equations with variable coefficients. AIMS Mathematics, 2022, 7(9): 16917-16948. doi: 10.3934/math.2022929
    [4] Yousef Jawarneh, Humaira Yasmin, Abdul Hamid Ganie, M. Mossa Al-Sawalha, Amjid Ali . Unification of Adomian decomposition method and ZZ transformation for exploring the dynamics of fractional Kersten-Krasil'shchik coupled KdV-mKdV systems. AIMS Mathematics, 2024, 9(1): 371-390. doi: 10.3934/math.2024021
    [5] Mariam Sultana, Muhammad Waqar, Ali Hasan Ali, Alina Alb Lupaş, F. Ghanim, Zaid Ameen Abduljabbar . Numerical investigation of systems of fractional partial differential equations by new transform iterative technique. AIMS Mathematics, 2024, 9(10): 26649-26670. doi: 10.3934/math.20241296
    [6] Humaira Yasmin, Aljawhara H. Almuqrin . Efficient solutions for time fractional Sawada-Kotera, Ito, and Kaup-Kupershmidt equations using an analytical technique. AIMS Mathematics, 2024, 9(8): 20441-20466. doi: 10.3934/math.2024994
    [7] Aslı Alkan, Halil Anaç . The novel numerical solutions for time-fractional Fornberg-Whitham equation by using fractional natural transform decomposition method. AIMS Mathematics, 2024, 9(9): 25333-25359. doi: 10.3934/math.20241237
    [8] M. Mossa Al-Sawalha, Khalil Hadi Hakami, Mohammad Alqudah, Qasem M. Tawhari, Hussain Gissy . Novel Laplace-integrated least square methods for solving the fractional nonlinear damped Burgers' equation. AIMS Mathematics, 2025, 10(3): 7099-7126. doi: 10.3934/math.2025324
    [9] Asif Khan, Tayyaba Akram, Arshad Khan, Shabir Ahmad, Kamsing Nonlaopon . Investigation of time fractional nonlinear KdV-Burgers equation under fractional operators with nonsingular kernels. AIMS Mathematics, 2023, 8(1): 1251-1268. doi: 10.3934/math.2023063
    [10] Hayman Thabet, Subhash Kendre, James Peters . Travelling wave solutions for fractional Korteweg-de Vries equations via an approximate-analytical method. AIMS Mathematics, 2019, 4(4): 1203-1222. doi: 10.3934/math.2019.4.1203
  • Analysis of the accuracy of estimated parameters is an important research direction. In the article, the maximum likelihood estimation is used to estimate CMOS image noise parameters and Fisher information is used to analyse their accuracy. The accuracies of the two parameters are different in different situations. Two applications of it are proposed in this paper. The first one is a guide to image representation. The standard pixel image has higher accuracy for signal-dependent noise and higher error for additive noise, in contrast to the normalised pixel image. Therefore, the corresponding image representation is chosen to estimate the noise parameters according to the dominant noise. The second application of the conclusions is a guide to algorithm design. For standard pixel images, the error of additive noise estimation will largely affect the final denoising result if two kinds of noise are removed simultaneously. Therefore, a divide-and-conquer hybrid total least squares algorithm is proposed for CMOS image restoration. After estimating the parameters, the total least square algorithm is first used to remove the signal-dependent noise of the image. Then, the additive noise parameters of the processed image are updated by using the principal component analysis algorithm, and the additive noise in the image is removed by BM3D. Experiments show that this hybrid method can effectively avoid the problems caused by the inconsistent precision of the two kinds of noise parameters. Compared with the state-of-art methods, the new method shows certain advantages in subjective visual quality and objective image restoration indicators.



    Many complicated structures' memory and natural features may be realized using fractional calculus (FC), which studies integrals and derivatives of fractional orders [1,2]. Many recent FC applications have included analyzing the dynamics of large-scale physical events by converting derivatives and integrals from classical to non-integer order. Many branches of engineering and the physical sciences use it, including electric circuits, mathematical biology, control theory, robotics, viscoelasticity, flow models, relaxation, and signal processing [3,4]. Numerous mysterious ideas have been refined via the study of fractional calculus, for example, logistic regression, Malthusian growth, and blood alcohol concentration, all of which have shown that fractional operators outperform integer-order operators [5,6].

    Derivatives of fractional order such as Riemann-Liouville, Atangana Baleanu, Caputo, Hilfer, Grunwald-Letnikov, Caputo Fabrizio, and Riemann-Liouville are among the numerous that have recently been proposed [7,8]. Since all fractional derivatives may be reduced in Caputo's meaning with minor parametric adjustments, the fractional derivative of Caputo is the essential principle of FC to investigate fractional differential equations (FDEs). Caputo's operator, which has numerous applications to model various physical models, possesses a power-law kernel. To address this difficulty, the alternative fractional differential operator [9] was developed, which consists of a Mittag-Leffler kernel and an exponentially decaying kernel. Caputo-Fabrizio (CF) and Atangana-Baleanu are operators characterized by their non-singular kernels. These operators have been widely applied in analyzing diverse problem classes, including but not limited to biology, economics, geophysics, and bioengineering [10].

    Korteweg and de Vries introduced the KdV equation in 1895 to formulate a model for Russell's soliton phenomenon, encompassing water waves of long and small amplitude. Solitons are classified as stable solitary waves, signifying their particle-like nature [11]. Various applied disciplines, including plasma physics, fluid dynamics, quantum mechanics, and optics, implement the KdV equations [12]. Particle physics has employed the fifth-order KdV equations to analyze many nonlinear phenomena [13]. Its function in the propagation of waves is crucial [14]. The authors find third-order and fifth-order dispersive terms in the KdV form equation pertinent to the magneto-acoustic wave problem. Furthermore, these dispersive terms manifest themselves in the vicinity of critical angle propagation [15]. An electrically conducting fluid, plasma is also dynamic and quasi-neutral. Ions, electrons, and neutral particles comprise it. Due to the electrical conductivity exhibited by plasma, it includes both electric and magnetic regions. The variety of particles and regions supports diverse types of plasma waves. A magnetic lock is a less longitudinal ion dispersion. In the low magnetic field range, the magneto-acoustic wave exhibits characteristics of an ion acoustic wave [16,17]. However, at low temperatures, it transforms into an Alfven wave.

    Equivalent to the general model for the investigation of magnetic characteristics of acoustic waves with surface tension is the fifth order of KdV. According to a recent investigation [18,19], the solutions to the equation above concerning traveling waves persist beyond infinity. The following are two widely recognized types of fifth-order KdV equations [20,21]:

    DpΩη(ϵ,Ω)5η(ϵ,Ω)ϵ5+η(ϵ,Ω)3η(ϵ,Ω)ϵ3+η(ϵ,Ω)η(ϵ,Ω)ϵ=0,  0<p1. (1.1)
    DpΩη(ϵ,Ω)+5η(ϵ,Ω)ϵ5η(ϵ,Ω)3η(ϵ,Ω)ϵ3+η(ϵ,Ω)η(ϵ,Ω)ϵ=0,  0<p1. (1.2)

    Here, Eqs (1.1) and (1.2) are called the Kawahara and KdV equation of fifth-order, respectively. The extreme nonlinearity of these mathematical models makes it difficult to find suitable analytical methods. Researchers have developed and implemented several techniques for solving nonlinear and linear equations of KdV in the past ten years. These techniques include the variational iteration method [21], the multi-symplectic method [22], He's homotopy perturbation method [23], and the Exp-function method [24].

    Omar Abu Arqub established residual power series method (RPSM) in 2013 [25]. It is created by merging the residual error function with the Taylor series. According to [26], an infinite convergence series solves differential equations (DEs). The development of novel RPSM algorithms has been prompted by several DEs, including KdV Burger's equation, fuzzy DEs, Boussinesq DEs, and numerous others [27,28]. The goal of these algorithms is to provide efficient and accurate estimates.

    A novel strategy for solving FDEs was established by integrating two effective methods. Some approaches that fall into these categories include those that use the natural transform [29], the Laplace transform with RPSM [30], and the homotopy perturbation method [31]. In this work, we used a novel combination method known as the Abdooh residual power series method (ARPSM) to discover approximation and precise solutions for time-fractional nonlinear partial differential equations (PDEs). This innovative method is significant because it combines the Aboodh transform technique with the RPSM [32,33].

    The computing effort and complexity needed are significant issues with the previously mentioned approaches. Our suggested Aboodh transform iterative method (ATIM) [34] is this work's unique aspect that solves the Kawahara and KdV equations of fractional order. By integrating the Aboodh transform with the new iterative technique, this strategy significantly reduces the computing effort and complexity required. According to [35,36], the suggested approach yields a convergent series solution.

    The ARPSM and the ATIM are the two most straightforward approaches to solving fractional DEs. These methods fully and immediately explain the symbolic terms used in analytical solutions and offer numerical solutions to PDEs. This paper assesses ATIM and ARPSM's efficacy in solving the fifth-order KdV and Kawahara equations.

    The fifth-order KdV and Kawahara equations are solved using ARPSM and ATIM. These methods provide more precise numerical answers when compared with other numerical techniques. Additionally, a comparison analysis is performed on the numerical findings. The suggested approaches' findings are consistent with one another, which is a strong indicator of their efficacy and reliability. For various values of fractional-order derivatives, there is additional graphical importance. Therefore, the methods are accurate, easy to implement, not affected by computational error phases, and quick. This study lays the groundwork for researchers to quickly solve various PDEs.

    Definition 2.1. [37] Assume that η(ϵ,Ω) is an exponential order continuous function. The definition of the Aboodh transform (AT), assuming σ0 for η(ϵ,Ω), is as follows:

    A[η(ϵ,Ω)]=Ψ(ϵ,ξ)=1ξ0η(ϵ,Ω)eΩξdΩ,  r1ξr2.

    The Aboodh inverse transform (AIT) is given as:

    A1[Ψ(ϵ,ξ)]=η(ϵ,Ω)=12πiu+iuiΨ(ϵ,Ω)ξeΩξdΩ,

    where ϵ=(ϵ1,ϵ2,,ϵp)Rp and pN.

    Lemma 2.1. [38,39] It is assumed that there exist two exponentially ordered, piecewise continuous functions η1(ϵ,Ω) and η2(ϵ,Ω) on [0,]. Let A[η1(ϵ,Ω)]=Ψ1(ϵ,Ω),A[η2(ϵ,Ω)]=Ψ2(ϵ,Ω), and χ1,χ2 be arbitrary constants. These characteristics are thus true:

    (1) A[χ1η1(ϵ,Ω)+χ2η2(ϵ,Ω)]=χ1Ψ1(ϵ,ξ)+χ2Ψ2(ϵ,Ω),

    (2) A1[χ1Ψ1(ϵ,Ω)+χ2Ψ2(ϵ,Ω)]=χ1η1(ϵ,ξ)+χ2η2(ϵ,Ω),

    (3) A[JpΩη(ϵ,Ω)]=Ψ(ϵ,ξ)ξp,

    (4) A[DpΩη(ϵ,Ω)]=ξpΨ(ϵ,ξ)r1K=0ηK(ϵ,0)ξKp+2,r1<pr, rN.

    Definition 2.2. [40] In terms of order p, the function η(ϵ,Ω) has derivative of fractional order as stated by Caputo.

    DpΩη(ϵ,Ω)=JmpΩη(m)(ϵ,Ω), m1<pm, r0,

    where ϵ=(ϵ1,ϵ2,,ϵp)Rp and p,mR,JmpΩ is the integral of the Riemann-Liouville of η(ϵ,Ω).

    Definition 2.3. [41] The representation of power series is composed of the following structure.

    r=0r(ϵ)(ΩΩ0)rp=1+1(ΩΩ0)p+2(ΩΩ0)2p+,

    where ϵ=(ϵ1,ϵ2,,ϵp)Rp and pN. This is known as the multiple fractional power series concerning Ω0, where Ω and r(ϵ)s are variable and series coefficients, respectively.

    Lemma 2.2. Consider the exponential order function is denoted as η(ϵ,Ω). A[η(ϵ,Ω)]=Ψ(ϵ,ξ) is the description of the AT in this case. Hence,

    A[DrpΩη(ϵ,Ω)]=ξrpΨ(ϵ,ξ)r1j=0ξp(rj)2DjpΩη(ϵ,0),0<p1, (2.1)

    where ϵ=(ϵ1,ϵ2,,ϵp)Rp and pN and DrpΩ=DpΩ.DpΩ..DpΩ(rtimes)

    Proof. By using the induction method, we have to prove Eq (2.1). In Eq (2.1), substitute r=1.

    A[DpΩη(ϵ,Ω)]=ξpΨ(ϵ,ξ)ξp2η(ϵ,0)ξp2DpΩη(ϵ,0).

    On the bases of Lemma 2.1, Eq (2.1) for r=1 holds true. Put r=2 in Eq (2.1).

    A[D2prη(ϵ,Ω)]=ξ2pΨ(ϵ,ξ)ξ2p2η(ϵ,0)ξp2DpΩη(ϵ,0). (2.2)

    From left-hand side (LHS) of Eq (2.2), we obtain:

    LHS=A[D2pΩη(ϵ,Ω)]. (2.3)

    The expressions for Eq (2.3) are as follows:

    LHS=A[DpΩη(ϵ,Ω)]. (2.4)

    Assume

    z(ϵ,Ω)=DpΩη(ϵ,Ω). (2.5)

    This makes Eq (2.4) as

    LHS=A[DpΩz(ϵ,Ω)]. (2.6)

    From the definition of the derivative of Caputo, we make changes in Eq (2.6).

    LHS=A[J1pz(ϵ,Ω)]. (2.7)

    By applying the Riemann-Liouville integral Eq (2.7), we obtain:

    LHS=A[z(ϵ,Ω)]ξ1p. (2.8)

    By using the AT feature of differentiability, Eq (2.8) is modified:

    LHS=ξpZ(ϵ,ξ)z(ϵ,0)ξ2p. (2.9)

    From Eq (2.5), we derive:

    Z(ϵ,ξ)=ξpΨ(ϵ,ξ)η(ϵ,0)ξ2p,

    where A[z(ϵ,Ω)]=Z(ϵ,ξ). Hence, Eq (2.9) becomes

    LHS=ξ2pΨ(ϵ,ξ)η(ϵ,0)ξ22pDpΩη(ϵ,0)ξ2p. (2.10)

    Let's suppose Eq (2.1) holds true for r=K. Substitute r=K in Eq (2.1):

    A[DKpΩη(ϵ,Ω)]=ξKpΨ(ϵ,ξ)K1j=0ξp(Kj)2DjpΩDjpΩη(ϵ,0), 0<p1. (2.11)

    Substituting r=K+1 in Eq (2.1):

    A[D(K+1)pΩη(ϵ,Ω)]=ξ(K+1)pΨ(ϵ,ξ)Kj=0ξp((K+1)j)2DjpΩη(ϵ,0). (2.12)

    After analyzing Eq (2.12)'s LHS, we deduce

    LHS=A[DKpΩ(DKpΩ)]. (2.13)

    Let

    DKpΩ=g(ϵ,Ω).

    By Eq (2.13), we drive

    LHS=A[DpΩg(ϵ,Ω)]. (2.14)

    By using the integral of the Riemann-Liouville and derivative of Caputo on Eq (2.14), the subsequent result can be obtained.

    LHS=ξpA[DKpΩη(ϵ,Ω)]g(ϵ,0)ξ2p. (2.15)

    To get Eq (2.15), use Eq (2.11).

    LHS=ξrpΨ(ϵ,ξ)r1j=0ξp(rj)2DjpΩη(ϵ,0). (2.16)

    In addition, Eq (2.16) produces the subsequent outcome.

    LHS=A[DrpΩη(ϵ,0)].

    Thus, for r=K+1, Eq (2.1) holds. For all positive integers, Eq (2.1) holds true according to the mathematical induction technique.

    A deeper understanding of the ARPSM and multiple fractional Taylor series (MFTS) are given as follow.

    Lemma 2.3. Consider the function η(ϵ,Ω) is an exponential order. A[η(ϵ,Ω)]=Ψ(ϵ,ξ) is the expression that signifies the AT of η(ϵ,Ω). AT is represented as follows in MFTS notation:

    Ψ(ϵ,ξ)=r=0r(ϵ)ξrp+2,ξ>0, (2.17)

    where, ϵ=(s1,ϵ2,,ϵp)Rp, pN.

    Proof. Consider the Taylor's series:

    η(ϵ,Ω)=0(ϵ)+1(ϵ)ΩpΓ[p+1]AA+2(ϵ)Ω2pΓ[2p+1]+. (2.18)

    The subsequent equality is produced when the AT is applied to Eq (2.18):

    A[η(ϵ,Ω)]=A[0(ϵ)]+A[1(ϵ)ΩpΓ[p+1]]+A[1(ϵ)Ω2pΓ[2p+1]]+.

    This is achieved by utilizing the AT's features.

    A[η(ϵ,Ω)]=0(ϵ)1ξ2+1(ϵ)1Γ[p+1]1ξp+2+2(ϵ)1Γ[2p+1]1ξ2p+2.

    Hence, by Eq (2.17), a new Taylor's series is obtained:

    Lemma 2.4. Let the multiple fractional power series (MFPS) be expressed in terms of Taylor's series new form Eq (2.17), A[η(ϵ,Ω)]=Ψ(ϵ,ξ).

    0(ϵ)=limξξ2Ψ(ϵ,ξ)=η(ϵ,0). (2.19)

    Proof. Let's suppose the Taylor's series:

    0(ϵ)=ξ2Ψ(ϵ,ξ)1(ϵ)ξp2(ϵ)ξ2p. (2.20)

    As denoted by Eq (2.20), the necessary solution can be obtained by employing limx in Eq (2.19) and performing a short calculation.

    Theorem 2.5. The following is an MFPS representation of the function A[η(ϵ,Ω)]=Ψ(ϵ,ξ):

    Ψ(ϵ,ξ)=0r(ϵ)ξrp+2, ξ>0,

    where ϵ=(ϵ1,ϵ2,,ϵp)Rp and pN. Then, we have

    r(ϵ)=Drprη(ϵ,0),

    where, DrpΩ=DpΩ.DpΩ..DpΩ(rtimes).

    Proof. Let's suppose the Taylor's series:

    1(ϵ)=ξp+2Ψ(ϵ,ξ)ξp0(ϵ)2(ϵ)ξp3(ϵ)ξ2p (2.21)

    limξ, is applied to Eq (2.21), and we get

    1(ϵ)=limξ(ξp+2Ψ(ϵ,ξ)ξp0(ϵ))limξ2(ϵ)ξplimξ3(ϵ)ξ2p.

    The equality that results from taking the limit is as follows:

    1(ϵ)=limξ(ξp+2Ψ(ϵ,ξ)ξp0(ϵ)). (2.22)

    Using Lemma 2.2, we obtain:

    1(ϵ)=limξ(ξ2A[DpΩη(ϵ,Ω)](ξ)). (2.23)

    Furthermore, the Eq (2.23) is modified using Lemma 2.3.

    1(ϵ)=DpΩη(ϵ,0).

    Using Taylor's series and applying limitξ again, we obtain:

    2(ϵ)=ξ2p+2Ψ(ϵ,ξ)ξ2p0(ϵ)ξp1(ϵ)3(ϵ)ξp.

    Lemma 2.3 gives us the result

    2(ϵ)=limξξ2(ξ2pΨ(ϵ,ξ)ξ2p20(ϵ)ξp21(ϵ)). (2.24)

    Equation (2.24) is transformed using Lemmas 2.2 and Eq (2.4).

    2(ϵ)=D2pΩη(ϵ,0).

    Apply the same procedure and Taylor series, and we obtain:

    3(ϵ)=limξξ2(A[D2pΩη(ϵ,p)](ξ)).

    Finally, we get:

    3(ϵ)=D3pΩη(ϵ,0).

    In general,

    r(ϵ)=DrpΩη(ϵ,0),

    is proved. The new Taylor series has the conditions for the convergence given in the subsequent theorem.

    Theorem 2.6. The expression for MFTS is given in Lemma 2.3 and can be expressed as: A[η(ϵ,Ω)]=Ψ(ϵ,ξ). When |ξaA[D(K+1)pΩη(ϵ,Ω)]|T, 0<p1, and 0<ξs, RK(ϵ,ξ) is the residual of the new MFTS satisfying:

    |RK(ϵ,ξ)|Tξ(K=1)p+2, 0<ξs.

    Proof. For r=0,1,2,,K+1, and 0<ξs, we consider to define A[DrpΩη(ϵ,Ω)](ξ). Utilize the Taylor series to derive the subsequent relation:

    RK(ϵ,ξ)=Ψ(ϵ,ξ)Kr=0r(ϵ)ξrp+2. (2.25)

    Apply Theorem 2.5 on Eq (2.25) to obtain:

    RK(ϵ,ξ)=Ψ(ϵ,ξ)Kr=0DrpΩη(ϵ,0)ξrp+2. (2.26)

    ξ(K+1)a+2 is to be multiplied with Eq (2.26) to obtain the following form.

    ξp(K+1)+2RK(ϵ,ξ)=ξ2(ξp(K+1)Ψ(ϵ,ξ)Kr=0ξp(K+1r)2DrpΩη(ϵ,0)). (2.27)

    Equation (2.27) is modified with Lemma 2.2:

    ξp(K+1)+2RK(ϵ,ξ)=ξ2A[Dp(K+1)Ωη(ϵ,Ω)]. (2.28)

    The absolute of Eq (2.28) gives us

    |ξp(K+1)+2RK(ϵ,ξ)|=|ξ2A[Dp(K+1)Ωη(ϵ,Ω)]|. (2.29)

    By applying the conditions listed in Eq (2.29), the subsequent result is achieved.

    Tξp(K+1)+2RK(ϵ,ξ)Tξp(K+1)+2. (2.30)

    Equation (2.30) yields the desired outcome.

    |RK(ϵ,ξ)|Tξp(K+1)+2.

    Therefore, new conditions for the series to converge are developed.

    In this paper, we explain how ARPSM rules formed the basis of our solution.

    Step 1: Assume the general PDE:

    DqpΩη(ϵ,Ω)+ϑ(ϵ)N(η)δ(ϵ,η)=0. (3.1)

    Step 2: Apply the AT on Eq (3.1):

    A[DqpΩη(ϵ,Ω)+ϑ(ϵ)N(η)δ(ϵ,η)]=0. (3.2)

    Utilizing Lemma 2.1 to modify Eq (3.2),

    Ψ(ϵ,s)=q1j=0DjΩη(ϵ,0)sqp+2ϑ(ϵ)Y(s)sqp+F(ϵ,s)sqp, (3.3)

    where A[δ(ϵ,η)]=F(ϵ,s),A[N(η)]=Y(s).

    Step 3: Equation (3.3) takes the following form:

    Ψ(ϵ,s)=r=0r(ϵ)srp+2, s>0.

    Step 4: Take the steps listed below:

    0(ϵ)=limss2Ψ(ϵ,s)=η(ϵ,0).

    Use Theorem 2.6 to obtain this form.

    1(ϵ)=DpΩη(ϵ,0),2(ϵ)=D2pΩη(ϵ,0),w(ϵ)=DwpΩη(ϵ,0).

    Step 5: The Kth truncated series Ψ(ϵ,s) can be obtained using the following expression:

    ΨK(ϵ,s)=Kr=0r(ϵ)srp+2, s>0,
    ΨK(ϵ,s)=0(ϵ)s2+1(ϵ)sp+2++w(ϵ)swp+2+Kr=w+1r(ϵ)srp+2.

    Step 6: Note that the residual Aboodh function (RAF) (3.3) and the Kth-truncated RAF must be considered independently to obtain:

    ARes(ϵ,s)=Ψ(ϵ,s)q1j=0DjΩη(ϵ,0)sjp+2+ϑ(ϵ)Y(s)sjpF(ϵ,s)sjp,

    and

    AResK(ϵ,s)=ΨK(ϵ,s)q1j=0DjΩη(ϵ,0)sjp+2+ϑ(ϵ)Y(s)sjpF(ϵ,s)sjp. (3.4)

    Step 7: Equation (3.4) may be substituted with ΨK(ϵ,s) in place of its expansion form.

    AResK(ϵ,s)=(0(ϵ)s2+1(ϵ)sp+2++w(ϵ)swp+2+Kr=w+1r(ϵ)srp+2)q1j=0DjΩη(ϵ,0)sjp+2+ϑ(ϵ)Y(s)sjpF(ϵ,s)sjp. (3.5)

    Step 8: Multifly sKp+2 on either side of the equation to get the solution to Eq (3.5).

    sKp+2AResK(ϵ,s)=sKp+2(0(ϵ)s2+1(ϵ)sp+2++w(ϵ)swp+2+Kr=w+1r(ϵ)srp+2q1j=0DjΩη(ϵ,0)sjp+2+ϑ(ϵ)Y(s)sjpF(ϵ,s)sjp). (3.6)

    Step 9: Take lims of Eq (3.6) to obtain:

    limssKp+2AResK(ϵ,s)=limssKp+2(0(ϵ)s2+1(ϵ)sp+2++w(ϵ)swp+2+Kr=w+1r(ϵ)srp+2q1j=0DjΩη(ϵ,0)sjp+2+ϑ(ϵ)Y(s)sjpF(ϵ,s)sjp).

    Step 10: K(ϵ) values can be obtained using the equation above.

    lims(sKp+2AResK(ϵ,s))=0,

    where K=1+w,2+w,.

    Step 11: Values of K(ϵ) are then substituted in Eq (3.3).

    Step 12: Taking the inverse AT we obtain the final solution ηK(ϵ,Ω).

    Let's consider the PDE as given below:

    DpΩη(ϵ,Ω)=Φ(η(ϵ,Ω),DΩϵη(ϵ,Ω),D2Ωϵη(ϵ,Ω),D3Ωϵη(ϵ,Ω)), 0<p,Ω1. (3.7)

    The initial condition is

    η()(ϵ,0)=h, =0,1,2,,m1. (3.8)

    The function to be determined is η(ϵ,Ω), while Φ(η(ϵ,Ω),DΩϵη(ϵ,Ω),D2Ωϵη(ϵ,Ω)D3Ωϵη(ϵ,Ω)) are operators of η(ϵ,Ω),DΩϵη(ϵ,Ω),D2Ωϵη(ϵ,Ω) and D3Ωϵη(ϵ,Ω). The AT is applied on Eq (3.7) to obtain:

    A[η(ϵ,Ω)]=1sp(m1=0η()(ϵ,0)s2p++A[Φ(η(ϵ,Ω),DΩϵη(ϵ,Ω),D2Ωϵη(ϵ,Ω),D3Ωϵη(ϵ,Ω))]). (3.9)

    The AIT yields the solution to this problem:

    η(ϵ,Ω)=A1[1sp(m1=0η()(ϵ,0)s2p++A[Φ(η(ϵ,Ω),DΩϵη(ϵ,Ω),D2Ωϵη(ϵ,Ω),D3Ωϵη(ϵ,Ω))])]. (3.10)

    An infinite series denotes the ATIM-derived solution.

    η(ϵ,Ω)=i=0ηi. (3.11)

    Φ(η,DΩϵη,D2Ωϵη,D3Ωϵη) can be decomposed as:

    Φ(η,DΩϵη,D2Ωϵη,D3Ωϵη)=Φ(η0,DΩϵη0,D2Ωϵη0,D3Ωϵη0)+i=0(Φ(i=0(η,DΩϵη,D2Ωϵη,D3Ωϵη))Φ(i1=1(η,DΩϵη,D2Ωϵη,D3Ωϵη))). (3.12)

    The subsequent equation is obtained by substituting the values of Eqs (3.11) and (3.12) for the initial equation (3.10).

    i=0ηi(ϵ,Ω)=A1[1sp(m1=0η()(ϵ,0)s2p++A[Φ(η0,DΩϵη0,D2Ωϵη0,D3Ωϵη0)])]+A1[1sp(A[i=0(Φi=0(η,DΩϵη,D2Ωϵη,D3Ωϵη))])]A1[1sp(A[(Φi1=1(η,DΩϵη,D2Ωϵη,D3Ωϵη))])] (3.13)
    η0(ϵ,Ω)=A1[1sp(m1=0η()(ϵ,0)s2p+)],η1(ϵ,Ω)=A1[1sp(A[Φ(η0,DΩϵη0,D2Ωϵη0,D3Ωϵη0)])],ηm+1(ϵ,Ω)=A1[1sp(A[i=0(Φi=0(η,DΩϵη,D2Ωϵη,D3Ωϵη))])]A1[1sp(A[(Φi1=1(η,DΩϵη,D2Ωϵη,D3Ωϵη))])], m=1,2,. (3.14)

    For the m-term of Eq (3.7), the analytically approximate solution may be obtained using the following expression:

    η(ϵ,Ω)=m1i=0ηi. (3.15)

    Consider Kawahara equation of fractional order as follows:

    DpΩη(ϵ,Ω)5η(ϵ,Ω)ϵ5+η(ϵ,Ω)3η(ϵ,Ω)ϵ3+η(ϵ,Ω)η(ϵ,Ω)ϵ=0,   where   0<p1, (4.1)

    with the initial condition:

    η(ϵ,0)=105169sech4(ϵ2213), (4.2)

    and exact solution

    η(ϵ,Ω)=105169sech4(36Ω169+ϵ2213).

    Equation (4.2) is used, and {AT} is applied to Eq (4.1) to get

    η(ϵ,s)105169sech4(ϵ2213)s21sp[5η(ϵ,s)ϵ5]+1spAΩ[A1Ωη(ϵ,s)×3A1Ωη(ϵ,s)ϵ3]+1spAΩ[A1Ωη(ϵ,s)×A1Ωη(ϵ,s)ϵ]=0. (4.3)

    Therefore, the series kth-truncated terms are:

    η(ϵ,s)=105169sech4(ϵ2213)s2+kr=1fr(ϵ,s)srp+1,  r=1,2,3,4. (4.4)

    Following is the RAF:

    AΩRes(ϵ,s)=η(ϵ,s)105169sech4(ϵ2213)s21sp[5η(ϵ,s)ϵ5]+1spAΩ[A1Ωη(ϵ,s)×3A1Ωη(ϵ,s)ϵ3]+1spAΩ[A1Ωη(ϵ,s)×A1Ωη(ϵ,s)ϵ]=0, (4.5)

    and the kth-RAFs is:

    AΩResk(ϵ,s)=ηk(ϵ,s)105169sech4(ϵ2213)s21sp[5ηk(ϵ,s)ϵ5]+1spAΩ[A1Ωηk(ϵ,s)×3A1Ωηk(ϵ,s)ϵ3]+1spAΩ[A1Ωηk(ϵ,s)×A1Ωηk(ϵ,s)ϵ]=0. (4.6)

    It takes some calculation to find fr(ϵ,s) for r=1,2,3,.... Using these procedures, we replace the rth-truncated series Eq (4.4) for the rth-RAF Eq (4.6), applying lims(srp+1) and solving AΩResη,r(ϵ,s))=0, for r=1,2,3,. Some terms that we obtain are given below:

    f1(ϵ,s)=105594068813(17290sinh(ϵ2213)10029sinh(3(ϵ2)213)2015sinh(5(ϵ2)213)+104sinh(7(ϵ2)213))sech11(ϵ2213)), (4.7)
    f2(ϵ,s)=10521718014715904(50957301372cosh(ϵ213)+12586770193cosh(2(ϵ2)13)12962735946cosh(3(ϵ2)13)+2020967026cosh(4(ϵ2)13)+68039374cosh(5(ϵ2)13)9200529cosh(6(ϵ2)13)+43264cosh(7(ϵ2)13)54264784626)sech18(ϵ2213), (4.8)

    and so on.

    For r=1,2,3,, replace fr(ϵ,s) in Eq (4.4):

    η(ϵ,s)=105169sech4(ϵ2213)s2(105594068813(17290sinh(ϵ2213)10029sinh(3(ϵ2)213)2015sinh(5(ϵ2)213)+104sinh(7(ϵ2)213))sech11(ϵ2213)))/(sp+1)+(10521718014715904(50957301372cosh(ϵ213)+12586770193cosh(2(ϵ2)13)12962735946cosh(3(ϵ2)13)+2020967026cosh(4(ϵ2)13)+68039374cosh(5(ϵ2)13)9200529cosh(6(ϵ2)13)+43264cosh(7(ϵ2)13)54264784626)sech18(ϵ2213))/(s2p+1)+. (4.9)

    Apply AIT to obtain:

    η(ϵ,Ω)=105169sech4(ϵ2213)Ωp(105594068813(17290sinh(ϵ2213)10029sinh(3(ϵ2)213)2015sinh(5(ϵ2)213)+104sinh(7(ϵ2)213))sech11(ϵ2213)))/(Γ(p+1))+Ω2p(10521718014715904(50957301372cosh(ϵ213)+12586770193cosh(2(ϵ2)13)12962735946cosh(3(ϵ2)13)+2020967026cosh(4(ϵ2)13)+68039374cosh(5(ϵ2)13)9200529cosh(6(ϵ2)13)+43264cosh(7(ϵ2)13)54264784626)sech18(ϵ2213))/(Γ(2p+1))+. (4.10)

    Table 1 presents the ARPSM solution comparison for different values of the parameter p for Ω=0.1, illustrating how the choice of p impacts the accuracy and behavior of the solutions. Figure 1 shows a comparison between the approximate solution obtained using ARPSM (a) and the exact solution (b) for Example 1, confirming the high accuracy of the ARPSM approach. Figure 2 visualizes the impact of varying fractional orders on the ARPSM solution for different p values (p=0.32,0.52,0.72), showcasing how changes in the fractional order influence the solution structure. Figure 3 extends the comparison in two dimensions, offering a 2D view of the fractional order solutions using ARPSM for the same values of p, further confirming the method's ability to capture the dynamics of fractional systems.

    Table 1.  ARPSM solution comparison for the values of p of Example 1 for Ω=0.1.
    ϵ ARPSMp=0.52 ARPSMp=0.72 ARPSMp=1.00 Exact Errorp=1.00
    1.0 0.597480 0.597823 0.597918 0.597923 4.746940×106
    1.1 0.601882 0.602193 0.602280 0.602284 4.296239×106
    1.2 0.605857 0.606136 0.606214 0.606217 3.837431×106
    1.3 0.609395 0.609642 0.609710 0.609713 3.371748×106
    1.4 0.612487 0.612700 0.612759 0.612762 2.900316×106
    1.5 0.615125 0.615304 0.615354 0.615356 2.424166×106
    1.6 0.617301 0.617446 0.617486 0.617488 1.944232×106
    1.7 0.619010 0.619121 0.619151 0.619152 1.461368×106
    1.8 0.620248 0.620324 0.620344 0.620345 9.763596×107
    1.9 0.621010 0.621051 0.621061 0.621062 4.899361×107
    2.0 0.621296 0.621301 0.621302 0.621302 2.792130×108

     | Show Table
    DownLoad: CSV
    Figure 1.  (a) ARPSM approximate solution, (b) exact solution.
    Figure 2.  Fractional order comparison using ARPSM for p=0.32,0.52,0.72.
    Figure 3.  Fractional order 2D comparison using ARPSM for p=0.32,0.52,0.72.

    Consider the Kawahara equation of fractional order:

    DpΩη(ϵ,Ω)=5η(ϵ,Ω)ϵ5η(ϵ,Ω)3η(ϵ,Ω)ϵ3η(ϵ,Ω)η(ϵ,Ω)ϵ,   where   0<p1, (4.11)

    with the initial condition:

    η(ϵ,0)=105169sech4(ϵ2213), (4.12)

    and exact solution

    η(ϵ,Ω)=105169sech4(36Ω169+ϵ2213).

    Apply AT on both sides of Eq (4.11) to obtain:

    A[DpΩη(ϵ,Ω)]=1sp(m1k=0η(k)(ϵ,0)s2p+k+A[5η(ϵ,Ω)ϵ5η(ϵ,Ω)3η(ϵ,Ω)ϵ3η(ϵ,Ω)η(ϵ,Ω)ϵ]). (4.13)

    Apply AIT on Eq (4.13) to obtain:

    η(ϵ,Ω)=A1[1sp(m1k=0η(k)(ϵ,0)s2p+k+A[5η(ϵ,Ω)ϵ5η(ϵ,Ω)3η(ϵ,Ω)ϵ3η(ϵ,Ω)η(ϵ,Ω)ϵ])]. (4.14)

    Utilize AT iteratively to get:

    η0(ϵ,Ω)=A1[1sp(m1k=0η(k)(ϵ,0)s2p+k)]=A1[η(ϵ,0)s2]=105169sech4(ϵ2213).

    Applying the Riemann-Liouville integral on Eq (4.11),

    η(ϵ,Ω)=105169sech4(ϵ2213)A[5η(ϵ,Ω)ϵ5η(ϵ,Ω)3η(ϵ,Ω)ϵ3η(ϵ,Ω)η(ϵ,Ω)ϵ]. (4.15)

    Using the ATIM technique, we provide the following terms:

    η0(ϵ,Ω)=105169sech4(ϵ2213),η1(ϵ,Ω)=105297034413Γ(p+1)Ωp(11940cosh(ϵ213)+1911cosh(2(ϵ2)13)104cosh(3(ϵ2)13)2675)tanh(ϵ2213)sech10(ϵ2213),η2(ϵ,Ω)=105Ω2psech18(ϵ2213)620288218300934144((3513π4pΩpΓ(p+12)(13(9385221sinh(1213(ϵ2))+120132725sinh(11(ϵ2)213)910000sinh(15(ϵ2)213)+14144sinh(17(ϵ2)213))+581521261600sinh(ϵ2213)374464577051sinh(3(ϵ2)213)+130226023125sinh(5(ϵ2)213)12004154204sinh(7(ϵ2)213)7059672300sinh(9(ϵ2)213))sech7(ϵ2213))/(p2Γ(p)Γ(3p))+28561Γ(2p+1)(50957301372cosh(ϵ213)+12586770193cosh(2(ϵ2)13)12962735946cosh(3(ϵ2)13)+13(155459002cosh(4(ϵ2)13)+5233798cosh(5(ϵ2)13)707733cosh(6(ϵ2)13)+3328cosh(7(ϵ2)13)4174214202))). (4.16)

    The final solution that is obtained via ATIM is given as:

    η(ϵ,Ω)=η0(ϵ,Ω)+η1(ϵ,Ω)+η2(ϵ,Ω)+. (4.17)
    η(ϵ,Ω)=105169sech4(ϵ2213)+105297034413Γ(p+1)Ωp(11940cosh(ϵ213)+1911cosh(2(ϵ2)13)104cosh(3(ϵ2)13)2675)tanh(ϵ2213)sech10(ϵ2213)+105Ω2psech18(ϵ2213)620288218300934144((3513π4pΩpΓ(p+12)(13(9385221sinh(1213(ϵ2))+120132725sinh(11(ϵ2)213)910000sinh(15(ϵ2)213)+14144sinh(17(ϵ2)213))+581521261600sinh(ϵ2213)374464577051sinh(3(ϵ2)213)+130226023125sinh(5(ϵ2)213)12004154204sinh(7(ϵ2)213)7059672300sinh(9(ϵ2)213))sech7(ϵ2213))/(p2Γ(p)Γ(3p))+28561Γ(2p+1)(50957301372cosh(ϵ213)+12586770193cosh(2(ϵ2)13)12962735946cosh(3(ϵ2)13)+13(155459002cosh(4(ϵ2)13)+5233798cosh(5(ϵ2)13)707733cosh(6(ϵ2)13)+3328cosh(7(ϵ2)13)4174214202)))+. (4.18)

    Table 2 compares ATIM solutions for the same set of parameters, with similar trends observed as in ARPSM, demonstrating the robustness of both methods. Figure 4 juxtaposes the ATIM approximate solution (a) with the exact solution (b), verifying the precision of the ATIM method. Figure 5 compares the fractional order solutions using ATIM for (p=0.32,0.52,0.72), and Figure 6 presents a 2D version of this comparison, highlighting the impact of the fractional order on the solution dynamics. Table 3 compares the absolute error for ARPSM and ATIM at Ω=0.1, demonstrating that both methods achieve highly accurate solutions with minimal error.

    Table 2.  ATIM solution comparison for the values of p of Example 1 for Ω=0.1.
    ϵ ATIMp=0.52 ATIMp=0.72 ATIMp=1.00 Exact Errorp=1.00
    1.0 0.597546 0.597850 0.597917 0.597923 6.195481×106
    1.1 0.601942 0.602218 0.602278 0.602284 5.609848×106
    1.2 0.605911 0.606158 0.606212 0.606217 5.012997×106
    1.3 0.609443 0.609661 0.609709 0.609713 4.406507×106
    1.4 0.612528 0.612717 0.612758 0.612762 3.791852×106
    1.5 0.615160 0.615318 0.615353 0.615356 3.170410×106
    1.6 0.617329 0.617458 0.617485 0.617488 2.543461×106
    1.7 0.619032 0.619130 0.619150 0.619152 1.912204×106
    1.8 0.620263 0.620329 0.620343 0.620345 1.277767×106
    1.9 0.621019 0.621054 0.621061 0.621062 6.412226×107
    2.0 0.621298 0.621302 0.621302 0.621302 3.606186×108

     | Show Table
    DownLoad: CSV
    Figure 4.  (a) ATIM approximate solution, (b) exact solution.
    Figure 5.  Fractional order comparison using ATIM for p=0.32,0.52,0.72.
    Figure 6.  Fractional order 2D comparison using ATIM for p=0.32,0.52,0.72.
    Table 3.  The comparison of absolute error of Example 1 for Ω=0.1.
    ϵ ARPSMp=1 ATIMp=1 Exact ErrorARPSM ErrorATIM
    1.0 0.597918 0.597917 0.597923 4.746940×106 6.195481×106
    1.1 0.602280 0.602278 0.602284 4.296239×106 5.609848×106
    1.2 0.606214 0.606212 0.606217 3.837431×106 5.012997×106
    1.3 0.609710 0.609709 0.609713 3.371748×106 4.406507×106
    1.4 0.612759 0.612758 0.612762 2.900316×106 3.791852×106
    1.5 0.615354 0.615353 0.615356 2.424166×106 3.170410×106
    1.6 0.617486 0.617485 0.617488 1.944232×106 2.543461×106
    1.7 0.619151 0.619150 0.619152 1.461368×106 1.912204×106
    1.8 0.620344 0.620343 0.620345 9.763596×107 1.277767×106
    1.9 0.621061 0.621061 0.621062 4.899361×107 6.412226×107
    2.0 0.621302 0.621302 0.621302 2.792130×108 3.606186×108

     | Show Table
    DownLoad: CSV

    Examine the famous fifth-order KdV equations as follows:

    DpΩη(ϵ,Ω)+5η(ϵ,Ω)ϵ5η(ϵ,Ω)3η(ϵ,Ω)ϵ3+η(ϵ,Ω)η(ϵ,Ω)ϵ=0,   where   0<p1, (4.19)

    with the initial condition:

    η(ϵ,0)=eϵ, (4.20)

    and exact solution

    η(ϵ,Ω)=eϵΩ.

    After applying AT to Eq (4.19), Eq (4.20) is used to obtain:

    η(ϵ,s)eϵs2+1sp[5η(ϵ,s)ϵ5]1spAΩ[A1Ωη(ϵ,s)×3A1Ωη(ϵ,s)ϵ3]+1spAΩ[A1Ωη(ϵ,s)×A1Ωη(ϵ,s)ϵ]=0. (4.21)

    Therefore, the kth-truncated term series is:

    η(ϵ,s)=eϵs2+kr=1fr(ϵ,s)srp+1,  r=1,2,3,4. (4.22)

    Following is the RAF:

    AΩRes(ϵ,s)=η(ϵ,s)eϵs2+1sp[5η(ϵ,s)ϵ5]1spAΩ[A1Ωη(ϵ,s)×3A1Ωη(ϵ,s)ϵ3]+1spAΩ[A1Ωη(ϵ,s)×A1Ωη(ϵ,s)ϵ]=0, (4.23)

    and the kth-RAFs is:

    AΩResk(ϵ,s)=ηk(ϵ,s)eϵs2+1sp[5ηk(ϵ,s)ϵ5]1spAΩ[A1Ωηk(ϵ,s)×3A1Ωηk(ϵ,s)ϵ3]+1spAΩ[A1Ωηk(ϵ,s)×A1Ωηk(ϵ,s)ϵ]=0. (4.24)

    It takes some calculation to find fr(ϵ,s) for r=1,2,3,.... Using these procedures, we replace the rth-truncated series Eq (4.22) for the rth-RAF Eq (4.24), applying lims(srp+1) and solving AΩResη,r(ϵ,s))=0, for r=1,2,3,.

    f1(ϵ,s)=eϵ, (4.25)
    f2(ϵ,s)=eϵ, (4.26)
    f2(ϵ,s)=eϵ, (4.27)

    and so on.

    For r=1,2,3,, replace fr(ϵ,s) in Eq (4.22):

    η(ϵ,s)=eϵseϵsp+1+eϵs2p+1eϵs3p+1+. (4.28)

    Apply AIT to obtain:

    η(ϵ,Ω)=eϵeϵΩpΓ(p+1)+eϵΩ2pΓ(2p+1)eϵΩ4pΓ(3p+1)+. (4.29)

    Figure 7 explores the fractional order comparison using ARPSM for an extended range of p values (p=0.33,0.55,0.77,1.00), providing a more comprehensive analysis of how different orders affect the solution. Figure 8 offers 2D and 3D graphs for ARPSM solutions, further highlighting the changes in solution behavior as the fractional order varies.

    Figure 7.  Fractional order comparison using ARPSM for p=0.33,0.55,0.77,1.00.
    Figure 8.  2D and 3D graphs for comparing ARPSM solution for p=0.33,0.55,0.77,1.00.

    Examine the famous fifth-order KdV equations as follows:

    DpΩη(ϵ,Ω)=5η(ϵ,Ω)ϵ5+η(ϵ,Ω)3η(ϵ,Ω)ϵ3η(ϵ,Ω)η(ϵ,Ω)ϵ,   where   0<p1, (4.30)

    with the initial condition:

    η(ϵ,0)=eϵ, (4.31)

    and exact solution

    η(ϵ,Ω)=eϵΩ.

    Apply AT on either side of Eq (4.30) to obtain:

    A[DpΩη(ϵ,Ω)]=1sp(m1k=0η(k)(ϵ,0)s2p+k+A[5η(ϵ,Ω)ϵ5+η(ϵ,Ω)3η(ϵ,Ω)ϵ3η(ϵ,Ω)η(ϵ,Ω)ϵ]). (4.32)

    Apply AIT on either side of Eq (4.32) to obtain:

    η(ϵ,Ω)=A1[1sp(m1k=0η(k)(ϵ,0)s2p+k+A[5η(ϵ,Ω)ϵ5+η(ϵ,Ω)3η(ϵ,Ω)ϵ3η(ϵ,Ω)η(ϵ,Ω)ϵ])]. (4.33)

    Iteratively apply the AT to obtain:

    η0(ϵ,Ω)=A1[1sp(m1k=0η(k)(ϵ,0)s2p+k)]=A1[η(ϵ,0)s2]=eϵ.

    Applying Riemann-Liouville integral on Eq (4.19),

    η(ϵ,Ω)=eϵA[5η(ϵ,Ω)ϵ5+η(ϵ,Ω)3η(ϵ,Ω)ϵ3η(ϵ,Ω)η(ϵ,Ω)ϵ]. (4.34)

    The use of the ATIM technique provides the following terms:

    η0(ϵ,Ω)=eϵ,η1(ϵ,Ω)=eϵΩpΓ(p+1),η2(ϵ,Ω)=eϵΩ2pΓ(2p+1),η3(ϵ,Ω)=eϵΩ3pΓ(3p+1). (4.35)

    The final solution that is obtained via ATIM is given as:

    η(ϵ,Ω)=η0(ϵ,Ω)+η1(ϵ,Ω)+η2(ϵ,Ω)+η3(ϵ,Ω)+. (4.36)
    η(ϵ,Ω)=eϵ(1ΩpΓ(p+1)+Ω2pΓ(2p+1)Ω4pΓ(3p+1)+). (4.37)

    Table 4 analyzes the effect of various fractional orders for ARPSM and ATIM, for Example 2, indicating the consistency and accuracy of both methods across different fractional orders. Figures 9 and 10 continue the analysis for ATIM, comparing fractional order solutions and offering 3D and 2D views further to elucidate the complex behavior of fractional wave systems as modeled by the Kawahara and KdV equations. These figures and tables collectively emphasize the efficacy of ARPSM and ATIM in providing accurate and insightful solutions for fractional nonlinear PDEs, especially in the context of nonlinear wave phenomena in applied mathematics and physics. The graphical representations and error comparisons showcase the reliability and precision of these methods in solving complex fractional models.

    Table 4.  Analysis of various fractional order of ARPSM and ATIM of Example 2 for Ω=0.1.
    ϵ ARPSM ATIM ARPSM ATIM ARPSM ATIM
    p=0.55 p=0.77 p=1.00 Exact Errorp=1.0
    1.0 2.49168 2.63507 2.69123 2.69123 4.473861×107
    1.1 2.75373 2.91220 2.97427 2.97427 4.944381×107
    1.2 3.04335 3.21848 3.28708 3.28708 5.464386×107
    1.3 3.36342 3.55697 3.63279 3.63279 6.039081×107
    1.4 3.71715 3.93106 4.01485 4.01485 6.674217×107
    1.5 4.10809 4.34449 4.43710 4.43710 7.376150×107
    1.6 4.54014 4.80141 4.90375 4.90375 8.151907×107
    1.7 5.01763 5.30638 5.41948 5.41948 9.009250×107
    1.8 5.54534 5.86445 5.98945 5.98945 9.956761×107
    1.9 6.12855 6.48122 6.61937 6.61937 1.100392×106
    2.0 6.77309 7.16286 7.31553 7.31553 1.216121×106

     | Show Table
    DownLoad: CSV
    Figure 9.  Fractional order comparison using ATIM for p=0.33,0.55,0.77,1.00.
    Figure 10.  Fractional order 3D and 2D comparison using ATIM for p=0.33,0.55,0.77,1.00.

    The study utilizes advanced analytical methods, precisely the ARPSM and the ATIM, to investigate the fractional Kawahara and fifth-order KdV equations. The discussion of figures and tables highlights the effectiveness of these methods in providing accurate approximate solutions, comparing their results with exact solutions, and examining the effects of fractional orders on the solutions.

    In conclusion, our analytical investigation into the fractional Kawahara equation and fifth-order KdV equations employing the ARPSM and ATIM has yielded significant insights and advancements in understanding nonlinear wave phenomena. Through rigorous analysis and computational simulations, we have demonstrated the effectiveness of these advanced analytical techniques in providing accurate and insightful solutions to these complex equations governed by fractional calculus under the Caputo operator framework. Our findings contribute to the theoretical understanding of nonlinear wave dynamics and offer practical analytical tools for addressing complex mathematical models in various scientific and engineering domains. Further research in this direction holds promise for exploring additional applications of the Aboodh methods and advancing our understanding of nonlinear wave phenomena in diverse real-world contexts. Future research can extend the ARPSM and ATIM methods to more complex nonlinear fractional PDEs, including those with higher-order fractional operators. Exploring their application to multidimensional systems could provide deeper insights into wave propagation in fields like quantum field theory. Investigating computational efficiency and convergence across different fractional orders may optimize these techniques for broader use. Applying these methods to real-world engineering problems could further validate their utility in practical settings.

    Conceptualization, M.Y.A.; Data curation, H.A.; Formal analysis, M.Y.A; Resources, H.A.; Investigation, M.Y.A.; Project administration, M.Y.A.; Validation, H.A.; Software, H.A.; Validation, M.Y.A.; Visualization, M.Y.A.; Validation, H.A.; Visualization, M.Y.A.; Resources, H.A.; Project administration, H.A.; Writing-review & editing, H.A.; Funding, M.Y.A. All authors have read and agreed to the published version of the manuscript.

    The authors gratefully acknowledge the funding of the Deanship of Graduate Studies and Scientific Research, Jazan University, Saudi Arabia, through project number: RG24-L02.

    The authors declare that they have no conflicts of interest.



    [1] C. Tomasi, R. Manduchi, Bilateral filtering for gray and color images, Sixth international conference on computer vision (IEEE Cat. No. 98CH36271), (1998), 839–846. http://dx.doi.org/10.1109/ICCV.1998.710815 doi: 10.1109/ICCV.1998.710815
    [2] S. Osher, M. Burger, D. Goldfarb, J. Xu, E. Yin, An iterative regularization method for total variation-based image restoration, Multiscale Model. Sim., 4 (2005), 460–489. http://dx.doi.org/10.1137/040605412 doi: 10.1137/040605412
    [3] Y. zhang, S. Li, B. Wu, S. Du, Image multiplicative denoising using adaptive Euler's elastica as the regularization, J. Sci. Comput., 90 (2022), 69. http://dx.doi.org/10.1007/s10915-021-01721-7 doi: 10.1007/s10915-021-01721-7
    [4] L. Rudin, P. L. Lions, S. Osher, Geometric level set methods in imaging, vision, and graphics, New York, USA: Springer, 2003. http://dx.doi.org/10.1007/0-387-21810-6_6
    [5] J. Shi, S. Osher, A nonlinear inverse scale space method for a convex multiplicative noise model, SIAM J. Imaging Sci., 1 (2008), 294–321. http://dx.doi.org/10.1137/070689954 doi: 10.1137/070689954
    [6] K. Bredies, K. Kunisch, T. Pock, Total generalized variation, SIAM J. Imaging Sci., 3 (2010), 492–526. http://dx.doi.org/10.1137/090769521 doi: 10.1137/090769521
    [7] Y. Lv, Total generalized variation denoising of speckled images using a primal-dual algorithm, J. Appl. Math. Comput., 62 (2020), 489–509. http://dx.doi.org/10.1007/s12190-019-01293-8 doi: 10.1007/s12190-019-01293-8
    [8] A. Ben-Loghfyry, A. Hakim, A. Laghrib, A denoising model based on the fractional Beltrami regularization and its numerical solution, J. Appl. Math. Comput., 69 (2023), 1431–1463. http://dx.doi.org/10.1007/s12190-022-01798-9 doi: 10.1007/s12190-022-01798-9
    [9] T. H. Ma, T. Z. Huang, X. L. Zhao, Spatially dependent regularization parameter selection for total generalized variation-based image denoising, Comput. Appl. Math., 37 (2018), 277–296. http://dx.doi.org/10.1007/s40314-016-0342-8 doi: 10.1007/s40314-016-0342-8
    [10] H. Houichet, A. Theljani, M. Moakher, A nonlinear fourth-order PDE for image denoising in Sobolev spaces with variable exponents and its numerical algorithm, Comput. Appl. Math., 40 (2021), 1–29. http://dx.doi.org/10.1007/s40314-021-01462-1 doi: 10.1007/s40314-021-01462-1
    [11] A. Hakim, A. Ben-Loghfyry, A total variable-order variation model for image denoising, AIMS Math., 4 (2019), 1320–1335. http://dx.doi.org/10.3934/math.2019.5.1320 doi: 10.3934/math.2019.5.1320
    [12] J. L. Starck, E. J. Candès, D. L. Donoho, The curvelet transform for image denoising, IEEE T. Image Process., 11 (2002), 670–684. http://dx.doi.org/10.1109/TIP.2002.1014998 doi: 10.1109/TIP.2002.1014998
    [13] J. Yang, Y. Wang, W. Xu, Q. Dai, Image and video denoising using adaptive dual-tree discrete wavelet packets, IEEE T. Circ. Syst. Vid., 19 (2009), 642–655. http://dx.doi.org/10.1109/TCSVT.2009.2017402 doi: 10.1109/TCSVT.2009.2017402
    [14] L. Fan, X. Li, H. Fan, Y. Feng, C. Zhang, Adaptive texture-preserving denoising method using gradient histogram and nonlocal self-similarity priors, IEEE T. Circ. Syst. Vid., 29 (2019), 3222–3235. http://dx.doi.org/10.1109/TCSVT.2018.2878794 doi: 10.1109/TCSVT.2018.2878794
    [15] Z. Long, N. H. Younan, Denoising of images with multiplicative noise corruption, 2005 13th European Signal Processing Conference, (2005), 1–4.
    [16] W. Dong, L. Zhang, G. Shi, X. Li, Nonlocally centralized sparse representation for image restoration, IEEE T. Image Process., 22 (2012), 1620–1630. http://dx.doi.org/10.1109/TIP.2012.2235847 doi: 10.1109/TIP.2012.2235847
    [17] A. Buades, B. Coll, J. M. Morel, A non-local algorithm for image denoising, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05), (2005), 60–65. http://dx.doi.org/10.1109/CVPR.2005.38 doi: 10.1109/CVPR.2005.38
    [18] K. Dabov, A. Foi, V. Katkovnik, K. Egiazarian, Image denoising by sparse 3-D transform-domain collaborative filtering, IEEE T. Image Process., 16 (2007), 2080–2095. http://dx.doi.org/10.1109/TIP.2007.901238 doi: 10.1109/TIP.2007.901238
    [19] S. Gu, L. Zhang, W. Zuo, X. Feng, Weighted nuclear norm minimization with application to image denoising, 2014 IEEE Conference on Computer Vision and Pattern Recognition, (2014), 2862–2869. http://dx.doi.org/10.1109/CVPR.2014.366 doi: 10.1109/CVPR.2014.366
    [20] J. Mairal, F. Bach, J. Ponce, G. Sapiro, A. Zisserman, Non-local sparse models for image restoration, 2009 IEEE 12th International Conference on Computer Vision, (2009), 2272–2279. http://dx.doi.org/10.1109/ICCV.2009.5459452 doi: 10.1109/ICCV.2009.5459452
    [21] W. Dong, L. Zhang, G. Shi, X. Li, Nonlocally centralized sparse representation for image restoration, IEEE T. Image Process., 22 (2013), 1620–1630. http://dx.doi.org/10.1109/TIP.2012.2235847 doi: 10.1109/TIP.2012.2235847
    [22] Q. Guo, C. Zhang, Y. Zhang, H. Liu, An efficient SVD-based method for image denoising, IEEE T. Circ. Syst. Vid., 26 (2016), 868–880. http://dx.doi.org/10.1109/TCSVT.2015.2416631 doi: 10.1109/TCSVT.2015.2416631
    [23] M. Yahia, T. Ali, M. M. Mortula, R. Abdelfattah, S. E. Mahdy, N. S. Arampola, Enhancement of SAR speckle denoising using the improved iterative filter, IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing, 13 (2020), 859–871. http://dx.doi.org/10.1109/JSTARS.2020.2973920 doi: 10.1109/JSTARS.2020.2973920
    [24] K. Zhang, W. Zuo, Y. Chen, D. Meng, L. Zhang, Beyond a gaussian denoiser: Residual learning of deep CNN for image denoising, IEEE T. Image Process., 26 (2017), 3142–3155. http://dx.doi.org/10.1109/TIP.2017.2662206 doi: 10.1109/TIP.2017.2662206
    [25] Y. Meng, J. Zhang, A novel gray image denoising method using convolutional neural network, IEEE Access, 10 (2022), 49657–49676. http://dx.doi.org/10.1109/ACCESS.2022.3169131 doi: 10.1109/ACCESS.2022.3169131
    [26] G. Wang, Z. Pan, Z. Zhang, Deep CNN Denoiser prior for multiplicative noise removal, Multimed. Tools Appl., 78 (2019), 29007–29019. http://dx.doi.org/10.1007/s11042-018-6294-9 doi: 10.1007/s11042-018-6294-9
    [27] H. Tian, B. Fowler, A. E. Gamal, Analysis of temporal noise in CMOS photodiode active pixel sensor, IEEE J. Solid-St. Circ., 36 (2001), 92–101. http://dx.doi.org/10.1109/4.896233 doi: 10.1109/4.896233
    [28] J. Zhang, K. Hirakawa, Improved denoising via Poisson mixture modeling of image sensor noise, IEEE T. Image Process., 26 (2017), 1565–1578. http://dx.doi.org/10.1109/TIP.2017.2651365 doi: 10.1109/TIP.2017.2651365
    [29] D. Chen, X. Teng, Novel variational approach for generalized signal dependent noise removal, 2018 11th International Symposium on Computational Intelligence and Design (ISCID), 2 (2018), 380–384. http://dx.doi.org/10.1109/ISCID.2018.10187 doi: 10.1109/ISCID.2018.10187
    [30] J. Zhang, Y. Duan, Y. Lu, M. K. Ng, H. Chang, Bilinear constraint based ADMM for mixed Poisson-Gaussian noise removal, arXiv preprint arXiv: 1910.08206, 2019.
    [31] M. Ghulyani, M. Arigovindan, Fast roughness minimizing image restoration under mixed Poisson–Gaussian noise, IEEE T. Image Process., 30 (2021), 134–149. http://dx.doi.org/10.1109/TIP.2020.3032036 doi: 10.1109/TIP.2020.3032036
    [32] S. Huang, T. Lu, Z. Lu, J. Rong, X. Zhao, J. Li, CMOS image sensor fixed pattern noise calibration scheme based on digital filtering method, Microelectron. J., 124 (2022), 10543. http://dx.doi.org/10.1016/j.mejo.2022.105431 doi: 10.1016/j.mejo.2022.105431
    [33] S. Lee, M. G. Kang, Poisson-Gaussian noise reduction for X-Ray images based on local linear minimum mean square error shrinkage in nonsubsampled contourlet transform domain, IEEE Access, 9 (2021), 100637–100651. http://dx.doi.org/10.1109/ACCESS.2021.3097078 doi: 10.1109/ACCESS.2021.3097078
    [34] J. Zhang, K. Hirakawa, Improved denoising via Poisson mixture modeling of image sensor noise, IEEE T. Image Process., 26 (2017), 1565–1578. http://dx.doi.org/10.1109/TIP.2017.2651365 doi: 10.1109/TIP.2017.2651365
    [35] A. Repetti, E. Chouzenoux, J. Pesquet, A penalized weighted least squares approach for restoring data corrupted with signal-dependent noise, 2012 Proceedings of the 20th European Signal Processing Conference (EUSIPCO), (2012), 1553–1557.
    [36] K. Hirakawa, T. W. Parks, Image denoising using total least squares, IEEE T. Image Process., 15 (2006), 2730–2742. http://dx.doi.org/10.1109/TIP.2006.877352 doi: 10.1109/TIP.2006.877352
    [37] Y. Qiu, Z. Gan, Y. Fan, X. Zhu, An adaptive image denoising method for mixture Gaussian noise, 2011 International Conference on Wireless Communications and Signal Processing (WCSP), (2011), 1–5. http://dx.doi.org/10.1109/WCSP.2011.6096774 doi: 10.1109/WCSP.2011.6096774
    [38] J. Byun, S. Cha, T. Moon, FBI-Denoiser: Fast blind image denoiser for Poisson-Gaussian noise, IEEE Conference on Computer Vision and Pattern Recognition, (2021), 5768–5777. http://dx.doi.org/10.1109/CVPR46437.2021.00571 doi: 10.1109/CVPR46437.2021.00571
    [39] D. L. Donoho, De-noising by soft-thresholding, IEEE T. Inform. Theory, 41 (1995), 613–627. https://doi.org/10.1109/18.382009 doi: 10.1109/18.382009
    [40] J. Immerkær, Fast noise variance estimation, Comput. Vis. Image Und., 64 (1996), 300–302. http://dx.doi.org/10.1006/cviu.1996.0060 doi: 10.1006/cviu.1996.0060
    [41] D. Zoran, Y. Weiss, Scale invariance and noise in natural images, 2009 IEEE 12th International Conference on Computer Vision, (2009), 2209–2216. https://doi.org/10.1109/ICCV.2009.5459476 doi: 10.1109/ICCV.2009.5459476
    [42] S. Zhu, Z. Yu, Self-guided filter for image denoising, IET Image Prosess, 14 (2020), 2561–2566. http://dx.doi.org/10.1049/iet-ipr.2019.1471 doi: 10.1049/iet-ipr.2019.1471
    [43] L. Lu, W. Jin, X. Wang, Non-local means image denoising with a soft threshold, IEEE Signal Proc. Lett., 22 (2015), 833–837. http://dx.doi.org/10.1109/LSP.2014.2371332 doi: 10.1109/LSP.2014.2371332
    [44] D. -G. Kim, Y. Ali, M. A. Farooq, A. Mushtaq, M. A. A. Rehman, Z. H. Shamsi, Hybrid Deep Learning Framework for Reduction of Mixed Noise via Low Rank Noise Estimation, IEEE Access, 10 (2022), 46738–46752. http://dx.doi.org/10.1109/ACCESS.2022.3170490 doi: 10.1109/ACCESS.2022.3170490
    [45] D. H. Shin, R. H. Park, S. Yang, J. H. Jung, Block-based noise estimation using adaptive Gaussian filtering, IEEE T. Consum. Electr., 51 (2005), 218–226. http://dx.doi.org/10.1109/TCE.2005.1405723 doi: 10.1109/TCE.2005.1405723
    [46] A. Danielyan, A. Foi, Noise variance estimation in nonlocal transform domain, 2009 International Workshop on Local and Non-Local Approximation in Image Processing, (2009), 41–45. https://doi.org/10.1109/LNLA.2009.5278404 doi: 10.1109/LNLA.2009.5278404
    [47] X. Liu, M. Tanaka, M. Okutomi, Noise level estimation using weak textured patches of a single noisy image, 2012 19th IEEE International Conference on Image Processing, (2012), 665–668. http://dx.doi.org/10.1109/ICIP.2012.6466947 doi: 10.1109/ICIP.2012.6466947
    [48] X. Liu, M. Tanaka, M. Okutomi, Estimation of signal dependent noise parameters from a single image, 2013 IEEE International Conference on Image Processing, (2013), 79–82. http://dx.doi.org/10.1109/ICIP.2013.6738017 doi: 10.1109/ICIP.2013.6738017
    [49] C. Sutour, A.-C. Deledalle, F.-J. Aujol, Estimation of the noise level function based on a non-parametric detection of homogeneous image regions, SIAM J. Imaging Sci., 8 (2015), 1–31. http://dx.doi.org/10.1137/15M1012682 doi: 10.1137/15M1012682
    [50] Z. Wang, Z. Huang, Y. Xu, Y. Zhang, X. Li, X. Li, et al., Image Noise Level Estimation by Employing Chi-Square Distribution, 2021 IEEE 21st International Conference on Communication Technology (ICCT), (2021), 1158–1161. http://dx.doi.org/10.1109/ICCT52962.2021.9657946 doi: 10.1109/ICCT52962.2021.9657946
    [51] V. A. Pimpalkhute, R. Page, A. Kothari, K. M. Bhurchandi, V. M. Kamble, Digital image noise estimation using DWT coefficients, IEEE T. Image Process., 30 (2021), 1962–1972. http://dx.doi.org/10.1109/TIP.2021.3049961 doi: 10.1109/TIP.2021.3049961
    [52] J. Sijbers, A. den Dekker, Maximum likelihood estimation of signal amplitude and noise variance from MR data, Magnetic Resonance in Medicine: An Official Journal of the International Society for Magnetic Resonance in Medicine, 51 (2004), 586–594. http://dx.doi.org/10.1002/mrm.10728 doi: 10.1002/mrm.10728
    [53] M. W. Wu, Y. Jin, Y. Li, T. Song, P. Y. Kam, Maximum-likelihood, magnitude-based, amplitude and noise variance estimation, IEEE Signal Proc. Lett., 28 (2021), 414–418. http://dx.doi.org/10.1109/LSP.2021.3055464 doi: 10.1109/LSP.2021.3055464
    [54] A. G. Vostretsov, S. G. Filatova, The Estimation of Parameters of Pulse Signals Having an Unknown Form That Are Observed against the Background of the Additive Mixture of the White Gaussian Noise and a Linear Component with Unknown Parameters, Journal of Communications Technology and Electronics, 66 (2021), 938–947. http://dx.doi.org/10.1134/S106422692108009X doi: 10.1134/S106422692108009X
    [55] R. A. Fisher, On the mathematical foundations of theoretical statistics, Philosophical Transactions of the Royal Society of London. Series A, Containing Papers of a Mathematical or Physical Character, 222 (1922), 309–368. http://dx.doi.org/10.1098/rsta.1922.0009 doi: 10.1098/rsta.1922.0009
    [56] Y. Ouyang, S. Wang, L. Zhang, Quantum optical interferometry via the photon-added two-mode squeezed vacuum states, J. Opt. Soc. Am. B, 33 (2016), 1373–1381. https://doi.org/10.1364/JOSAB.33.001373 doi: 10.1364/JOSAB.33.001373
    [57] G. C. Knee, W. J. Munro, Fisher information versus signal-to-noise ratio for a split detector, PHYS. REV. A, 92 (2015), 012130. http://dx.doi.org/10.1103/PhysRevA.92.012130 doi: 10.1103/PhysRevA.92.012130
    [58] J. Chao, E. S. Ward, R. J. Ober, Fisher information theory for parameter estimation in single molecule microscopy: tutorial, J. Opt. Soc. Am. A, 33 (2016), B36–B57. https://doi.org/10.1364/JOSAA.33.000B36 doi: 10.1364/JOSAA.33.000B36
    [59] J. Kirkpatrick, R. Pascanu, N. Rabinowitz, J. Veness, G. Desjardins, A. A. Rusu, et al., Overcoming catastrophic forgetting in neural networks, Proceedings of the national academy of sciences, 114 (2017), 3521–3526. https://doi.org/10.1073/pnas.1611835114 doi: 10.1073/pnas.1611835114
    [60] J. Martens, New insights and perspectives on the natural gradient method, The Journal of Machine Learning Research, 21 (2020), 5776–5851.
  • This article has been cited by:

    1. Aljawhara H. Almuqrin, Sherif M. E. Ismaeel, C. G. L. Tiofack, A. Mohamadou, Badriah Albarzan, Weaam Alhejaili, Samir A. El-Tantawy, Solving fractional physical evolutionary wave equations using advanced techniques, 2025, 2037-4631, 10.1007/s12210-025-01320-w
    2. Samir A. El-Tantawy, Sahibzada I. H. Bacha, Muhammad Khalid, Weaam Alhejaili, Application of the Tantawy Technique for Modeling Fractional Ion-Acoustic Waves in Electronegative Plasmas having Cairns Distributed-Electrons, Part (I): Fractional KdV Solitary Waves, 2025, 55, 0103-9733, 10.1007/s13538-025-01741-w
  • Reader Comments
  • © 2023 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Metrics

Article views(1689) PDF downloads(52) Cited by(3)

Figures and Tables

Figures(6)  /  Tables(2)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog