iconOpen Access

ARTICLE

crossmark

Analysis of a Laplace Spectral Method for Time-Fractional Advection-Diffusion Equations Incorporating the Atangana-Baleanu Derivative

Kamran1,*, Farman Ali Shah1, Kallekh Afef 2, J. F. Gómez-Aguilar 3, Salma Aljawi4, Ioan-Lucian Popa5,6,*

1 Department of Mathematics, Islamia College Peshawar, Peshawar, Khyber Pakhtoon Khwa, 25120, Pakistan
2 Department of Mathematics, College of Science, King Khalid University, Abha, 61413, Saudi Arabia
3 Centro de Investigación en Ingenierìa y Ciencias Aplicadas (CIICAp-IICBA)/UAEM, Universidad Autónoma del Estado de Morelos, Av. Universidad 1001. Col. Chamilpa, Cuernavaca, 62209, Morelos, México
4 Department of Mathematical Sciences, Princess Nourah Bint Abdulrahman University, Riyadh, 11671, Saudi Arabia
5 Department of Computing, Mathematics and Electronics, “1 Decembrie 1918” University of Alba Iulia, Alba Iulia, 510009, Romania
6 Faculty of Mathematics and Computer Science, Transilvania University of Brasov, Iuliu Maniu Street 50, Brasov, 500091, Romania

* Corresponding Authors: Kamran. Email: email; Ioan-Lucian Popa. Email: email

(This article belongs to the Special Issue: Analytical and Numerical Solution of the Fractional Differential Equation)

Computer Modeling in Engineering & Sciences 2025, 143(3), 3433-3462. https://doi.org/10.32604/cmes.2025.064815

Abstract

In this article, we develop the Laplace transform (LT) based Chebyshev spectral collocation method (CSCM) to approximate the time fractional advection-diffusion equation, incorporating the Atangana-Baleanu Caputo (ABC) derivative. The advection-diffusion equation, which governs the transport of mass, heat, or energy through combined advection and diffusion processes, is central to modeling physical systems with nonlocal behavior. Our numerical scheme employs the LT to transform the time-dependent time-fractional PDEs into a time-independent PDE in LT domain, eliminating the need for classical time-stepping methods that often suffer from stability constraints. For spatial discretization, we employ the CSCM, where the solution is approximated using Lagrange interpolation polynomial based on the Chebyshev collocation nodes, achieving exponential convergence that outperforms the algebraic convergence rates of finite difference and finite element methods. Finally, the solution is reverted to the time domain using contour integration technique. We also establish the existence and uniqueness of the solution for the proposed problem. The performance, efficiency, and accuracy of the proposed method are validated through various fractional advection-diffusion problems. The computed results demonstrate that the proposed method has less computational cost and is highly accurate.

Keywords

Laplace transform; spectral method; existence theory; fractional derivative with non-singular kernel; contour integration methods

1  Introduction

Fractional calculus (FC) is a historical discipline in mathematics that traces its origins to the works of Leibniz and Euler, who explored integrals and derivatives of non-integer orders [1]. Despite significant advancements, this topic continues to captivate researchers due to its rich mathematical and numerical aspects. Today, FC extends beyond pure mathematics and has found applications in various scientific disciplines [2]. Replacing standard operators with fractional operators has significantly enhanced the precision and accuracy of numerous physical models and systems [35]. Researchers have explored numerous fractional operators and assessed various definitions of fractional derivatives, particularly those governed by power-law kernels, commonly known as singular or local fractional derivatives. Notable examples include the Grünwald-Letnikov, Riemann-Liouville, Caputo, Riesz, and Hadamard fractional derivatives [6]. However, these fractional derivatives can efficiently model the non-local and dissipative properties of physical processes. The non-locality of a fractional derivative refers to the fact that the value of a fractional derivative at a given point depends on the function’s values over an entire interval rather than just at the point itself.

In 2015, Caputo and Fabrizio [7] introduced a new fractional derivative, termed the Caputo-Fabrizio (CF) derivative, which employs an exponential kernel to overcome the limitations of fractional derivatives with singular kernels, such as those found in the Riemann-Liouville and Liouville-Caputo derivatives. The singularity in these earlier definitions often complicates their application to physical systems. The CF derivative’s exponential kernel, being nonsingular, provides a more natural transition and eliminates the issues associated with the Riemann-Liouville and Liouville-Caputo derivatives. However, despite its innovation, the CF derivative faced criticisms for a notable drawback: its kernel lacks nonlocality. To address these shortcomings, Atangana and Baleanu [8] introduced a novel fractional derivative in 2016, known as Atangana-Baleanu (AB) derivative, which is based on the Mittag-Leffler function. Unlike the CF derivative the AB derivative incorporates a nonlocal and nonsingular kernel, effectively combining the strengths of the Riemann-Liouville, Liouville-Caputo, and Caputo-Fabrizio derivatives. The AB derivative provides several advantages: (i) its nonlocal nature guarantees that it captures the full historical behavior of the function being differentiated; (ii) it has an adjustable parameter, that lets researchers change the fractional order to enhance data-fitting accuracy; (iii) the AB derivative exhibits greater flexibility than its predecessor’s derivatives, enabling accurate modeling of complex systems; and (iv) it offers a unifying structure that can refine and improve the existing models across various scientific domains by integrating the features of the Riemann-Liouville, Liouville-Caputo and extending their applicability. Due to these compelling attributes, the AB derivative has gained significant attention and has been successfully applied to a wide range of real-world problems [9].

Time-fractional advection-diffusion equations (TFADEs) are widely used models in applied mathematics to describe various physical systems. The advection term represents the movement of a fluid along a concentration gradient, while the diffusion term describes the process by which material spreads from regions of higher to lower concentration over time. TFADEs are applied to transport processes, including the long-range dispersion of air pollutants [10], turbulence [11], water transport in soil [12], dispersion in porous media [13], shallow water flow [14], ion transport in heterogeneous media [15], blood flow with chemical interactions [16], and contaminant transport in soil [17].

Analytical solutions for TFADEs have been derived by various researchers. For example, Sanskrityayn and Kumar [18] derived analytical solutions to TFADEs using Green’s function methods. Avci and Yetim [19] obtained analytical solutions for TFADEs incorporating the Atangana-Baleanu fractional derivative, while Mirza and Vieru [20] derived fundamental solutions for TFADEs using the Caputo-Fabrizio derivative. However, obtaining exact solutions for TFADEs is often challenging due to the involvement of complex functions, which can be difficult to handle analytically.

As a result, developing accurate and efficient numerical schemes has become essential. Many authors in the literature have proposed numerical solutions for TFADEs. Umer et al. [21] analyzed numerical solutions of advection-diffusion equations with the Atangana-Baleanu fractional derivative using an extended cubic B-spline technique. Fazio et al. [22] studied a finite difference method on non-uniform meshes for TFADEs with a source term. Ahmed et al. [23] applied a Haar wavelet-based numerical technique to solve TFADEs. Kamran et al. [24] investigated numerical inverse Laplace transform methods for approximating TFADEs.

Other contributions include the work by Pareek et al. [25], who developed the natural transform method for solving TFADEs, and Chawla et al. [26], who utilized extended one-step time integration schemes. Liu et al. [27] proposed a radial basis function (RBF)-based differential quadrature method for solving two-dimensional TFADEs. Nguyen and Reynen [28] devised a space-time least squares finite element scheme for approximating TFADEs, while Cunha et al. [29] employed the boundary element method to solve TFADEs. Sweilam et al. [30] simulated TFADEs using a spectral collocation method combined with a non-standard finite difference technique.

Many authors have developed and modified numerical methods for the approximation of fractional partial differential equations (FPDEs) from various perspectives, focusing on improving accuracy, stability, efficiency, consistency, and performance in terms of computational cost. In recent years, hybrid methods have gained significant attention due to their high accuracy, low computational cost, and ease of implementation for discretizing FPDEs.

Hybrid methods combine two or more approaches, enabling them to mitigate the limitations of individual methods. As a result, hybrid methods can approximate complex problems in a simple and effective manner. In the literature, several researchers have proposed hybrid methods. For example, Yin et al. [31] combined the Laplace transform and Legendre wavelet methods for the numerical simulation of Klein-Gordon equations. Soares and Mansur [32] coupled the boundary element method with the finite element method for solving acoustic elastodynamic problems. A hybrid method based on the Laplace transform and Legendre wavelet approaches was analyzed in [33] for the approximation of Lane-Emden equations. Khan et al. [34] combined the homotopy perturbation method with the Laplace transform method to solve fractional models. Joujehi et al. [35] developed a hybrid method based on Beta functions and fractional-order Bernoulli wavelets for approximating multi-term TFPDEs in fluid mechanics. A review of the Jacobi-Galerkin spectral method for linear partial differential equations is examined by Hafez and Youssri [36]. Lim and Li [37] coupled the boundary element method with the finite difference method to approximate fluid-structure interaction problems with dynamic analysis of outer hair cells. Kamran et al. [38] combined the Laplace transform with radial basis functions for the numerical approximation of the mobile-immobile advection-dispersion problem arising in solute transport. Sahu and Jena [39] developed an efficient technique for time fractional Klein-Gordon equation based on modified Laplace Adomian decomposition technique via hybridized Newton-Raphson Scheme arises in relativistic fractional quantum mechanics.

The main objective of this work is to develop and analyze a hybrid Laplace Transform-based Chebyshev Spectral Collocation Method (LT-CSCM) for the efficient numerical solution of time-fractional advection-diffusion equations (TFADEs) featuring a nonsingular kernel. By combining the LT for temporal discretization with the CSCM for spatial discretization, our method aims to achieve high accuracy and computational efficiency.

The CSCM is a subclass of spectral methods that has recently garnered significant attention due to its straightforward implementation for the spatial approximation of fractional partial differential equations (FPDEs). Within the numerical framework for FPDEs, CSCM belongs to the family of Weighted Residual Methods (WRMs) [40]. This family includes the Tau, Galerkin, and collocation methods, each employing distinct techniques to minimize residuals. In the Galerkin and Tau methods, residuals are projected onto a polynomial space and constrained to be zero, while the collocation method enforces zero residuals at specific grid points. For FPDEs, Chebyshev collocation points are highly effective as grid points due to their optimal distribution, which enhances numerical accuracy. CSCM utilizes basis functions, typically Lagrange interpolation polynomials, defined at these points [41]. This global approach achieves spectral convergence, delivering high accuracy for problems with simple geometries and smooth solutions [42,43]. Compared to finite difference or finite element methods, CSCM is easier to implement and significantly reduces computational cost.

The CSCMs have been widely adopted by numerous researchers for many applications. Such as Khader and Saad [44] utilized the CSCM for the solution of the fractional Fisher problems. In [45], the authors proposed approximating fractional-order diffusion problems using CSCM combined with a power-series method based on residuals. The authors of [46] obtained the solution of the time-fractional advection-diffusion equation using CSCM. Tohidi [47] developed a numerical scheme for finding approximate solutions of one-dimensional parabolic partial differential equations (PDEs) under non-classical boundary conditions. In [48], the authors proposed a spectral collocation method based on differentiated Chebyshev polynomials to obtain numerical solutions for various types of nonlinear partial differential equations. Li et al. [49] employed the CSCM to solve the transport equation with given initial and boundary conditions. Rongpei et al. [50] solved two-dimensional nonlinear reaction-diffusion equations with Neumann boundary conditions using a new highly accurate CSCM.

The LT is an efficient and error-free method for the temporal discretization of FPDEs, addressing stability issues often encountered with traditional time-marching methods. These methods are stable and accurate only if the error calculated in a one-time step does not amplify as computations progress. In other words, time-marching methods remain stable if the error diminishes or remains unchanged during computations. Moreover, achieving optimal accuracy with time-marching methods typically requires smaller time steps, which significantly increases computational cost [51], thus affecting the overall efficiency of the method. One of its key advantages is its ability to convert differential equations into algebraic equations, making complex problems more manageable. Additionally, it provides a systematic approach for handling initial conditions directly within the transformed domain, avoiding the need for numerical time-stepping methods that may suffer from stability issues [52]. The LT is particularly beneficial for solving linear time-invariant systems and fractional differential equations, as it allows for analytical solutions in many cases [53]. However, the method also has limitations. It is less effective for nonlinear problems, as transforming the nonlinear terms is not straightforward, often requiring approximations or numerical techniques [54]. By employing the LT for temporal discretization, the FPDEs are transformed into the Laplace domain. To obtain the solution in the time domain, the inverse Laplace transform (ILT) must be applied. However, the exact computation of Evaluating the Bromwich integral is computationally complex, prompting the adoption of numerical inverse Laplace transform methods (ILTMs). Several authors have developed numerical ILTMs. For instance: De Hoog et al. [55] employed the quotient-difference scheme to formulate an improved ILTM that accelerates Fourier series convergence. Stehfest [56] developed a linear acceleration method using Salzer’s approach for numerical inversion of the LT. Talbot [57] introduced an efficient ILTM. Weideman and Trefethen [58] utilized parabolic and hyperbolic contours to approximate the Bromwich integral. Weeks [59] employed Laguerre functions for numerical ILTM. Each numerical method for inverting the Laplace transform has specific applications and is best suited to a particular problem. Contour integration methods, such as those based on hyperbolic, parabolic, or Talbot contours, are particularly effective for partial differential equations (PDEs) due to their ease of implementation and high accuracy. These methods deform the integration path in the complex plane to optimize convergence, minimizing computational complexity while maintaining precision. In this work, we utilize the numerical ILTMs described in [58,60]. Consider the following 2-D TFADE:

{τσu(x¯,τ)=Lu(x¯,τ)+ξ(x¯,τ),(x¯,τ)Θ×[0,1],Bu(x¯,τ)=ζ(x¯,τ),x¯Θ,u(x¯,0)=u0,(1)

where, x¯=(x,y)Θ=[1,1]2R2, Θ is the bound of Θ,  L is the linear differential operator  Lu(x¯,τ)=a1Δu(x¯,τ)a2u(x¯,τ), with a1,a2 positive constants, B a linear boundary operator, ξ(x¯,τ), ζ(x¯,τ) continuous functions, and the Atangana-Baleanu-Caputo (ABC) time-fractional derivative of order σ[0,1] defined as [8]

τσu(x¯,τ)=B(σ)1σ0τsu(x¯,s)Eσ(σ(τs)σ1σ)ds,(2)

with

B(σ)=σΓ(σ)+(1σ),

and Eσ(.) the Mittag-Leffler function defined as

Eσ(τ)=r=0τrΓ(rσ+1),σ>0, τ(,).(3)

2  Existence and Uniqueness of the Solution

In this section, we utilize the fixed-point theory to prove the existence and uniqueness of the solution to the fractional advection-diffusion model (1). Let us define a Banach space C(Λ,R) of continuous functions from Λ=Θ×[0,1] into R, equipped with the norm defined by u:=sup{|u(x¯,τ)|;(x¯,τ)Λ}. By applying the AB-fractional integral operator to (1), we obtain

u(x¯,τ) = u0+1σB(σ)(a1Δu(x¯,τ)a2u(x¯,τ)+ξ(x¯,τ))+σΓ(σ)B(σ)0τ(τs)σ1(a1Δu(x¯,τ)a2u(x¯,τ)+ξ(x¯,τ))ds.(4)

Let define the operator X:C(Λ,R)C(Λ,R), that reformulates problem (1) as a fixed-point problem, given by

Xu(x¯,τ) = u0+1σB(σ)(a1Δu(x¯,τ)a2u(x¯,τ)+ξ(x¯,τ))+σΓ(σ)B(σ)0τ(τs)σ1(a1Δu(x¯,τ)a2u(x¯,τ)+ξ(x¯,τ))ds.(5)

The fixed point of X, corresponds to the solution of problem (1). We assume the following hypotheses before proving our main results: for any (x¯,τ)  Λ, there exist κk>0, k=1,2,3,4,5,6, such that

(A1)|Δu(x¯,τ)|κ1|u(x¯,τ)|,(A2)|u(x¯,τ)|κ2|u(x¯,τ)|,(A3)|u0|κ3,(A4)|ξ(x¯,τ)|κ4,(A5)|Δu1(x¯,τ)Δu2(x¯,τ)|κ5|u1(x¯,τ)u2(x¯,τ)|,(A6)|u1(x¯,τ)u2(x¯,τ)|κ6|u1(x¯,τ)u2(x¯,τ)|.

Theorem 1. If assumptions (A5,A6) hold then problem (1) has a unique solution.

Proof. The proof consists of several steps.

Step 1: Continuity of X. We will show that X is continuous. Suppose a sequence umu, where uC(Λ,R). For (x¯,τ)Λ and using the bounds in (A5,A6) we can write

Xum(x¯,τ)Xu(x¯,τ)=sup{|Xum(x¯,τ)Xu(x¯,τ)|}=sup{|1σB(σ)(a1Δum(x¯,τ)a2um(x¯,τ))+σΓ(σ)B(σ)0τ(τs)σ1(a1Δum(x¯,τ)a2um(x¯,τ))ds1σB(σ)(a1Δu(x¯,τ)a2u(x¯,τ))σΓ(σ)B(σ)0τ(τs)σ1(a1Δu(x¯,τ)a2u(x¯,τ))ds|} sup{1σB(σ)(|a1||Δum(x¯,τ)Δu(x¯,τ)|+|a2||um(x¯,τ)u(x¯,τ)|)σΓ(σ)B(σ)0τ(τs)σ1(|a1||Δum(x¯,τ)Δu(x¯,τ)|+|a2||um(x¯,τ)u(x¯,τ)|)ds} sup{1σB(σ)+σΓ(σ)B(σ)0τ(τs)σ1(κ5|a1||um(x¯,τ)u(x¯,τ)|+κ6|a2||um(x¯,τ)u(x¯,τ)|)ds} sup{1σB(σ)+τσΓ(σ)B(σ)(κ5|a1|+κ6|a2|)|um(x¯,τ)u(x¯,τ)|} τσ+(1σ)Γ(σ)Γ(σ)B(σ)(κ5|a1|+κ6|a2|)umu,

Since u is continuous. Hence, we obtain

umu0,as m.

Therefore, X is continuous.

Step 2: Boundedness of X. Next, we show that X maps bounded sets to bounded sets. It is sufficient to prove that for γ>0 there exists ρ>0 such that if uRγ={uC(Λ,R):uγ} then it is Xuϱ. For τ[0,T] and utilizing the assumptions (A1–A4) we have

|Xu(x¯,τ)|=|u0+1σB(σ)(a1Δu(x¯,τ)a2u(x¯,τ)+ξ(x¯,τ))+σΓ(σ)B(σ)0τ(τs)σ1(a1Δu(x¯,τ)a2u(x¯,τ)+ξ(x¯,τ))ds| |u0|+1σB(σ)(|a1||Δu(x¯,τ)|+|a2||u(x¯,τ)|+|ξ(x¯,τ)|)+σΓ(σ)B(σ)0τ(τs)σ1(|a1||Δu(x¯,τ)|+|a2||u(x¯,τ)|+|ξ(x¯,τ)|)ds κ3+1σB(σ)(κ1|a1||u(x¯,τ)|+κ2|a2||u(x¯,τ)|+κ4)+σΓ(σ)B(σ)0τ(τs)σ1(κ1|a1||u(x¯,τ)|+κ2|a2||u(x¯,τ)|+κ4)ds

κ3+1σB(σ)(|a1|κ1u+|a2|κ2u+κ4)+σΓ(σ)B(σ)0τ(τs)σ1(|a1|κ1u+|a2|κ2u+κ4)dsκ3+(1σ)Γ(σ)B(σ)(|a1|κ1u+|a2|κ2u+κ4)+τσΓ(σ)B(σ)(κ1|a1|u+|a2|κ2u+κ4)κ3+(1σ)Γ(σ)+τσΓ(σ)B(σ)(κ1|a1|u+κ2|a2|u+κ4)κ3+(1σ)Γ(σ)+τσΓ(σ)B(σ)((κ1|a1|+κ2|a2|)u+κ4).

Defining

ρ=κ3+τσ+Γ(σ)(1σ)Γ(σ)B(σ)((κ1|a1|+κ2|a2|)γ+κ4),

it follows that Xuρ proving that X maps bounded sets to bounded sets.

Step 3: Equicontinuity of X. Let consider uRγ and (x¯1,τ1),(x¯2,τ2)Λ, such that x¯1<x¯2, τ1<τ2. We have

|Xu(x¯1,τ1)Xu(x¯2,τ2)|=|1σB(σ)(a1Δu(x¯1,τ1)a2u(x¯1,τ1)+ξ(x¯1,τ1))+σΓ(σ)B(σ)0τ1(τ1s1)σ1(a1Δu(x¯1,τ1)a2u(x¯1,τ1)+ξ(x¯1,τ1))ds11σB(σ)(a1Δu(x¯2,τ2)a2u(x¯2,τ2))σΓ(σ)B(σ)0τ2(τ2s2)σ1(a1Δu(x¯2,τ2)a2u(x¯2,τ2)+ξ(x¯2,τ2))ds2|1σB(σ)(|a1||Δu(x¯1,τ1)|+|a2||u(x¯1,τ1)|+|ξ(x¯1,τ1)|)+σΓ(σ)B(σ)0τ1(τ1s1)σ1(|a1||Δu(x¯1,τ1)|+|a2||u(x¯1,τ1)|+|ξ(x¯1,τ1)|)ds11σB(σ)(|a1||Δu(x¯2,τ2)|+|a2||u(x¯2,τ2)|+|ξ(x¯2,τ2)|)σΓ(σ)B(σ)0τ2(τ2s2)σ1(|a1||Δu(x¯2,τ2)|+|a2||u(x¯2,τ2)|+|ξ(x¯2,τ2)|)ds21σB(σ)(κ1|a1||u(x¯1,τ1)|+κ2|a2||u(x¯1,τ1)|+κ4)+σΓ(σ)B(σ)0τ1(τ1s1)σ1(|a1|κ1|u(x¯1,τ1)|+|a2|κ2|u(x¯1,τ1)|+κ4)ds11σB(σ){|a1|κ1|u(x¯2,τ2)|+|a2|κ2|u(x¯2,τ2)|+κ4}σΓ(σ)B(σ)0τ1(τ2s2)σ1(|a1|κ1|u(x¯2,τ2)|+|a2|κ2|u(x¯2,τ2)|+κ4)ds21σB(σ)(|a1|κ1u+|a2|κ2u+κ4)+σΓ(σ)B(σ)0τ1(τ1s1)σ1(|a1|κ1u+|a2|κ2u+κ4)ds11σB(σ)(|a1|κ1u+|a2|κ2u+κ4)σΓ(σ)B(σ)0τ2(τ2s2)σ1(|a1|κ1u+|a2|κ2u+κ4)ds2

=σΓ(σ)B(σ)0τ1(τ1s1)σ1(|a1|κ1u+|a2|κ2u+κ4)ds1σΓ(σ)B(σ)0τ2(τ2s2)σ1(|a1|κ1u+|a2|κ2u+κ4)ds2=(0τ1(τ1s1)σ1ds10τ2(τ2s2)σ1ds2)[σΓ(σ)B(σ)(|a1|κ1u+|a2|κ2u+κ4)]=τ1στ2σΓ(σ)B(σ)(|a1|κ1u+|a2|κ2u+κ4).

It follows that

|Xu(x¯1,τ1)Xu(x¯2,τ2)|0as τ1  τ2.

By the Arzelà-Ascoli Theorem [61], the operator X is completely continuous.

Step 4: A Priori Bound. Define χ={uC(Λ,R):u=εXu,ε(0,1)}. We prove that χ is bounded. If uχ, then u=εXu, with 0<ε<1. Then for τ[0,T], using Eq. (5) we have

|u|=|εXu|=|ε×(u0+1σB(σ)(a1Δu(x¯,τ)a2u(x¯,τ)+ξ(x¯,τ))+σΓ(σ)B(σ)0τ(τs)σ1(a1Δu(x¯,τ)a2u(x¯,τ)+ξ(x¯,τ))ds)|.

Now, using assumptions (A1A4) we get

|u|=ε×(κ3+(1σ)Γ(σ)+τσΓ(σ)B(σ)((κ1|a1|+κ2|a2|)u+κ4)),

which gives

u=ε×ρ,

where ρ is as defined in Step 2. This shows that χ is bounded. By the Schaefer Fixed Point Theorem [61], X has at least one fixed point. Consequently, the considered problem has at least one solution. □ (25A1)

Theorem 2. The problem define in Eq. (1) has a unique solution if the assumptions (A5,A6) hold and

(1σ)Γ(σ)+τσΓ(σ)B(σ){κ5|a1|+κ6|a2|}<1.

Proof

Xu1(x¯,τ)Xu2(x¯,τ)=sup{|Xu1(x¯,τ)Xu2(x¯,τ)|}=sup{|1σB(σ)(a1Δu1(x¯,τ)a2u1(x¯,τ))+σΓ(σ)B(σ)0τ(τs)σ1(a1Δu1(x¯,τ)a2u1(x¯,τ))ds1σB(σ)(a1Δu2(x¯,τ)a2u2(x¯,τ))σΓ(σ)B(σ)0τ(τs)σ1(a1Δu2(x¯,τ)a2u2(x¯,τ))ds|}sup{1σB(σ)(|a1||Δu1(x¯,τ)Δu2(x¯,τ)|+|a2||u1(x¯,τ)u2(x¯,τ)|)σΓ(σ)B(σ)0τ(τs)σ1(|a1||Δu1(x¯,τ)Δu2(x¯,τ)|+|a2||u1(x¯,τ)u2(x¯,τ)|)ds}sup{1σB(σ)+σΓ(σ)B(σ)0τ(τs)σ1(κ5|a1||u1(x¯,τ)u2(x¯,τ)|+κ6|a2||u1(x¯,τ)u2(x¯,τ)|)ds}sup{1σB(σ)+τσΓ(σ)B(σ)(κ5|a1|+κ6|a2|)|u1(x¯,τ)u2(x¯,τ)|}τσ+(1σ)Γ(σ)Γ(σ)B(σ)(κ5|a1|+κ6|a2|)u1u2.

Thus, we find that under the given assumptions X is a contraction. By the Banach Fixed-Point Theorem [61], X has a unique fixed point. Therefore, the problem defined in Eq. (1) has a unique solution. □ (25A1)

3  Methodology

In the LT-CSCM approach, the Laplace Transform (LT) transforms Eq. (1) into the Laplace domain, enabling efficient temporal discretization. The Chebyshev Spectral Collocation Method (CSCM) is then applied to discretize spatial variables with high accuracy. Finally, the time-domain solution is recovered using the Talbot method for numerical inverse Laplace transform, ensuring precision and computational efficiency.

3.1 Temporal Discretization

The Laplace Transform is used for the temporal discretization of the proposed problem defined in Eq. (1). The LT of u(x¯,τ) is defined as

{u(x¯,τ)}=u^(x¯,s)=0esτu(x¯,τ)dτ.

The LT of the ABC derivative, τσu(x¯,τ), defined in Eq. (2), is given by [8]

{τσu(x¯,τ)}=B(σ)(sσu^(x¯,s)sσ1u0)sσ(1σ)+σ.

Applying the LT to Eq. (1) yields

B(σ)(sσu^(x¯,s)sσ1u0)sσ(1σ)+σ=Lu^(x¯,s)+ξ^(x¯,s),x¯Θ,(6)

and

Bu^(x¯,s)=ζ^(x¯,s),x¯Θ.(7)

Simplifying further, we obtain

{(B(σ)sσsσ(1σ)+σ)IL}u^(x¯,s)=S^(x¯,s),x¯Θ,(8)

and

Bu^(x¯,s)=ζ^(x¯,s),x¯Θ,(9)

where

S^(x¯,s)=B(σ)sσ1u0sσ(1σ)+σ+ξ^(x¯,s),

and I is the (N+1)×(N+1) identity operator. The time independent problem in Eqs. (8) and (9) is solved for each s in the Laplace space, using CSCM for spatial discretization. Finally, numerical ILTM is used to to recover the time-domain solution of (1). The next section explains the CSCM approach.

3.2 Spatial Discretization by Chebyshev Spectral Collocation Method

In CSCM, a global polynomial interpolant is utilized on specific nodes (Chebychev nodes) to approximate the unknown solution of a FPDEs. The spatial derivatives are computed using discrete derivative operators, also called differentiation matrices (DM) [41].

The solution is considered over [1,1] and interpolates {(xm,u^(xm))}, by [42,46]

IN(x)=m=0Nlm(x)u^m,

where u^m=u^(xm), and the basic Lagrange polynomials are as follows:

lm(x)=(xx0)(xxm1)(xxm+1)(xxN)(xmx0)(xmxm1)(xmxm+1)(xmxN).(10)

For spatial discretization in [1,1], the Chebyshev nodes are usually considered

xm=cos{(lπN)}m=0N.(11)

The first derivative u^x is approximated as

xu^(x)DNu^,

where DN is the first-order differentiation matrix with entries of the form

[DN]n,m={lm(xn)}n,m=1N.

The non-diagonal entries of DN are given as

[DN]n,m=γmγn(xnxm),nm,

where γm1=nmn(xnxm), and the diagonal entries of DN are calculated by

[DN]n,m=m=0,mnn{DN}n,m,n,m{0,1,2,...,N}.

The elements of the DM, DN of order ρ are analytically calculated as

[DNρ]n,m={lmρ(xn)}n,m=1N.

More efficient elaboration of the differentiation matrices can be found in [62]. Welfert [41], obtained an easy to use recursion relation for the calculation of differentiation matrix, as follows:

[DNρ]n,m=ρxnxm{γmγn[DN(ρ1)]nn[DN(ρ1)]nm}, nm.

For the square domain Θ=[1,1]×[1,1], the Chebyshev nodes are xnm, and is presented as

x¯nm={(cos(nπN),cos(mπN))}n,m=1N.

The basic Lagrange polynomials associated to υnm are written as

lnm(x¯)=ln(x)lm(y),(12)

with lnm(x¯nm)=[ϕnm]n,m=0N, and the second-order derivatives are calculated as

xx2lnm(xrs)=ln(xr)lm(ys)=[DN2]rnϕms,yy2lnm(xrs)=ln(xr)lm(ys)=ϕrn[DN2]sm,

where DN2 is a differential matrix of 2nd  order based on collocation nodes. Applying the operator L on Eq. (12) with collocation nodes υrs, we have

L(lnm(xrs))=a1([DN2]rnϕms+ϕrn[DN2]sm)a2([DN]rnϕms+ϕrn[DN]sm).(13)

Finally, the approximation of L by the CSCM is given as

LDiscrete=a1(DN2IN+INDN2)a2(DNIN+INDN).(14)

By using Eq. (14) in Eq. (8), we get

{(B(σ)sσsσ(1σ)+σ)ILDiscrete}u^(x¯,s)=S^(x¯,s).(15)

In order to incorporate the boundary conditions in Eq. (9), we consider LDiscrete, and all collocation nodes x. Moreover, the rows of LDiscrete, are replaced by the corresponding nodes at the boundary with the vectors whose magnitude is one and having unity in a position corresponding to the diagonal of LDiscrete. So, the boundary conditions Bu^(x¯,s)=ζ^(x¯,s) in Eq. (9) will be executed straightaway [42]. After re-organizing all the corresponding columns and rows of LDiscrete, we get the matrix:

LΘ=[HQ0I],

where H is the square matrix of order (NNB)×(NNB),I is square matrix of order (NB×NB), being the number of nodes at the boundary NB. The solution of the system (8) and (9) is reached after solving the system

LΘu^(x¯,s)=[S^(x¯,s)ζ^(x¯,s)],

where the values of interior-boundary points are accumulated via S^(x¯,s) and ζ^(x¯,s) correspondingly. Finally, we will utilize the ILTMs to get the approximate solution of problem (1).

Error Bound of CSCM

As IN:C(Θ)PN, depend on the Chebyshev nodes in Eq. (11) and Lagrange polynomial in Eq. (10) as follows:

IN(u)=m=0Nu(xm)lm(x).(16)

For the calculation of the error bound of CSCM, we utilze the work of Börm et al. [63]. Suppose for all uC[1,1],  ΠN>0, a constant, satisfies the inequality

IN(u)ΠNu.(17)

Furthermore, for all uPN

IN(u)=u.(18)

For interpolation based on Chebyshev points, we have

ΠN=loge(N+1)π2+1(1+N).(19)

The stability constant get larger very sluggishly [63], the approximation bound is given as

uIN(u)2N(N+1)!uN+1  uCN+1,(20)

Theorem 3 [63]. If the polynomial interpolation error bound in (17) and the approximation bound in (20) hold for all uCN+1, with κ{0,1,2,,N}, then

u(κ)IN(u)(κ)2ΠN(κ)+2(1+Nκ)!(12)(1+Nκ)u(N+1),(21)

where ΠN(κ) is given by

ΠN(κ)=ΠNκ!(N!(Nκ)!).

The error bound is formulated by utilizing the results in Eq. (20) and Eq. (21), for 1D case the linear differential operator in Eq. (1) is L=a12x2a2x,

E=(τσuLu)(τσIN(u)LIN(u))=τσ(uIN(u))L(uIN(u))τσ(uIN(u))+L(uIN(u))τσ(uIN(u))+|a1|uυυIN(u)υυ+|a2|uυIN(u)υEτσ(uIN(u))+|a1|2(ΠN(2)+1)(N1)!(12)N1u(1+N)+|a2|2(ΠN(1)+1)N!(12)Nu(1+N),

the time derivatives is computed precisely, so the bound of error of τσ(uIN(u)), have the same order as (uIN(u)). Finally the error bound is given by

Eb3u(N+1),

where b3 can be obtained after the calculation of the coefficients of u(N+1). For 2-D models, interpolation operators based on the tensor product are used to calculate a similar error bound.

3.3 Numerical Inverse Laplace Transform Methods

We utilize the ILTMs for inversion of the solution obtained through CSCM in the Laplace space to time domain. The solution u(x¯,τ) is approximated as follows:

u(x¯,τ)=12πiϑiϑ+iesτu^(x¯,s)ds,=12πi𝒞esτu^(x¯,s)ds, τ>0,(22)

where 𝒞 is an appropriately selected integration contour of the left half complex plane linking ϑi to ϑ+i. The integral presented in Eq. (22) is called the Bromwich integral. Various numerical algorithms are used in the literature to compute the integral in Eq. (22). As exp(sτ) on 𝒞 is a very gradually decaying complex function, the numerical integration of the Eq. (22) is very tough to execute. The contour deformation [57] can be utilized to handle exp(sτ), in such a way that 𝒞:(ϑ+i,ϑi) is deformed to Hankel’s contour that begins and ends in the half plane (to the left) such that Re(s) at both ends, so exp(sτ) depreciates very fast and therefore making the integral in Eq. (22) convenient for the approximation by using the mid-point or the trapezoidal rule. This type of deformation can be established by the Cauchy’s theorem in conformation to the reality that 𝒞 resides in the neighborhood where u^(x¯,s) is analytic. The Talbot approach may fail if the transformed function u^(x¯,s) have some singularities in the imaginary region of the complex plane. The appropriate contour will ensure the accuracy of the ILTMs. Several authors utilized different types of contours for the approximation of Eq. (22), however, we employ the optimal parabolic contour (CP) and hyperbolic contour (CH) presented in [58,60], which are discussed as follows.

3.3.1 Parabolic Contour (CP)

The CP proposed in [58] is given in parametric form as

s=γ(1+iβ)2(23)

For β=ϑ+iν, where ν>0, <ϑ<, CP is of the form

s(ϑ)=γ((ν1)2ϑ2)2iλϑ(ν1),(24)

where γ is an unknown parameter to be determined.

3.3.2 Hyperbolic Contour (CH)

The parametric form of CH proposed in [60] is of the form

s(ϑ)=α+γαsin(ρiϑ), <ϑ<,(25)

with γ0, and α>0, where α satisfies the relations 12π<α<π, and 0<ρ<α12π.

Now, using CP or CH in Eq. (22) we get

u(x¯,τ)=12πies(ϑ)τz^(υ¯,s(ϑ))s(ϑ)dϑ.(26)

and the integral in Eq. (26) can be approximated using the trapezoidal rule, resulting in

uk(x¯,τ)=k2πij=MMes(ϑj)τz^(υ¯,s(ϑj))s(ϑj),whereϑj=jk.(27)

3.4 Error Analysis of LT-CSCM

This section addresses the error analysis of the LT-CSCM. The Laplace transform is applied in the first step, which is inherently free of error. The CSCM is employed in the second step for approximating the solution of the transformed problem. The following theorem establishes the error bounds of the CSCM.

Theorem 4 (Theorem 5, pp. 48, [42]). Let u(x¯,τ) be a given function and for a sequence {υ¯m}N=1 based on a set of interpolation nodes, the sequence xmς, as m, where ς is the density function, with associated potential λ defined by

λ(α)=11ς(u)log|αu|du,

where

λ[1,1]=sup{λ(u)},u[1,1].

For every N, construct PN a polynomial of the degree less than or equal to N which interpolate the u(x¯,τ) at {xm}N=1. If   λu>λ[1,1], where λu is a constant, such that u(x¯,τ) is differentiable at each point within the region defined by

{αC:λ(α)λu},

suppose for k>0 a constant, such that x¯ and N,

|u(x¯,τ)PN|keN(λuλ[1,1]).

The above estimate is valid for any order derivatives (uα(x¯,τ)PNα, where α1) with a new constant which will be still not dependent on N and u.

Finally, we employ the ILTMs in order to approximate the Eq. (27). While approximating Eq. (27) the convergence of the proposed scheme depends on 𝒞, the set of optimal parameters and the domain [τ0,T]. The error analysis of the ILTMs is discussed in the following theorem.

The error of the CP depends on error of trapezoidal-rule on real line. By comparison of Eqs. (26) and (27), let the integral is defined as

I=𝒬(ϑ)dϑ,

the finite approximations are

Ik=kk=𝒬(jk),

and the infinite approximations are

Ik;MP=kj=MPMP𝒬(jk).

The discretization error is given by Derr=|IIk|, and the truncation error is given by Terr=|Ik;MPIk|. The following Theorem will establish the error estimate for CP.

Theorem 5 [58]. Let s=ϑ+iη, ϑ,ηR. Consider 𝒬(s) is analytic in the strip η(d,c), for some d,c>0, with 𝒬(s)0, as |s|. Let onsider positive constants 𝒢+,𝒢, then 𝒬(s) must satisfy

|𝒬(ϑ+ir)|dϑ𝒢+,|𝒬(ϑiq)|dϑ𝒢, 0<r<c, 0<q<d.

Then, we have

Derr=𝒢exp(2πck)1,Derr+=𝒢+exp(2πdk)1.

If c=d,𝒢+=𝒢=𝒢, and 𝒬 is real valued, then we get the following estimate

|IIk|2𝒢exp(2πdk)1.

To get an estimation of Derr, Weideman and Trefethen [58] computed λ, and k by balancing Derr and Terr asymptotically with the parameter’s optimal values. The parameter’s optimal values for CP are

k=1𝒢(8Υ+1),Υ=Tt0,γ={(48Υ+1)T}1(π𝒢).

The estimate of error is

EstimateMP=|u(x¯,τ)uk(x¯,τ)|=O(e(2π𝒢18Υ+1)).(28)

The parameter 𝒢 used in our numerical computations is defined by the relation MP=2𝒢k, where MP corresponds to the quadrature points and k the step of the quadrature rule.

Similarly, the estimation of the discretization error for the hyperbolic contour is presented in the following theorem.

Theorem 6 ([60], Theorem 2). Let u(x¯,τ) be the solution of model (1), and let ξ^ be analytic in the set θγ. Set α=2ϑ,ϑ(0,1], and let 𝒞Srθγ is defined as ψ=ακT, with κ=1sin(ρr). Suppose uk(x¯,τ) be the approximation of Eq. (1) with k=r¯αMHr¯log2. Then, if ϑ0,ν0 and ϑ0+12νϑ, we have, with C=C(ρ,r,θ,ϑ,ϑ0) for 0τT,

uk(x¯,τ)u(x¯,τ)Cα1Tαeγτer¯αMH(u0ϑ+ξ^ϑ0,ν,Σθγ).

In the current work, we use the optimal contour of integration with the parameters given in Eq. (25) are suggested by McLean and Thomèe [60] as

γ=1, ϑ=159010000, r=255110000, α=318010000, ρ=283510000, with τ[0.5,5],

and the error estimate is given as

EstimateCH=|u(x¯,τ)zk(υ¯,τ)|=O(α1Tαeγτer¯αMH).

4  Stability of Method

To analyze the stability of our numerical scheme, we express the system defined in (8) and (9) in its discrete form as follows:

Tu^=b,(29)

where T is a differentiation matrix obtained using the CSCM. The stability constant corresponding to system (29) is given by

Q=supu^0u^Tu^,(30)

The value of Q is finite using any type of discrete norms on RN. Eq (30), we obtain the following inequality

T1u^Tu^Q.(31)

In terms of pseudoinverse T of T, we can write

T=supμ0Tμμ.(32)

Hence, we have the following bound:

Tsupμ=Tu^0TTu^Tu^=supu^0u^Tu^=Q.(33)

Eqs. (31) and (33) establish bounds for the constant Q. Although computing the pseudoinverse directly can be numerically expensive, it provides a theoretical guarantee for the stability of the system. In practice, for square matrices, MATLAB’s condest function can be used to estimate the inverse norm T1. This leads to an estimate of Q as

Qcondest(T)T.(34)

This approach performs well for our differentiation matrix T, requiring only a small amount of computation. The bounds of the stability constant Q for the systems (8) and (9) corresponding to Example 1 and Example 2 are illustrated in Fig. 1a and Fig. 1b, respectively. It can be observed that 1Q1.14, which show the stability constant Q is bounded by numbers not very large, which imply the numerical stability of the CSCM.

images

Figure 1: (a) The plot of the stability constant Q for Example 1, with N=30, MH=80, and σ=0.6 at t=1. (b) The plot of the stability constant Q for Example 2, with N=20, MP=40, and σ=0.5 at t=1

5  Numerical Experiments

We consider three different test examples to validate and check the efficiency of the LT-CSCM. The maximum absolute error norm is computed among the numerical solutions and the analytical solutions. The error norm is defined as

Err=max1jN|u(x¯j,τ)uk(x¯j,τ)|,

where u is the analytical solution and uk is the approximate solution with the proposed method.

Example 1

Consider a 2D TFADE in Eq. (1) with exact solution u(x,y,τ)=τ2+x2+y2. The source term and initial boundary conditions are obtained from the exact solution. For simplicity we choose a1=a2=1, and (x,y,τ)[1,1]2×[0,1]. The numerical outcomes of the maximum absolute error norm via LT-CSCM with the parabolic and hyperbolic ILTMs utilizing the optimal values of the parameters defined in Theorem 5 and Theorem 6 using different numerical values of the parameters σ, N, MP, MH at τ=1 are shown in Table 1 and for σ=0.5, MH=MP=80, N=12 using different values of τ are shown in Table 2. We observe that with just N=12, the error drops to 1013, demonstrating the exponential convergence of the Chebyshev spectral method. In contrast, other methods require more points to achieve comparable accuracy. Moreover, our method using the LT completes the computations in 4 to 22 seconds, while a time-stepping method takes more time due to iterative steps. The results of the proposed method are compared with those of the LT-based local RBF method. The comparison reveals that the proposed method achieves higher accuracy while requiring less number of points and computational time. The approximate solution of the test example 1 computed by LT-CSCM using σ=0.95, N=23, MH=120 at τ=1 is depicted in Fig. 2a. Fig. 2b presents the Err error for the parabolic (CP) and hyperbolic (CH) contours as a function of M, computed using the LT-CSCM with σ=0.60, N=10, and τ=1, where CP achieves high accuracy as compared to CH. Fig. 3a shows Err vs. τ for both contours, with N=10, MP=80, MH=120, and σ=0.60, demonstrating CH’s superior accuracy. Similarly, Fig. 3b illustrates Err vs. the fractional order σ, using N=10, MP=80, MH=120, and τ=1, with CH consistently outperforming CP. Fig. 4a,b display the error plots for varying values of τ. A slight increase in error is observed as τ increases, indicating a minor reduction in accuracy with larger τ. In the hyperbolic contour case, the error escalates with increasing τ for all values of MH. Conversely, in the parabolic contour case, the error exhibits stability for MP<65, with a modest rise observed thereafter.

images

images

images

Figure 2: (a) Numerical solution of test example 1 obtained by the proposed method. (b) Plots of Err vs. M computed by LT-CSCM using the two contours CP(parabolic) and CH(hyperbolic). The CP yields more accurate results than the CH, as evidenced by the reduced error across the range of nodes

images

Figure 3: (a) The Plots shows Err as a function of τ computed by the LT-CSCM using the two contours CP(parabolic) and CH(hyperbolic). The CH yields high accuracy, as evidenced by significantly lower error values across the evaluated time domain. (b) The Plots shows Err as a function of σ computed by LT-CSCM using the two contours CP(parabolic) and CH(hyperbolic). The results indicate that the CH yields more accurate outcomes as compared to the CP, as evidenced by the reduced error across the range of σ values

images

Figure 4: (a) We have plotted the error as a function of MH for τ=[0.5,1,1.5,2], with separate graphs for each case value of τ. This plot indicates a slight reduction in accuracy as τ increases, reflecting the influence of temporal evolution on the method’s performance. (b) We have plotted the error as a function of MP for τ=[0.5,1,1.5,2], with separate graphs for each case value of τ. For 40<MP<65, the error remains relatively stable for all values of τ. However, for MP>65, the plots reveal a slight increase in error as τ increases, indicating a minor reduction in accuracy due to the influence of temporal evolution on the method’s performance

Example 2

Consider a 2D TFADE defined in Eq. (1) with exact solution u(x,y,τ)=τ3+sin(x+y). The source term and initial boundary conditions are obtained from the exact solution. For simplicity we choose a1=a2=1, and (x,y,τ)[1,1]2×[0,1]. The numerical outcomes of the maximum absolute error norm via LT-CSCM with the parabolic and hyperbolic ILTMs utilizing the optimal values of the parameters defined in Theorem 5 and Theorem 6 using different numerical values of the parameters σ, N, MP, MH at τ=1 are shown in Table 3 and for σ=0.5, MH=MP=80, N=12 using different values of τ are shown in Table 4. The approximate solution of the test example 2 computed by LT-CSCM using σ=0.95, N=23, MH=120 at τ=1 is depicted in Fig. 5a. Fig. 5b displays Err error for the parabolic (CP) and hyperbolic (CH) contours as a function of the quadrature node countM, computed using the LT-CSCM with σ=0.60, N=10, and τ=1. The CP contour yields superior accuracy compared to CH. Fig. 6a presents Err vs. τ for both contours, with N=10, MP=80, MH=120, and σ=0.60, where CP demonstrates greater precision. Likewise, Fig. 6b illustrates Err vs. the fractional order σ, using N=10, MP=80, MH=120, and τ=1, with CP consistently outperforming CH. Fig. 7a,b display the error plots for varying values of τ. A slight increase in error is observed as τ increases, indicating a minor reduction in accuracy with larger τ. For the hyperbolic contour, larger τ values lead to a consistent error growth regardless of MH. In contrast, the parabolic contour maintains near-constant error up to MP=70, beyond which a gradual increase is observed.

images

images

images

Figure 5: (a) Numerical solution of test example 2 otained by the proposed method. (b) Plots of Err vs. M computed by LT-CSCM using the two contours CP(parabolic) and CH(hyperbolic). The CP yields more accurate results than the CH, as evidenced by the reduced error across the range of nodes

images

Figure 6: (a) The Plots shows Err as a function of τ computed by the LT-CSCM using the two contours CP(parabolic) and CH(hyperbolic). The CP contour consistently achieves higher accuracy, as demonstrated by substantially lower error values across the evaluated time domain. (b) The Plots shows Err as a function of σ computed by LT-CSCM using the two contours CP(parabolic) and CH(hyperbolic). The results indicate that the CP contour, with significantly reduced errors across the range of σ values, indicating superior accuracy

images

Figure 7: (a) We have plotted the error as a function of MH for τ=[0.5,1,1.5,2], with separate graphs for each case value of τ. This plot indicates a slight reduction in accuracy as τincreases, reflecting the influence of temporal evolution on the method’s performance. (b) We have plotted the error as a function of MP for τ=[0.5,1,1.5,2], with separate graphs for each case value of τ. For 40<MP<70, the error remains relatively stable for all values of τ. However, for MP>70, the plots reveal a slight increase in error as τ increases, indicating a minor reduction in accuracy due to the influence of temporal evolution on the method’s performance

Example 3

Consider a 2D TFADE in Eq. (1) with exact solution u(x,y,τ)=(1+τ3+τ4)cos(π2x)cos(π2y). The source term and initial boundary conditions are obtained from the exact solution. For simplicity we choose a1=a2=1, and (x,y,τ)[1,1]2×[0,1]. The numerical outcomes of the maximum absolute error norm via LT-CSCM with the parabolic and hyperbolic ILTMs utilizing the optimal values of the parameters defined in Theorem 5 and Theorem 6 using different numerical values of the parameters σ, N, MP, MH at τ=1 are shown in Table 5 and for σ=0.5, MH=MP=80, N=12 using different values of τ are shown in Table 6. The approximate solution of the test example 3 computed by LT-CSCM using σ=0.95, N=23, MH=120 at τ=1 is depicted in Fig. 8a. Fig. 8b illustrates the L error (Err) for the parabolic (CP) and hyperbolic (CH) contours as a function ofM, computed using the LT-CSCM with σ=0.60, N=10, and τ=1. The CH contour performs better than CP. Fig. 9a displays Err vs. τ, with N=10, MP=80, MH=120, and σ=0.60, where CP and CH have produced almost similar results. Similarly, Fig. 9b presents Err vs. σ, with N=10, MP=70, MH=60, and τ=1, with CH outperforming CP. Fig. 10a,b display the error plots for varying values of τ. A slight increase in error is observed as τ increases, indicating a minor reduction in accuracy with larger τ. With the hyperbolic contour, the error rises steadily as τ increases for all MH. For the parabolic contour, however, the error remains largely unchanged until MP=80, after which it gradually increases.

images

images

images

Figure 8: (a) Numerical solution of test example 3 obtained by the proposed method. (b) Plots of Err vs. M computed by LT-CSCM using the two contours CP(parabolic) and CH(hyperbolic). The CH yields more accurate results than the CP, as evidenced by the reduced error across the range of node

images

Figure 9: (a) The Plots shows Err as a function of τ computed by the LT-CSCM using the two contours CP(parabolic) and CH(hyperbolic). The curves for both contours overlap closely, indicating comparable accuracy across the evaluated τ range, with negligible differences in error. (b) The Plots shows Err as a function of σ computed by LT-CSCM using the two contours CP(parabolic) and CH(hyperbolic). The results indicate that the CH contour, with significantly reduced errors across the range of σ values, indicating superior accuracy

images

Figure 10: (a) We have plotted the error as a function of MH for τ=[0.5,1,1.5,2], with separate graphs for each case value of τ. This plot indicates a slight reduction in accuracy as τincreases, reflecting the influence of temporal evolution on the method’s performance. (b) We have plotted the error as a function of MP for τ=[0.5,1,1.5,2], with separate graphs for each case value of τ. For 40<MP<80, the error remains relatively stable for all values of τ. However, for MP>80, the plots reveal a slight increase in error as τ increases, indicating a minor reduction in accuracy due to the influence of temporal evolution on the performance of the method

6  Conclusion

In this study, we developed a LT-CSCM to solve time-fractional advection-diffusion equations including the AB derivative with high accuracy and computational efficiency. By integrating the LT with the CSCM, our approach combines the advantages of both approaches: the Laplace transform eliminates time-stepping complexities, ensuring exact temporal discretization, while the CSCM, utilizing Lagrange polynomials-based on Chebyshev nodes, achieves exponential convergence in the spatial domain with minimal nodes. This combination results in low computational cost and high accuracy, as demonstrated by the excellent agreement between our numerical results and exact solutions across various test cases. Despite these advantages, we acknowledge certain limitations. The CSCM’s reliance on global basis functions can pose challenges for problems involving irregular geometries or complex boundary conditions, where local methods might be more adaptable. Furthermore, the global nature of the approach may limit its adaptability to very large-scale problems. To revert solutions from the Laplace domain to the time domain, we employed a numerical inverse Laplace transform, which maintained stability and accuracy throughout. Overall, the LT-CSCM proves to be a robust and efficient tool for time-fractional advection-diffusion problems, with the potential for further refinement to address complex geometries and broader applications. As a future direction, we aim to extend the proposed LT-CSCM framework to solve multi-dimensional time-fractional problems and to compare the performance and accuracy of the method when applied to different types of fractional derivatives, including the modified Atangana-Baleanu derivative. This will enable a deeper understanding of the method’s adaptability and effectiveness across various fractional models and more realistic physical phenomena.

Acknowledgement: The authors extend their appreciation to the Deanship of Research and Graduate Studies at King Khalid University for funding this work through Large Research Project under grant number RGP2/174/46.

Funding Statement: The authors extend their appreciation to the Deanship of Research and Graduate Studies at King Khalid University for funding this work through Large Research Project under grant number RGP2/174/46.

Author Contributions: Kamran: Conceptualization, methodology, validation, investigation, writing—original draft, visualization, supervision, writing—review and editing. Farman Ali Shah: methodology, software, writing—original draft, data curation, writing—review and editing. Kallekh Afef: validation, formal analysis, investigation, writing—review and editing, project administration. J. F. Gómez-Aguilar: investigation, data curation, visualization, writing—review and editing. Salma Aljawi: validation, investigation, formal analysis, resources. Ioan-Lucian Popa: formal analysis, investigation, visualization, funding acquisition. All authors reviewed the results and approved the final version of the manuscript.

Availability of Data and Materials: All the data produced or examined in this study are provided within this article.

Ethics Approval: There does not exist any ethical issue regarding this work.

Conflicts of Interest: The authors declare no conflicts of interest to report regarding the present study.

References

1. Sun H, Zhang Y, Baleanu D, Chen W, Chen Y. A new collection of real world applications of fractional calculus in science and engineering. Commun Nonlinear Sci Numer Simul. 2018;64:213–31. doi:10.1016/j.cnsns.2018.04.019. [Google Scholar] [CrossRef]

2. Podlubny I. Fractional differential equations. San Diego, CA, USA: Academic Press; 1998. [Google Scholar]

3. Abdeljawad T, Baleanu D. Discrete fractional differences with nonsingular discrete Mittag-Leffler kernels. Adv Differ Equ. 2016;2016:1–18. doi:10.1186/s13662-016-0949-5. [Google Scholar] [CrossRef]

4. Jena SR, Sahu I. A novel approach for numerical treatment of traveling wave solution of ion acoustic waves as a fractional nonlinear evolution equation on Shehu transform environment. Phys Scr. 2023;98(8):085231. doi:10.1088/1402-4896/ace6de. [Google Scholar] [CrossRef]

5. Li C, Guo H, Tian X, He T. Generalized thermoelastic diffusion problems with fractional order strain. Eur J Mech-A/Solids. 2019;78:103827. doi:10.1016/j.euromechsol.2019.103827. [Google Scholar] [CrossRef]

6. Kilbas AA, Srivastava HM, Trujillo JJ, Theory and applications of fractional differential equations. Vol. 204. Amsterdam, The Netherland: Elsevier; 2006. [Google Scholar]

7. Caputo M, Fabrizio M. A new definition of fractional derivative without singular kernel. Prog Fract Differ Appl. 2015;1(2):73–85. doi:10.12785/pfda/010201. [Google Scholar] [CrossRef]

8. Atangana A, Baleanu D. New fractional derivatives with nonlocal and non-singular kernel: theory and application to heat transfer model. Therm Sci. 2016;20(2):763. doi:10.2298/TSCI160111018A. [Google Scholar] [CrossRef]

9. Hristov J. On the Atangana-Baleanu derivative and its relation to the fading memory concept: the diffusion equation formulation. Fractional derivatives with mittag-leffler kernel: trends and applications in science and engineering. 1st ed. Cham, Switzerland: Springer; 2019. p. 175–93. doi:10.32604/iasc.2023.032883. [Google Scholar] [CrossRef]

10. Zlatev Z, Berkowicz R, Prahm LP. Implementation of a variable stepsize variable formula method in the time-integration part of a code for treatment of long-range transport of air pollutants. J Comput Phys. 1984;55(2):278–301. doi:10.1016/0021-9991(84)90007-X. [Google Scholar] [CrossRef]

11. Bakunin OG. Turbulence and diffusion: scaling vs. equations. Berlin/Heidelberg, Germany: Springer Science & Business Media; 2008. doi:10.1007/978-3-540-68222-6. [Google Scholar] [CrossRef]

12. Sun L, Qiu H, Wu C, Niu J, Hu BX. A review of applications of fractional advection-dispersion equations for anomalous solute transport in surface and subsurface water. Wiley Interdiscip Rev: Water. 2020;7(4):e1448. doi:10.1002/wat2.1448. [Google Scholar] [CrossRef]

13. Da Silva JRD, Xavier PHF, Moreira DM. Near-field atmospheric dispersion modeling: a new approach for the two-dimensional steady-state advection-diffusion equation using fractal derivative. Pure Appl Geophys. 2025;182(1):223–33. doi:10.1007/s00024-024-03624-8. [Google Scholar] [CrossRef]

14. Budinski L. Solute transport in shallow water flows using the coupled curvilinear Lattice Boltzmann method. J Hydrol. 2019;573:557–67. doi:10.1016/j.jhydrol.2019.03.094. [Google Scholar] [CrossRef]

15. Gupta R, Kumar S. Chebyshev spectral method for the variable-order fractional mobile-immobile advection-dispersion equation arising from solute transport in heterogeneous media. J Eng Math. 2023;142(1):1–28. doi:10.1007/s10665-023-10288-1. [Google Scholar] [CrossRef]

16. Zhang H, Misbah C. Lattice Boltzmann simulation of advection-diffusion of chemicals and applications to blood flow. Comput Fluids. 2019;187:46–59. doi:10.1016/j.compfluid.2019.04.018. [Google Scholar] [CrossRef]

17. Moranda A, Cianci R, Paladino O. Analytical solutions of one-dimensional contaminant transport in soils with source production-decay. Soil Systems. 2018;2(3):40. doi:10.3390/soilsystems2030040. [Google Scholar] [CrossRef]

18. Sanskrityayn A, Kumar N. Analytical solution of advection-diffusion equation in heterogeneous infinite medium using Green’s function method. J Earth Sys Sci. 2016;125:1713–23. doi:10.1007/s12040-016-0756-0. [Google Scholar] [CrossRef]

19. Avci D, Yetim A. Analytical solutions to the advection-diffusion equation with the Atangana-Baleanu derivative over a finite domain. Balikesir Universitesi Fen Bilimleri Enstitusu Dergisi. 2018;20(2):382–95. doi:10.25092/baunfbed.487074. [Google Scholar] [CrossRef]

20. Mirza IA, Vieru D. Fundamental solutions to advection-diffusion equation with time-fractional Caputo-Fabrizio derivative. Comput Math Appl. 2017;73(1):1–10. doi:10.1016/j.camwa.2016.09.026. [Google Scholar] [CrossRef]

21. Umer A, Abbas M, Shafiq M, Abdullah FA, De la Sen M, Abdeljawad T. Numerical solutions of Atangana-Baleanu time-fractional advection diffusion equation via an extended cubic B-spline technique. Alex Eng J. 2023;74:285–300. doi:10.1016/j.aej.2023.05.028. [Google Scholar] [CrossRef]

22. Fazio R, Jannelli A, Agreste S. A finite difference method on non-uniform meshes for time-fractional advection-diffusion equations with a source term. Appl Sci. 2018;8(6):960. doi:10.3390/app8060960. [Google Scholar] [CrossRef]

23. Ahmed S, Jahan S, Nisar KS. Haar wavelet based numerical technique for the solutions of fractional advection diffusion equations. J Math Comput Sci. 2024;34(3):217–33. doi:10.22436/jmcs.034.03.02. [Google Scholar] [CrossRef]

24. Kamran, Shah FA, Aly WHF, Aksoy H, Alotaibi FM, Mahariq I. Numerical inverse laplace transform methods for advection-diffusion problems. Symmetry. 2022;14(12):2544. doi:10.3390/sym14122544. [Google Scholar] [CrossRef]

25. Pareek N, Gupta A, Agarwal G, Suthar DL. Natural transform along with HPM technique for solving fractional ADE. Adv Math Phys. 2021;2021(1):9915183. doi:10.1155/2021/9915183. [Google Scholar] [CrossRef]

26. Chawla MM, Al-Zanaidi MA, Al-Aslab M. Extended one-step time-integration schemes for convection-diffusion equations. Comput Math Appl. 2000;39(3–4):71–84. doi:10.1016/S0898-1221(99)00334-X. [Google Scholar] [CrossRef]

27. Liu J, Li X, Hu X. A RBF-based differential quadrature method for solving two-dimensional variable-order time fractional advection-diffusion equation. J Comput Phys. 2019;384:222–38. doi:10.1016/j.jcp.2018.12.043. [Google Scholar] [CrossRef]

28. Nguyen H, Reynen J. A space-time least-square finite element scheme for advection-diffusion equations. Comput Methods Appl Mech Eng. 1984;42(3):331–42. doi:10.1016/0045-7825(84)90012-4. [Google Scholar] [CrossRef]

29. Cunha CLN, Carrer JAM, Oliveira MF, Costa VL. A study concerning the solution ofadvection-diffusion problems by the Boundary Element Method. Eng Anal Bound Elem. 2016;100(65):79–94. doi:10.1016/j.enganabound.2016.01.002. [Google Scholar] [CrossRef]

30. Sweilam NH, El-Sayed AAE, Boulaaras S. Fractional-order advection-dispersion problem solution via the spectral collocation method and the non-standard finite difference technique. Chaos Solitons Fractals. 2021;144:110736. doi:10.1016/j.chaos.2021.110736. [Google Scholar] [CrossRef]

31. Yin F, Song J, Lu F. A coupled method of Laplace transform and Legendre wavelets for nonlinear Klein-Gordon equations. Math Methods Appl Sci. 2014;37(6):781–92. doi:10.1002/mma.2834. [Google Scholar] [CrossRef]

32. Soares D Jr, Mansur WJ. An efficient time-domain BEM/FEM coupling for acoustic-elastodynamic interaction problems. Comput Model Eng Sci. 2005;8(2):153–64. doi:10.3970/cmes.2005.008.153. [Google Scholar] [CrossRef]

33. Yin F, Song J, Lu F, Leng H. A coupled method of Laplace transform and Legendre wavelets for Lane-Emden-type differential equations. J Appl Math. 2012;2012(1):163821. doi:10.1155/2012/163821. [Google Scholar] [CrossRef]

34. Khan Y, Faraz N, Kumar S, Yildirim A. A coupling method of homotopy perturbation and Laplace transformation for fractional models. Univ Politehnica Bucharest Scientific Bulletin Series A Appl Math Phy. 2012;74(1):57–68. [Google Scholar]

35. Joujehi AS, Derakhshan MH, Marasi HR. An efficient hybrid numerical method for multi-term time fractional partial differential equations in fluid mechanics with convergence and error analysis. Commun Nonlinear Sci Numer Simul. 2022;114:106620. doi:10.1016/j.cnsns.2022.106620. [Google Scholar] [CrossRef]

36. Hafez RM, Youssri YH. Review on Jacobi-Galerkin spectral method for linear PDEs in applied mathematics. Contemp Math. 2024;5(2):2051–88. doi:10.37256/cm.5220244768. [Google Scholar] [CrossRef]

37. Lim KM, Li H. A coupled boundary element/finite difference method for fluid-structure interaction with application to dynamic analysis of outer hair cells. Comput Struct. 2007;85(11–14):911–22. doi:10.1016/j.compstruc.2007.01.003. [Google Scholar] [CrossRef]

38. Kamran, Khan S, Alhazmi SE, Alotaibi FM, Ferrara M, Ahmadian A. On the numerical approximation of mobile-immobile advection-dispersion model of fractional order arising from solute transport in porous media. Fractal Fract. 2022;6(8):445. doi:10.3390/fractalfract6080445. [Google Scholar] [CrossRef]

39. Sahu I, Jena SR. An efficient technique for time fractional Klein-Gordon equation based on modified Laplace Adomian decomposition technique via hybridized Newton-Raphson Scheme arises in relativistic fractional quantum mechanics. Partial Differ Equ Appl Math. 2024;10:100744. doi:10.1016/j.padiff.2024.100744. [Google Scholar] [CrossRef]

40. Boyd JP. Chebyshev and fourier spectral methods. 2nd ed. North Chelmsford, MA, USA: Courier Corporation; 2001. [Google Scholar]

41. Welfert BD. Generation of pseudospectral differentiation matrices I. SIAM J Numer Anal. 1997;34(4):1640–57. doi:10.1137/S0036142993295545. [Google Scholar] [CrossRef]

42. Trefethen LN. Spectral methods in MATLAB (Software, Environments, and Tools). Philadelphia, PA, USA: SIAM; 2000. [Google Scholar]

43. Bueno-Orovio A, Perez-Garcia VM, Fenton FH. Spectral methods for partial differential equations in irregular domains: the spectral smoothed boundary method. SIAM J Sci Comput. 2006;28(3):886–900. doi:10.1137/040607575. [Google Scholar] [CrossRef]

44. Khader MM, Saad KM. A numerical approach forsolving the fractional Fisher equation using Chebyshev spectral collocation method. Chaos Solitons Fractals. 2018;110:169–77. doi:10.1016/j.chaos.2018.03.018. [Google Scholar] [CrossRef]

45. Bayrak MA, Demir A, Ozbilge E. Numerical solution of fractional diffusion equation by Chebyshev collocation method and residual power series method. Alex Eng J. 2020;59:4709–17. doi:10.1016/j.aej.2020.08.033. [Google Scholar] [CrossRef]

46. Shokri A, Mirzaei S. A pseudo-spectral based method for time-fractional advection-diffusion equation. Comput Methods Differ Equ. 2020;8:454–67. doi:10.22034/cmde.2020.29307.1414. [Google Scholar] [PubMed] [CrossRef]

47. Tohidi E. Application of Chebyshev collocation method for solving two classes of non-classical parabolic PDEs. Ain Shams Eng J. 2015;6(1):373–9. doi:10.1016/j.asej.2014.10.021. [Google Scholar] [CrossRef]

48. Khater AH, Temsah RS, Hassan M. A Chebyshev spectral collocation method for solving Burger’s-type equations. J Comput Appl Math. 2008;222(2):333–50. doi:10.1016/j.cam.2007.11.007. [Google Scholar] [CrossRef]

49. Li Z, Chen X, Qiu J, Xia T. A novel Chebyshev-collocation spectral method for solving the transport equation. J Ind Manag Optim. 2021;17(5):2519–26. doi:10.3934/jimo.2020080. [Google Scholar] [CrossRef]

50. Rongpei Z, Mingjun L, Xijun Y. An efficient Chebyshev spectral collocation method for the solution of reaction diffusion systems. J Numer Methods Comput Appl. 2017;38(4):271–81. doi:10.12288/szjs.2017.4.271. [Google Scholar] [CrossRef]

51. Fu ZJ, Chen W, Yang HT. Boundary particle method for Laplace transformed time fractional diffusion equations. J Comput Phys. 2013;235:52–66. doi:10.1016/j.jcp.2012.10.018. [Google Scholar] [CrossRef]

52. Diethelm K. The analysis of fractional differential equations: an application-oriented exposition using differential operators of caputo type. Berlin, Germany: Springer; 2010. [Google Scholar]

53. Mainardi F. Fractional calculus and waves in linear viscoelasticity: an introduction to mathematical models. Singapore: World Scientific; 2010. [Google Scholar]

54. Gorenflo R, Mainardi F, Moretti D, Pagnini G, Paradisi P. Discrete random walk models for space-time fractional diffusion. Chem Phys. 2002;284(1–2):521–41. doi:10.1016/S0301-0104(02)00714-0. [Google Scholar] [CrossRef]

55. De Hoog FR, Knight JH, Stokes AN. An improved method for numerical inversion of Laplace transforms. SIAM J Sci Stat Comput. 1982;3(3):357–66. doi:10.1137/0903022. [Google Scholar] [CrossRef]

56. Stehfest H. Algorithm 368: numerical inversion of Laplace transforms [D5]. Commun ACM. 1970;13(1):47–9. doi:10.1145/361953.361969. [Google Scholar] [CrossRef]

57. Talbot A. The accurate numerical inversion of Laplace transforms. IMA J Applied Math. 1979;23(1):97–120. doi:10.1093/imamat/23.1.97. [Google Scholar] [CrossRef]

58. Weideman J, Trefethen L. Parabolic and hyperbolic contours for computing the Bromwich integral. Math Comput. 2007;76(259):1341–56. doi:10.1090/S0025-5718-07-01945-X. [Google Scholar] [PubMed] [CrossRef]

59. Weeks WT. Numerical inversion of Laplace transforms using Laguerre functions. J ACM (JACM). 1966;13(3):419–29. doi:10.1145/321341.321351. [Google Scholar] [CrossRef]

60. McLean W, Thomèe V. Numerical solution via Laplace transforms of a fractional order evolution equation. J Integral Equ Appl. 2010:57–94. doi:10.1216/JIE-2010-22-1-57. [Google Scholar] [PubMed] [CrossRef]

61. Verma P, Kumar M. New existence, uniqueness results for multi-dimensional multi-term Caputo time-fractional mixed sub-diffusion and diffusion-wave equation on convex domains. J Appl Analysis Comput. 2021;11:1455–80. doi:10.11948/20200217. [Google Scholar] [CrossRef]

62. Baltensperger R, Trummer MR. Spectral differencing with a twist. SIAM J Sci Comput. 2003;24(5):1465–87. doi:10.1137/S1064827501388182. [Google Scholar] [CrossRef]

63. Börm S, Grasedyck L, Hackbusch W. Introduction to hierarchical matrices with applications. Eng Anal Bound Elem. 2003;27(5):405–22. doi:10.1016/S0955-7997(02)00152-2. [Google Scholar] [CrossRef]

64. Kamran, Ahmadian A, Salahshour S, Salimi M. A robust numerical approximation of advection diffusion equations with nonsingular kernel derivative. Phys Scr. 2021;96(12):124015. doi:10.1088/1402-4896/ac1ccf. [Google Scholar] [CrossRef]


Cite This Article

APA Style
Kamran, , Shah, F.A., Afef, K., Gómez-Aguilar, J.F., Aljawi, S. et al. (2025). Analysis of a Laplace Spectral Method for Time-Fractional Advection-Diffusion Equations Incorporating the Atangana-Baleanu Derivative. Computer Modeling in Engineering & Sciences, 143(3), 3433–3462. https://doi.org/10.32604/cmes.2025.064815
Vancouver Style
Kamran , Shah FA, Afef K, Gómez-Aguilar JF, Aljawi S, Popa I. Analysis of a Laplace Spectral Method for Time-Fractional Advection-Diffusion Equations Incorporating the Atangana-Baleanu Derivative. Comput Model Eng Sci. 2025;143(3):3433–3462. https://doi.org/10.32604/cmes.2025.064815
IEEE Style
Kamran, F. A. Shah, K. Afef, J.F. Gómez-Aguilar, S. Aljawi, and I. Popa, “Analysis of a Laplace Spectral Method for Time-Fractional Advection-Diffusion Equations Incorporating the Atangana-Baleanu Derivative,” Comput. Model. Eng. Sci., vol. 143, no. 3, pp. 3433–3462, 2025. https://doi.org/10.32604/cmes.2025.064815


cc Copyright © 2025 The Author(s). Published by Tech Science Press.
This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
  • 731

    View

  • 331

    Download

  • 0

    Like

Share Link