Preprint
Article

This version is not peer-reviewed.

Numerical Simulation of Time-Fractional Nonlinear Schrödinger Equation and Time-Fractional Schrödinger–Poisson System

Submitted:

15 September 2026

Posted:

16 September 2026

You are already at the latest version

Abstract
This paper presents an efficient localized meshless method for solving the nonlinear time-fractional Schrödinger equation and the time-fractional Schrödinger–Poisson system. The proposed approach consists of two main steps. First, the Caputo time-fractional derivative is approximated using the L1 formula, which has an accuracy of order O(δt2−β) for 0 < β < 1. The spatial derivatives in the coupled equations are then discretized using a localized radial basis function Hermite finite-difference (LRBF-HFD) method. In this approach, the Laplacian operator is approximated on small overlapping neighborhoods, thereby avoiding the large and ill-conditioned systems arising from global RBF methods. Numerical experiments are presented to confirm the accuracy and reliability of the proposed method.
Keywords: 
;  ;  ;  ;  ;  

1. Introduction

Many natural phenomena show complex and nonlinear behavior that cannot be described accurately by classical integer-order models. Fractional calculus (FC) provides a flexible mathematical tool for studying such processes and gives a more realistic description of their behavior. For this reason, fractional models have attracted considerable interest in science and engineering during recent decades. In particular, fractional partial differential equations (FPDEs) are useful for describing systems with memory and nonlocal effects [1,2,3]. These equations have been applied to many problems in elasticity, blood flow, solid mechanics, optical fibers, signal processing, thermal radiation, fluid dynamics, medical science, and diffusion processes. Because of their nonlinear structure, exact solutions of these equations are generally difficult or impossible to obtain. Analytical solutions are available only in a limited number of special cases. Therefore, developing accurate and efficient numerical methods for NPDEs is of considerable practical importance [4]. In this paper, we focus on two important models: the nonlinear time-fractional Schrödinger equation and the time-fractional Schrödinger–Poisson system.

1.1. The Time-Fractional Nonlinear Schrödinger Equation

First, we consider the following time-fractional nonlinear Schrödinger equation:
i 0 C D t β u ( x , t ) + α Δ u ( x , t ) + V ( x ) u ( x , t ) + λ u ( x , t ) 2 u ( x , t ) = f ( x , t ) , x ∈ Ω , 0 < t ≤ T , 0 < β < 1 .
Equation (1) is supplemented with the boundary condition (BC)
u ( x , t ) = h ( x , t ) , x ∈ ∂ Ω , 0 ≤ t ≤ T ,
and the initial condition (IC)
u ( x , 0 ) = ψ ( x ) , x ∈ Ω ¯ ,
where Ω ⊂ R 2 be a bounded computational domain, x = ( x , y ) ∈ Ω , and 0 < t ≤ T . u : Ω × [ 0 , T ] → C is the complex-valued wave function, i = − 1 , α is the dispersion coefficient, V ( x ) is the external potential, λ is the nonlinear interaction coefficient, and f ( x , t ) denotes the source function. The Caputo fractional derivative of order β is defined as
D t β 0 C ψ ( x , t ) = 1 Γ ( 1 − β ) ∫ 0 t ∂ ψ ( x , s ) / ∂ s ( t − s ) β d s , 0 < β < 1 .
The fractional nonlinear Schrödinger equation is a nonlocal dispersive model introduced by Laskin through a generalization of Feynman’s path-integral formulation to Lévy-type trajectories [5,6]. It was later derived as the continuum limit of discrete lattice systems with long-range interactions [7]. Its nonlocal structure makes it possible to describe physical phenomena that are not captured by the classical Schrödinger equation [8,9,10,11]. Nevertheless, this nonlocality also creates considerable analytical and computational difficulties. In a different direction, time-fractional Schrödinger equations replace the classical first-order time derivative with a fractional derivative to model memory and hereditary effects.
Numerous numerical techniques have been proposed for the numerical approximation of the nonlinear time-fractional Schrödinger equation. Mohebbi et al. [12] proposed a meshless collocation method based on radial basis function (RBF). Ding and Wong [13] employed a quintic non-polynomial spline approximation to construct a high-order numerical scheme for the same class of equations. Zhang et al. [14] developed an efficient approach based on a fast approximation of the Caputo derivative for problems posed on unbounded domains. Wang et al. [15] presented two linear second-order schemes for the multidimensional nonlinear model and analyzed their stability and convergence properties. Hu et al. [16] proposed a two-grid finite element (FE) method on graded temporal meshes to handle possible initial singularities. Wang et al. [17] developed a time two-grid fitted scheme for nonsmooth solutions, reducing the computational cost while maintaining high accuracy. Huang et al. [18] introduced a meshless collocation approach for the multidimensional problem, combined with L1-type approximations of the Caputo derivative. Wang et al. [19] proposed a modified L1–Crank–Nicolson FE method and established unconditional convergence of the resulting scheme. Ma et al. [20] constructed an efficient numerical method for the two-dimensional nonlinear case and investigated its accuracy and convergence behavior. Qian et al. [21] combined an L1–Crank–Nicolson discretization on graded meshes with the virtual element method for the nonlinear fractional model. Wei et al. [22] developed an implicit fully discrete local discontinuous Galerkin method for the linear time-fractional Schrödinger equation and studied its stability and convergence. Zhang et al. [23] considered a two-dimensional formulation using temporal fractional discretization together with spectral Galerkin techniques. Serik et al. [24] proposed a high-order finite difference method combining an accurate temporal approximation with a compact spatial discretization.

1.2. The Time-Fractional Schrödinger–Poisson System

Second, we study the following nonlinear time-fractional Schrödinger–Poisson system:
i 0 C D t β ψ ( x , t ) + a Δ ψ ( x , t ) + λ ψ ( x , t ) 2 ψ ( x , t ) = α Φ ( x , t ) ψ ( x , t ) + f ( x , t ) , − Δ Φ ( x , t ) = c D ψ ( x , t ) 2 + g ( x , t ) , x ∈ Ω , 0 < t ≤ T .
The system is supplemented with the Dirichlet BCs
ψ ( x , t ) = h ψ ( x , t ) , Φ ( x , t ) = h Φ ( x , t ) , x ∈ ∂ Ω , 0 < t ≤ T ,
and the IC
ψ ( x , 0 ) = ψ 0 ( x ) , x ∈ Ω ¯ .
where 0 < β < 1 , ψ : Ω × [ 0 , T ] → C denotes the complex-valued wave function, Φ : Ω × [ 0 , T ] → R represents the electrostatic potential, i = − 1 , and Δ = ∇ 2 denotes the Laplace operator in d spatial dimensions, where d = 1 , 2 , 3 . The coupling constant c D may, in general, take an arbitrary value. In the present study, it is set to c D = 2 π for the two-dimensional problem and c D = 4 π for the three-dimensional problem [?]. The nonlinear coefficient λ is assumed to take one of the values − 1 , 0, or 1. In nonlinear optics, λ ≠ 0 represents the strength and type of the Kerr nonlinearity. In particular, λ = 1 corresponds to an attractive local interaction, whereas λ = − 1 describes a repulsive local interaction. The case λ = 0 represents the absence of the local cubic nonlinear interaction. Moreover, β is the fractional order, a > 0 is the dispersion coefficient, and λ , α , and c D are given real parameters.
The nonlinear Schrödinger equation is an important mathematical model for wave propagation in quantum mechanics, nonlinear optics, and condensed-matter physics. Its nonlinear term describes the local self-interaction of the wave field. In many physical systems, however, the interaction is generated by a field that depends on the spatial distribution of the wave function. This leads to nonlocal models such as the Schrödinger–Poisson system, in which a nonlinear Schrödinger equation is coupled with an elliptic Poisson equation through the wave density | ψ | 2 [25,26]. Related self-consistent field models can also be obtained from mean-field approximations of many-particle quantum systems with long-range Coulomb or gravitational interactions. The Poisson equation determines a self-consistent potential generated by the wave density, and this potential, in turn, affects the evolution of the wave function. Depending on the underlying physical problem, related forms of this model are known as the Schrödinger–Newton equation or the Gross–Pitaevskii–Newton equation. Schrödinger–Poisson systems arise in the study of self-gravitating quantum particles, Bose–Einstein condensates, semiconductor devices, plasma dynamics, nonlinear optics, and scalar-field dark matter [25,27,28,29,30,31]. In the classical Schrödinger–Poisson system, the time evolution of the wave function is governed by a first-order derivative. Such a model may not fully describe processes involving memory, anomalous relaxation, or hereditary behavior. A time-fractional extension can be obtained by replacing the classical time derivative with a fractional derivative. In particular, the Caputo derivative accounts for the previous history of the solution and permits the use of initial conditions in the usual classical form. The resulting time-fractional Schrödinger–Poisson system therefore combines temporal memory, cubic nonlinearity, and a nonlocal self-consistent potential. Gu et al. [32] investigated the existence and multiplicity of solutions for a fractional Schrödinger–Poisson system involving a spatial fractional operator rather than a time-fractional derivative. Zhang et al. [33] developed a time-splitting Fourier spectral method for a space-fractional Schrödinger–Poisson model, providing an efficient spectral treatment of the spatial fractional operator.
In this paper, we employ an efficient localized meshless method for solving nonlinear time-fractional Schrödinger equations and Schrödinger–Poisson systems. The Caputo time-fractional derivative is approximated by the L1 formula, whose consistency order is O ( δ t 2 − β ) for 0 < β < 1 . The spatial derivatives are discretized using the localized radial basis function Hermite finite-difference (LRBF-HFD) method. The Laplacian operator is approximated over small overlapping neighborhoods, which avoids the large and ill-conditioned systems associated with global RBF methods. Finally, several numerical examples confirm the accuracy and reliability of the proposed method.
The outline of this paper is as follows. Section 2 develops the time-semi discrete schemes using the L1 formula for the nonlinear time-fractional Schrödinger equation and the Schrödinger–Poisson system. Section 3 presents the LRBF-HFD method for the spatial discretization. Section 4 reports the numerical results. Finally, Section 5 presents the main conclusions and final remarks.

2. Time Discretization

This section uses the L1 formula to approximate the time-fractional derivative. The time interval [ 0 , T ] is divided into N equal subintervals, with temporal nodes t n = n δ t , where δ t = T / N t and n = 0 , 1 , … , N t . For convenience, the notation u n ( x ) = u ( x , t n ) is used. Applying the L1 formula at t = t n leads to a semi-discrete formulation of the problem.
u n ( x ) = u ( x , t n ) , f n ( x ) = f ( x , t n ) , h n ( x ) = h ( x , t n ) .
We first recall the following result for the L1 approximation of the Caputo time-fractional derivative.
Lemma 1. (See [34].) Suppose that 0 < β < 1 and g ∈ C 2 [ 0 , t n ] . Then,
| 1 Γ ( 1 − β ) ∫ 0 t n g ′ ( s ) ( t n − s ) β d s − δ t − β Γ ( 2 − β ) b 0 g ( t n ) − ∑ k = 1 n − 1 b n − k − 1 − b n − k g ( t k ) − b n − 1 g ( t 0 ) | ≤ 1 Γ ( 2 − β ) 1 − β 12 + 2 2 − β 2 − β − 1 + 2 − β max 0 ≤ s ≤ t n | g ′ ′ ( s ) | δ t 2 − β ,
where b k = ( k + 1 ) 1 − β − k 1 − β , k = 0 , 1 , 2 , … .

2.1. Temporal Discretization of the Time-Fractional Schrödinger Equation

For 0 < β < 1 , applying Lemma 1 to ψ ( x , t ) at t = t n , the Caputo fractional derivative can be approximated by the L1 formula as follows:
D t β 0 C u n ( x ) = δ t − β Γ ( 2 − β ) b 0 u n ( x ) − ∑ k = 1 n − 1 b n − k − 1 − b n − k u k ( x ) − b n − 1 u 0 ( x ) + O δ t 2 − β .
Since b 0 = 1 , introducing
μ β = δ t − β Γ ( 2 − β )
allows Eq. (9) to be written as
D t β 0 C u n ( x ) = μ β u n ( x ) − ∑ k = 1 n − 1 b n − k − 1 − b n − k u k ( x ) − b n − 1 u 0 ( x ) + O δ t 2 − β .
To obtain a linear problem at each time level, the nonlinear term is treated explicitly. Assuming that u is continuously differentiable with respect to time, we have
u n ( x ) = u n − 1 ( x ) + O ( δ t ) .
Consequently,
u n ( x ) 2 u n ( x ) = u n − 1 ( x ) 2 u n − 1 ( x ) + O ( δ t ) .
Substituting Eqs. (11) and (13) into Eq. (1), and neglecting the truncation-error terms, gives the following time-semidiscrete formulation.
At the first time level, n = 1 , the history sum is empty. Using u 0 ( x ) = ψ ( x ) , we obtain
i μ β u 1 ( x ) + α Δ u 1 ( x ) + V ( x ) u 1 ( x ) + λ ψ ( x ) 2 ψ ( x ) = f 1 ( x ) + i μ β ψ ( x ) , x ∈ Ω .
For 2 ≤ n ≤ N , the time-semidiscrete problem becomes
i μ β u n ( x ) + α Δ u n ( x ) + V ( x ) u n ( x ) + λ u n − 1 ( x ) 2 u n − 1 ( x ) = f n ( x ) + i μ β ∑ k = 1 n − 1 b n − k − 1 − b n − k u k ( x ) + i μ β b n − 1 ψ ( x ) , x ∈ Ω .
At every time level, Eq. (15) is supplemented with the discrete BC
u n ( x ) = h n ( x ) , x ∈ ∂ Ω , n = 1 , 2 , … , N ,
and the IC
u 0 ( x ) = ψ ( x ) , x ∈ Ω ¯ .

2.2. Temporal Discretization of the Time-Fractional Schrödinger–Poisson System

In what follows, we derive the time-discrete formulation of the time-fractional Schrödinger–Poisson system. For convenience, we introduce the notation
ψ n ( x ) = ψ ( x , t n ) , Φ n ( x ) = Φ ( x , t n ) ,
together with
f n ( x ) = f ( x , t n ) , g n ( x ) = g ( x , t n ) .
By applying Lemma 1 to ψ ( x , t ) at t = t n , we obtain
D t β 0 C ψ n ( x ) = δ t − β Γ ( 2 − β ) b 0 ψ n ( x ) − ∑ k = 1 n − 1 b n − k − 1 − b n − k ψ k ( x ) − b n − 1 ψ 0 ( x ) + O δ t 2 − β ,
where b k = ( k + 1 ) 1 − β − k 1 − β , k = 0 , 1 , 2 , … . Since b 0 = 1 , we define μ β = δ t − β Γ ( 2 − β ) . Consequently, Eq. (18) can be written as
D t β 0 C ψ n ( x ) = μ β ψ n ( x ) − ∑ k = 1 n − 1 b n − k − 1 − b n − k ψ k ( x ) − b n − 1 ψ 0 ( x ) + O δ t 2 − β .
To obtain a linear problem at each time level, the nonlinear terms are treated explicitly. Assuming sufficient temporal regularity of ψ , we have
ψ n ( x ) = ψ n − 1 ( x ) + O ( δ t ) .
Therefore,
ψ n ( x ) 2 ψ n ( x ) = ψ n − 1 ( x ) 2 ψ n − 1 ( x ) + O ( δ t ) ,
and
ψ n ( x ) 2 = ψ n − 1 ( x ) 2 + O ( δ t ) .
At each time level, the electrostatic potential is first obtained by solving the Poisson equation
− Δ Φ n ( x ) = c D ψ n − 1 ( x ) 2 + g n ( x ) , x ∈ Ω .
Once Φ n is known, the Schrödinger equation is solved for ψ n . At the first time level, n = 1 , the history sum is empty. Using ψ 0 ( x ) = ψ 0 ( x ) , we obtain
− Δ Φ 1 ( x ) = c D ψ 0 ( x ) 2 + g 1 ( x ) , x ∈ Ω ,
followed by
i μ β ψ 1 ( x ) + a Δ ψ 1 ( x ) + λ ψ 0 ( x ) 2 ψ 0 ( x ) = α Φ 1 ( x ) ψ 1 ( x ) + f 1 ( x ) + i μ β ψ 0 ( x ) , x ∈ Ω .
For 2 ≤ n ≤ N , the potential Φ n is first determined from
− Δ Φ n ( x ) = c D ψ n − 1 ( x ) 2 + g n ( x ) , x ∈ Ω .
The wave function at the new time level is then computed from
i μ β ψ n ( x ) + a Δ ψ n ( x ) + λ ψ n − 1 ( x ) 2 ψ n − 1 ( x ) = α Φ n ( x ) ψ n ( x ) + f n ( x ) + i μ β ∑ k = 1 n − 1 b n − k − 1 − b n − k ψ k ( x ) + i μ β b n − 1 ψ 0 ( x ) , x ∈ Ω .
Equivalently, collecting the unknown terms on the left-hand side gives
i μ β − α Φ n ( x ) ψ n ( x ) + a Δ ψ n ( x ) = f n ( x ) − λ ψ n − 1 ( x ) 2 ψ n − 1 ( x ) + i μ β ∑ k = 1 n − 1 b n − k − 1 − b n − k ψ k ( x ) + i μ β b n − 1 ψ 0 ( x ) , 2 ≤ n ≤ N .

3. Spatial Discretization by the LRBF-HFD Method

This section first provides a concise overview of the radial basis function–based Hermite interpolation method and then uses this approach to derive the LRBF–HFD formulation [35,36,37]. Let Ω ⊂ R 2 denote a bounded computational domain with boundary ∂ Ω , and let u ( x ) be defined on Ω ¯ . The domain is discretized by a set of M scattered nodes, denoted by { x i } i = 1 M . For each center x j , let Ω j = x 1 ( j ) , … , x m ( j ) ⊂ Ω denote a local stencil consisting of x j and its m − 1 nearest neighbors. The stencil size m may be fixed for all centers or allowed to vary with j. Assume that the values of u are known at the nodes in Ω j , whereas the values of L u are prescribed at a selected subset of these nodes, that is, Ω ˜ j = x ˜ 1 ( j ) , … , x ˜ l ( j ) ⊂ Ω .  Figure 1 shows how a local stencil is formed around the central node x 0 in an irregular domain. The nearby support nodes are chosen within the distance d max , while the other interior and boundary nodes remain outside the local region.
For notational simplicity, the superscripts introduced above will be omitted hereafter. The local RBF–Hermite interpolant of u ( x ) is then written as follows:
u ˜ ( x ) = ∑ i = 1 m λ i φ x − x i + ∑ i = 1 l ϑ i L 2 φ x − x ˜ i + ∑ i = 1 s ν i p i ( x ) .
The interpolation coefficients { λ p } p = 1 m , { ϑ ℓ } ℓ = 1 l , and { ν j } j = 1 s are determined by imposing the following conditions:
u ˜ ( x p ) = u ( x p ) , p = 1 , 2 , … , m , L u ˜ ( x ˜ ℓ ) = L u ( x ˜ ℓ ) , ℓ = 1 , 2 , … , l , ∑ p = 1 m λ p p j ( x p ) = 0 , j = 1 , 2 , … , s .
The preceding relations can be assembled into the following symmetric linear system:
A Λ = U .
Here,
A = Υ Ψ 2 P Ψ 1 Ψ 12 0 P T 0 0 , Λ = λ ϑ ν , U = u L u 0 .
The entries of the block matrices are defined by
Υ p , q = φ x p − x q , p , q = 1 , 2 , … , m , P p , j = p j ( x p ) , p = 1 , 2 , … , m , j = 1 , 2 , … , s , ( Ψ 2 ) p , ℓ = L 2 φ x p − x ˜ ℓ , p = 1 , 2 , … , m , ℓ = 1 , 2 , … , n h , ( Ψ 1 ) ℓ , q = L 1 φ x ˜ ℓ − x q , ℓ = 1 , 2 , … , n h , q = 1 , 2 , … , m , ( Ψ 12 ) ℓ , h = L 1 L 2 φ x ˜ ℓ − x ˜ h , ℓ , h = 1 , 2 , … , n h .
Moreover,
λ = [ λ 1 , λ 2 , … , λ m ] T , ν = [ ν 1 , ν 2 , … , ν s ] T ,
u = [ u ( x 1 ) , u ( x 2 ) , … , u ( x m ) ] T , ϑ = [ ϑ 1 , ϑ 2 , … , ϑ n h ] T ,
and
L u = L u ( x ˜ 1 ) , L u ( x ˜ 2 ) , … , L u ( x ˜ n h ) T ,
where the subscripts in L 1 and L 2 indicate the argument of the radial kernel with respect to which the differential operator acts. More precisely, L 1 acts on the first spatial argument, whereas L 2 acts on the second. Under the usual unisolvency assumptions, the block system in (27) admits a unique solution whenever the selected radial basis function is positive definite or conditionally positive definite and is supplemented by a polynomial space of the required degree [38,39]. To approximate the action of a linear differential operator L at the stencil center x j within the LRBF–HFD approach, we first apply L to both sides of Equation (26) and evaluate the resulting expression at x j , yielding
L u ( x j ) = ∑ i = 1 m λ i L φ x j − x i + ∑ i = 1 l ϑ i L L 2 φ x j − x ˜ i + ∑ k = 1 s ν k L p k ( x j ) = [ L φ x j − x 1 , … , L φ x j − x m , L L 2 φ x j − x ˜ 1 , … , L L 2 φ x j − x ˜ l , L p 1 ( x j ) , … , L p s ( x j ) ] Λ = ψ A − 1 U : = ∑ k = 1 m w k u ( x k ) + ∑ k = 1 l w ˜ k L u ( x ˜ k ) .
where
ψ = [ L φ x j − x 1 , … , L φ x j − x m , L L 2 φ x j − x ˜ 1 , … , L L 2 φ x j − x ˜ l , L p 1 ( x j ) , … , L p s ( x j ) ] .
The unknown weights w k , k = 1 , 2 , … , m , and w ˜ k , k = 1 , 2 , … , l , are obtained by solving the following linear system and retaining only the components corresponding to these weights, while discarding the auxiliary coefficients ν 1 , … , ν s :
A T U w ˜ ν = ψ T .

3.1. Spatial Discretization by the LRBF–HFD Method

Let X = x 1 , x 2 , … , x N s ⊂ Ω ¯ be the set of spatial nodes, where N s denotes the total number of interior and boundary nodes. For every interior node x j , we define the local stencil Ω j = x j 1 , x j 2 , … , x j m j , together with the Hermite derivative nodes Ω ˜ j = x ˜ j 1 , x ˜ j 2 , … , x ˜ j l j . By setting L = Δ in the LRBF–HFD approximation, the Laplacian of a sufficiently smooth function v at x j is approximated by
Δ v ( x j ) ≈ ∑ r = 1 m j w j , r v ( x j r ) + ∑ r = 1 l j w ˜ j , r Δ v ( x ˜ j r ) .
The local weights are obtained from
A j T w j w ˜ j ν j = ψ j T ,
where A j is the local augmented Hermite interpolation matrix and
ψ j = [ Δ φ ( ∥ x j − x j 1 ∥ ) , … , Δ φ ( ∥ x j − x j m j ∥ ) , Δ Δ 2 φ ( ∥ x j − x ˜ j 1 ∥ ) , … , Δ Δ 2 φ ( ∥ x j − x ˜ j l j ∥ ) , Δ p 1 ( x j ) , … , Δ p s ( x j ) ] .
After assembling the local approximations over all spatial nodes, we obtain
B h D n = A h U n , B h = I − W ˜ h , A h = W h ,
where
U n = u n ( x 1 ) , u n ( x 2 ) , … , u n ( x N s ) T
and D n contains the corresponding approximations of the Laplacian. Therefore,
D n = L h U n , L h = B h − 1 A h .
In practical computations, the inverse of B h is not formed explicitly. Instead, the matrix equation B h L h = A h is solved.

3.1.1. Space Discretization of the Nonlinear Time-Fractional Schrödinger Equation

We first define the term by
H u n = ∑ k = 1 n − 1 b n − k − 1 − b n − k U k + b n − 1 U 0 , n ≥ 1 .
For n = 1 , the summation term vanishes and hence
H u 1 = U 0 .
The potential matrix is given by
V h = diag V ( x 1 ) , … , V ( x N s ) ,
and the nonlinear term is defined as
N ( U ) = | U | 2 ⊙ U ,
where ⊙ denotes componentwise multiplication. Using the relation
D n = L h U n ,
the fully discrete scheme can be written as
i μ β I + α L h + V h U n = F n + i μ β H u n − λ N ( U n − 1 ) , n = 1 , 2 , … , N ,
where
F n = f n ( x 1 ) , f n ( x 2 ) , … , f n ( x N s ) T .
Since B h L h = A h , multiplying Eq. (35) by B h gives
i μ β B h + α A h + B h V h U n = B h F n + i μ β H u n − λ N ( U n − 1 ) .
This form is convenient because L h does not need to be computed explicitly. At the first time level, H u 1 = U 0 , and therefore
i μ β B h + α A h + B h V h U 1 = B h F 1 + i μ β U 0 − λ N ( U 0 ) .
Finally, the IC and BCs are imposed as U 0 = ψ ( x 1 ) , … , ψ ( x N s ) T , and u j n = h ( x j , t n ) , x j ∈ ∂ Ω .

3.1.2. Space Discretization of the Time-Fractional Schrödinger–Poisson System

For the coupled system, define
Ψ n = ψ n ( x 1 ) , … , ψ n ( x N s ) T , Φ n = Φ n ( x 1 ) , … , Φ n ( x N s ) T .
Similarly, let
F n = f n ( x 1 ) , … , f n ( x N s ) T , G n = g n ( x 1 ) , … , g n ( x N s ) T .
The history term is defined by
H ψ n = ∑ k = 1 n − 1 b n − k − 1 − b n − k Ψ k + b n − 1 Ψ 0 .
We also define
R ( Ψ ) = | Ψ | 2 , N ( Ψ ) = | Ψ | 2 ⊙ Ψ .
At each time level, we first solve the Poisson equation. Using the LRBF–HFD approximation, we obtain
− L h Φ n = c D R ( Ψ n − 1 ) + G n .
Using B h L h = A h , the above equation can be written as
− A h Φ n = B h c D R ( Ψ n − 1 ) + G n .
After finding Φ n , we define
P n = diag Φ n ( x 1 ) , … , Φ n ( x N s ) .
The discrete Schrödinger equation is then
i μ β I + a L h − α P n Ψ n = F n + i μ β H ψ n − λ N ( Ψ n − 1 ) .
Its compact form is
i μ β B h + a A h − α B h P n Ψ n = B h F n + i μ β H ψ n − λ N ( Ψ n − 1 ) .
For n = 1 , we have
H ψ 1 = Ψ 0 .
Therefore, the first time step is obtained from
− A h Φ 1 = B h c D R ( Ψ 0 ) + G 1 ,
i μ β B h + a A h − α B h P 1 Ψ 1 = B h F 1 + i μ β Ψ 0 − λ N ( Ψ 0 ) .
The initial condition is Ψ 0 = ψ 0 ( x 1 ) , … , ψ 0 ( x N s ) T , and the boundary conditions are imposed as
ψ j n = h ψ ( x j , t n ) , Φ j n = h Φ ( x j , t n ) , x j ∈ ∂ Ω .
Thus, at each time level, we first compute Φ n from Eq. (39). Then, the computed potential is used in Eq. (41) to obtain Ψ n .

4. Numerical Results and Discussion

This section presents several numerical examples to demonstrate the accuracy and effectiveness of the LRBF-FD method for solving nonlinear time-fractional Schrödinger equations and the time-fractional Schrödinger–Poisson system. To examine the temporal convergence, the experimental convergence order C t is calculated by
C t = log 2 L ∞ ( 2 δ t , h ) L ∞ ( δ t , h ) .
Here, the maximum absolute error at the final time T is defined by L ∞ = max 1 ≤ j ≤ N − 1 u ( x j , T ) − U ( x j , T ) , where u ( x j , T ) and U ( x j , T ) are the exact and numerical solutions, respectively, at the node x j . For the numerical simulations, we employ the LRBF–HFD method with the polyharmonic spline radial basis function φ ( r ) = r 7 , augmented with polynomials of degree five. In Examples 4 and 5, we consider an irregular star-shaped region whose boundary is given by r ( θ ) = 81 − 9 cos ( 8 θ ) 64 , 0 ≤ θ ≤ 2 π , and discretize the domain using Halton nodes.
Example 1. 
Let us consider the following nonlinear time-fractional Schrödinger equation [40]:
i 0 C D t β u ( x , t ) + ∂ 2 u ( x , t ) ∂ x 2 + | u ( x , t ) | 2 u ( x , t ) = f ( x , t ) , 0 ≤ x ≤ 1 , 0 < t ≤ T , 0 < β < 1 .
The source function is defined by
f ( x , t ) = − 2 t 2 − β Γ ( 3 − β ) cos ( 2 π x ) + − 4 π 2 t 2 + t 6 sin ( 2 π x ) + i 2 t 2 − β Γ ( 3 − β ) sin ( 2 π x ) + − 4 π 2 t 2 + t 6 cos ( 2 π x ) .
The exact solution is u ( x , t ) = t 2 sin ( 2 π x ) + i cos ( 2 π x ) . The IC and BCs can be computed directly from the exact solution.
The LRBF–HFD method is adopted to study the numerical accuracy corresponding to various values of δ t , N, and β . Table 1 gives the real, imaginary, and L ∞ errors together with the temporal convergence rates for β ∈ { 0.4 , 0.7 } at T = 1 , showing that the rates approach first-order convergence as the time step decreases. Table 2 presents the real, imaginary, and L ∞ errors for different numbers of spatial nodes with β ∈ { 0.25 , 0.85 } at T = 1 , showing a clear decrease in the numerical errors as the number of nodes increases. Table 3 summarizes the L ∞ , L 2 , and RMS errors together with the CPU running times for different final times and fractional orders, showing the effects of β and T on the numerical accuracy and computational cost. Finally, Figure 2 compares the approximate and exact real and imaginary parts and their corresponding absolute errors, showing good agreement between the numerical and exact solutions.
Example 2. 
We consider the following nonlinear time-fractional Schrödinger equation [41]:
i 0 C D t β u ( x , t ) + 1 2 ∂ 2 u ( x , t ) ∂ x 2 − cos 2 ( x ) u ( x , t ) − | u ( x , t ) | 2 u ( x , t ) = 0 , 0 ≤ x ≤ 1 , 0 < t ≤ T , 0 < β < 1 .
The exact solution is
u ( x , t ) = sin ( x ) ∑ k = 0 ∞ − 3 i t β k 2 k Γ ( k β + 1 ) = sin ( x ) E β − 3 i 2 t β .
The associated IC and BCs can be readily constructed using the given exact solution.
The LRBF–HFD method is applied to evaluate the numerical accuracy for various values of δ t , N, and β . Table 4 gives the real, imaginary, and L ∞ errors together with the temporal convergence rates for β ∈ { 0.45 , 0.75 } at T = 1 , showing that the numerical errors decrease as the time step becomes smaller. Table 5 provides similar results for β ∈ { 0.2 , 0.9 } at T = 1 , confirming the temporal convergence of the method for different fractional orders. Table 6 lists the L ∞ , L 2 , and RMS errors along with the CPU running times for different final times and fractional orders, showing the effect of β and T on accuracy and computational cost. Finally, Figure 3 compares the approximate and exact real and imaginary parts and their absolute errors, showing good agreement between the numerical and exact solutions.
Example 3. 
Consider the following two-dimensional nonlinear time-fractional Schrödinger equation [42]:
i 0 C D t β u ( x , y , t ) = − 1 2 ∂ 2 u ( x , y , t ) ∂ x 2 + ∂ 2 u ( x , y , t ) ∂ y 2 + 1 − sin 2 ( x ) sin 2 ( y ) u ( x , y , t ) + | u ( x , y , t ) | 2 u ( x , y , t ) , ( x , y ) ∈ [ 0 , 1 ] × [ 0 , 1 ] , 0 < t ≤ T , 0 < β < 1 .
The exact solution is stated as
u ( x , y , t ) = sin ( x ) sin ( y ) ∑ n = 0 ∞ − 5 i t β n 2 n Γ ( n β + 1 ) = sin ( x ) sin ( y ) E β − 5 i 2 t β .
The associated IC and BCs can be readily constructed using the given exact solution.
The LRBF–HFD method is implemented to examine the accuracy of the numerical solutions for different values of δ t , N, and β . Table 7 gives the real, imaginary, and L ∞ errors together with the temporal convergence rates for β ∈ { 0.35 , 0.95 } , showing that the numerical errors decrease as the time step becomes smaller. Table 8 presents similar results for β ∈ { 0.4 , 0.6 } , confirming the temporal convergence of the proposed method. Table 9 summarizes the L ∞ , L 2 , and RMS errors together with the CPU times for different final times and fractional orders, showing the effects of β and T on the numerical accuracy and computational cost. Finally, Figure 4 shows the numerical real and imaginary parts, the corresponding absolute error, and the wave density | u | 2 for β = 0.6 and δ t = 1 / 200 , demonstrating the accuracy of the numerical solution.
Example 4. 
Next, we consider the following time-fractional nonlinear Schrödinger equation:
i 0 C D t β u ( x , y , t ) − ∂ 2 u ( x , y , t ) ∂ x 2 − ∂ 2 u ( x , y , t ) ∂ y 2 + | u ( x , y , t ) | 2 u ( x , y , t ) = 2 i t 2 − β Γ ( 3 − β ) sin ( x + y ) + t 2 sin ( x + y ) 2 + t 2 sin ( x + y ) 2 ,
where 0 < t ≤ T , 0 < β < 1 . The exact solution is u ( x , y , t ) = t 2 sin ( x + y ) . The IC and BCs can be obtained directly from the above exact solution.
The LRBF–HFD method is utilized to assess the accuracy of the numerical results for different values of Δ t , N, and β . Table 10 gives the real, imaginary, and L ∞ errors for β ∈ { 0.2 , 0.8 } , showing approximately first-order temporal convergence as the time step decreases. Table 11 presents similar results for β ∈ { 0.35 , 0.75 } , where the convergence rates also approach one for smaller time steps. Table 12 summarizes the L ∞ , L 2 , and RMS errors together with the CPU running times for different final times and fractional orders, showing the effects of β and T on the numerical accuracy and computational cost. Figure 5 compares the numerical and exact solutions and shows the corresponding absolute error and wave density | u | 2 for β = 0.75 and δ t = 1 / 200 , demonstrating the accuracy of the numerical approximation. Finally, Figure 6 illustrates the numerical and exact solutions on the irregular domain, together with the associated absolute error and wave density | u | 2 , for β = 0.5 and δ t = 1 / 200 , indicating the high accuracy of the numerical results.
Example 5. 
Finally, we consider the time-fractional Schrödinger–Poisson system
i 0 C D t β ψ + Δ ψ + | ψ | 2 ψ = f , − Δ Φ = | ψ | 2 + g ,
on Ω for 0 < t ≤ T . The exact solutions are
ψ ( x , y , t ) = ( 1 + t 2 ) sin ( π x ) sin ( π y ) , Φ ( x , y , t ) = t 2 sin ( π x ) sin ( π y ) .
The IC and BCs are determined from the aforementioned exact solutions.
The LRBF–HFD method is employed to investigate the accuracy for different values of δ t , N, and β . Table 13 gives the temporal L ∞ errors and the corresponding convergence rates for ψ and Φ with β ∈ { 0.25 , 0.55 } , confirming the convergence of the proposed scheme. Table 14 presents similar results for β ∈ { 0.7 , 0.9 } , showing that the errors decrease as the time step becomes smaller. Table 15 summarizes the L ∞ , L 2 , and RMS errors for ψ and Φ at different final times and fractional orders, together with the corresponding computational costs. Figure 7 shows the numerical solutions of ψ and Φ and their corresponding absolute errors on the square domain for β = 0.5 and δ t = 1 / 200 , demonstrating the accuracy of the proposed method. Finally, Figure 8 presents the numerical solutions of ψ and Φ on the irregular domain, together with their corresponding absolute errors, for β = 0.5 and δ t = 1 / 200 .

5. Conclusion

This paper developed an efficient localized meshless method for nonlinear time-fractional Schrödinger equations and Schrödinger–Poisson systems. The Caputo fractional derivative was approximated by the L1 formula, while the spatial derivatives were discretized using the LRBF-HFD method. The localized formulation avoided the large and ill-conditioned matrices of global RBF methods and reduced the computational cost. Several numerical examples were used to examine the accuracy and performance of the method for different fractional orders, spatial discretizations, and final times. The numerical results showed good agreement with the exact solutions and a clear decrease in the errors under mesh refinement. Therefore, the proposed method provided an accurate and efficient approach for solving the considered fractional models.

Author Contributions

O. Nikan: Conceptualization, Data curation, Investigation, Software, Validation, and Writing–original draft. Z. Avvazadeh: Methodology, Formal analysis, Supervision, Validation, and Writing–review and editing.

Funding

The author received no financial support for the research.

Data Availability Statement

No datasets were generated or analysed during the current study.

Ethical Approval

Not Applicable.

Conflicts of Interest

The authors declare that there are no conflicts of interest.

References

  1. M. Muddassar, A. G. Khan, S. S. Dragomir, H. Budak, Z. Ur Rehman, T. Jabeen, Predicting nonlinear phenomena through fractional derivatives and advanced Riccati mapping: bifurcation and solitary wave behavior in nonlinear systems, Boundary Value Problems 2025 (1) (2025) 141.
  2. A. A. Zaagan, M. Y. Almusawa, H. Zogan, H. Alshehri, F. Jeribi, Novel analysis of linear and nonlinear fractional KdV and Kolmogorov equations, Boundary Value Problems 2026 (1) (2026) 28.
  3. M. Bilal, N. Ahmad, I. Lucian-Popa, A. Alzahrani, A. Aljahdali, On the dynamics of nonlinear mixed fractional integro-differential systems with Grünwald–Letnikov operators, Boundary Value Problems 2026 (1) (2026) 49.
  4. M. Mossa Al-sawalha, M. Alquraish, A. M. Zidan, A. Shafee, N. M. Mohammed, Nonlinear wave dynamics in higher dimensions: analytical solutions for the coupled Konno-oono and Kadomtsev-Petviashvili modified extended wave equations, Boundary Value Problems 2026 (1) (2026) 62.
  5. N. Laskin, Fractional quantum mechanics and Lévy path integrals, Physics Letters A 268 (4–6) (2000) 298–305. [CrossRef]
  6. N. Laskin, Fractional Schrödinger equation, Physical Review E 66 (5) (2002) 056108. [CrossRef]
  7. K. Kirkpatrick, E. Lenzmann, G. Staffilani, On the continuum limit for discrete NLS with long-range lattice interactions, Communications in Mathematical Physics 317 (3) (2013) 563–591. [CrossRef]
  8. A. J. Majda, D. W. McLaughlin, E. G. Tabak, A one-dimensional model for dispersive wave turbulence, Journal of Nonlinear Science 7 (1) (1997) 9–44. [CrossRef]
  9. Y. Hu, G. Kallianpur, Schrödinger equations with fractional Laplacians, Applied Mathematics and Optimization 42 (3) (2000) 281–290. [CrossRef]
  10. V. E. Zakharov, P. Guyenne, A. N. Pushkarev, F. Dias, Wave turbulence in one-dimensional models, Physica D: Nonlinear Phenomena 152–153 (2001) 573–619. [CrossRef]
  11. S. Longhi, Fractional Schrödinger equation in optics, Optics Letters 40 (6) (2015) 1117–1120. [CrossRef]
  12. A. Mohebbi, M. Abbaszadeh, M. Dehghan, The use of a meshless technique based on collocation and radial basis functions for solving the time fractional nonlinear Schrödinger equation arising in quantum mechanics, Engineering Analysis with Boundary Elements 37 (2) (2013) 475–485. [CrossRef]
  13. Q. Ding, P. J. Y. Wong, Quintic non-polynomial spline for time-fractional nonlinear schrödinger equation, Advances in Difference Equations 2020 (2020) 577. [CrossRef]
  14. J. Zhang, D. Li, X. Antoine, Efficient numerical computation of time-fractional nonlinear schrödinger equations in unbounded domain, Communications in Computational Physics 25 (1) (2019) 218–243. [CrossRef]
  15. Y. Wang, G. Wang, L. Bu, L. Mei, Two second-order and linear numerical schemes for the multi-dimensional nonlinear time-fractional schrödinger equation, Numerical Algorithms 88 (1) (2021) 419–451. [CrossRef]
  16. H. Hu, Y. Chen, J. Zhou, Two-grid finite element method on grade meshes for time-fractional nonlinear schrödinger equation, Numerical Methods for Partial Differential Equations 40 (2) (2024) e23073. [CrossRef]
  17. Z. Wang, M. Xiao, Y. Mo, Time two-grid fitted scheme for the nonlinear time fractional schrödinger equation with nonsmooth solutions, Communications in Nonlinear Science and Numerical Simulation 137 (2024) 108119. [CrossRef]
  18. R. Huang, Z. Weng, J. Yuan, Collocation-based numerical simulation of multi-dimensional nonlinear time-fractional schrödinger equations, Computers & Mathematics with Applications 183 (2025) 214–233. [CrossRef]
  19. Y. Wang, B. Yin, Y. Liu, H. Li, Modified L1 crank–nicolson finite element methods with unconditional convergence for nonlinear time-fractional schrödinger equations, Communications in Nonlinear Science and Numerical Simulation 143 (2025) 108623. [CrossRef]
  20. J. Ma, T. Sun, H. Chen, An efficient numerical scheme for two-dimensional nonlinear time fractional schrödinger equation, Communications in Nonlinear Science and Numerical Simulation 147 (2025) 108824. [CrossRef]
  21. Q. Qian, X. Feng, L. Qian, Rigorous error analysis of the L1-CN scheme combined with graded mesh based on virtual element discretization for the nonlinear time-fractional schrödinger equation, Communications in Nonlinear Science and Numerical Simulation 160 (2026) 110001. [CrossRef]
  22. L. Wei, Y. He, X. Zhang, S. Wang, Analysis of an implicit fully discrete local discontinuous galerkin method for the time-fractional schrödinger equation, Finite Elements in Analysis and Design 59 (2012) 28–34. [CrossRef]
  23. J. Zhang, J. Wang, Y. Zhou, Numerical analysis for time-fractional schrödinger equation on two space dimensions, Advances in Difference Equations 2020 (2020) 53. [CrossRef]
  24. M. Serik, R. Eskar, P. Huang, Numerical solution of time-fractional schrödinger equation by using FDM, Axioms 12 (9) (2023) 816. [CrossRef]
  25. A. Navarrete, A. Paredes, J. R. Salgueiro, H. Michinel, Spatial solitons in thermo-optical media from the nonlinear Schrödinger–Poisson equation and dark-matter analogs, Physical Review A 95 (1) (2017) 013844. [CrossRef]
  26. Á. Paredes, D. N. Olivieri, H. Michinel, From optics to dark matter: A review on nonlinear Schrödinger–Poisson systems, Physica D: Nonlinear Phenomena 403 (2020) 132301. [CrossRef]
  27. M. Bahrami, A. Großardt, S. Donadi, A. Bassi, The Schrödinger–Newton equation and its foundations, New Journal of Physics 16 (11) (2014) 115007. [CrossRef]
  28. C. G. Böhmer, T. Harko, Can dark matter be a Bose–Einstein condensate?, Journal of Cosmology and Astroparticle Physics 2007 (06) (2007) 025. [CrossRef]
  29. T. Kerkhoven, A. T. Galick, U. Ravioli, J. H. Arends, Y. Saad, Efficient numerical simulation of electron states in quantum wires, Journal of Applied Physics 68 (7) (1990) 3461–3469.
  30. F. Nier, A stationary Schrödinger–Poisson system arising from the modelling of electronic devices, Forum Mathematicum 2 (1) (1990) 489–510. [CrossRef]
  31. R. Ruffini, S. Bonazzola, Systems of self-gravitating particles in general relativity and the concept of an equation of state, Physical Review 187 (5) (1969) 1767–1783. [CrossRef]
  32. G. Gu, X. Tang, J. Shen, Multiple solutions for fractional schrödinger–poisson system with critical or supercritical nonlinearity, Applied Mathematics Letters 111 (2021) 106605. [CrossRef]
  33. P. Zhang, J. Jia, X. Jiang, Time-splitting fourier spectral method for two-dimensional space fractional schrödinger–poisson–xα model, Applied Mathematics Letters 170 (2025) 109610. [CrossRef]
  34. Z.-z. Sun, X. Wu, A fully discrete difference scheme for a diffusion-wave system, Applied Numerical Mathematics 56 (2) (2006) 193–209.
  35. M. Haghi, M. Ilati, M. Dehghan, A radial basis function-Hermite finite difference (RBF-HFD) method for the cubic-quintic complex Ginzburg–Landau equation, Computational and Applied Mathematics 42 (3) (2023) 115.
  36. Y. Yang, F. Soleymani, M. Barfeie, E. Tohidi, A radial basis function—Hermite finite difference approach to tackle cash-or-nothing and asset-or-nothing options, Journal of Computational and Applied Mathematics 368 (2020) 112523.
  37. F. Soleymani, S. Zhu, On a high-order Gaussian radial basis function generated hermite finite difference method and its application, Calcolo 58 (4) (2021) 50.
  38. Z. Wu, Hermite–birkhoff interpolation of scattered data by radial basis functions, Approximation Theory and Its Applications 8 (2) (1992) 1–10.
  39. F. J. Narcowich, J. D. Ward, Generalized hermite interpolation via matrix-valued conditionally positive definite functions, Mathematics of Computation 63 (208) (1994) 661–687.
  40. L. Wei, Y. He, X. Zhang, S. Wang, Analysis of an implicit fully discrete local discontinuous Galerkin method for the time-fractional Schrödinger equation, Finite Elements in Analysis and Design 59 (2012) 28–34.
  41. S. Z. Rida, H. M. El-Sherbiny, A. A. M. Arafa, On the solution of the fractional nonlinear Schrödinger equation, Physics Letters A 372 (5) (2008) 553–558. [CrossRef]
  42. N. A. Khan, M. Jamil, A. Ara, Approximate solutions to time-fractional Schrödinger equation via homotopy analysis method, ISRN Mathematical Physics 2012 (2012) 197068. [CrossRef]
Figure 1. Illustration of a local stencil centered at x 0 in an irregular domain.
Figure 1. Illustration of a local stencil centered at x 0 in an irregular domain.
Preprints 233428 g001
Figure 2. Comparison of the approximate and exact solutions and the corresponding absolute errors for the real part (a,b) and the imaginary part (c,d) of Example 1 with β = 0.35 and t = 1 / 100 .
Figure 2. Comparison of the approximate and exact solutions and the corresponding absolute errors for the real part (a,b) and the imaginary part (c,d) of Example 1 with β = 0.35 and t = 1 / 100 .
Preprints 233428 g002
Figure 3. Comparison of the approximate and exact solutions and the corresponding absolute errors for the real part (a,b) and the imaginary part (c,d) of Example 2 with β = 0.85 and δ t = 1 / 100 when T = 1 .
Figure 3. Comparison of the approximate and exact solutions and the corresponding absolute errors for the real part (a,b) and the imaginary part (c,d) of Example 2 with β = 0.85 and δ t = 1 / 100 when T = 1 .
Preprints 233428 g003
Figure 4. Numerical real and imaginary parts of the solution, the corresponding absolute error, and the wave density at the final time for Example 3: (a) numerical real part, (b) numerical imaginary part, (c) absolute error, and (d) wave density | u | 2 .
Figure 4. Numerical real and imaginary parts of the solution, the corresponding absolute error, and the wave density at the final time for Example 3: (a) numerical real part, (b) numerical imaginary part, (c) absolute error, and (d) wave density | u | 2 .
Preprints 233428 g004
Figure 5. Numerical and exact solutions, the corresponding absolute error, and the wave density for Example 4: (a) numerical solution, (b) exact solution, (c) absolute error, and (d) wave density | u | 2 .
Figure 5. Numerical and exact solutions, the corresponding absolute error, and the wave density for Example 4: (a) numerical solution, (b) exact solution, (c) absolute error, and (d) wave density | u | 2 .
Preprints 233428 g005
Figure 6. Numerical and exact solutions, the corresponding absolute error, and the wave density on the irregular domain in Example 4: (a) numerical solution, (b) exact solution, (c) absolute error, and (d) wave density | u | 2 .
Figure 6. Numerical and exact solutions, the corresponding absolute error, and the wave density on the irregular domain in Example 4: (a) numerical solution, (b) exact solution, (c) absolute error, and (d) wave density | u | 2 .
Preprints 233428 g006
Figure 7. Numerical solutions and corresponding absolute errors for ψ and Φ in Example 5: (a) numerical solution of ψ , (b) absolute error of ψ , (c) numerical solution of Φ , and (d) absolute error of Φ .
Figure 7. Numerical solutions and corresponding absolute errors for ψ and Φ in Example 5: (a) numerical solution of ψ , (b) absolute error of ψ , (c) numerical solution of Φ , and (d) absolute error of Φ .
Preprints 233428 g007
Figure 8. Numerical solutions and corresponding absolute errors for ψ and Φ on the irregular domain in Example 5: (a) numerical solution of ψ , (b) absolute error of ψ , (c) numerical solution of Φ , and (d) absolute error of Φ .
Figure 8. Numerical solutions and corresponding absolute errors for ψ and Φ on the irregular domain in Example 5: (a) numerical solution of ψ , (b) absolute error of ψ , (c) numerical solution of Φ , and (d) absolute error of Φ .
Preprints 233428 g008
Table 1. Errors in the real and imaginary parts, L ∞ errors, and temporal convergence rates C t for Example 1 at different values of β .
Table 1. Errors in the real and imaginary parts, L ∞ errors, and temporal convergence rates C t for Example 1 at different values of β .
δ t β = 0.4 β = 0.7
Real Imaginary L ∞ C t Real Imaginary L ∞ C t
1 / 10 1.566 e − 02 2.460 e − 02 2.529 e − 02 − 1.807 e − 02 2.341 e − 02 2.529 e − 02 −
1 / 20 9.202 e − 03 1.458 e − 02 1.503 e − 02 0.751 1.066 e − 02 1.362 e − 02 1.486 e − 02 0.767
1 / 40 5.040 e − 03 8.021 e − 03 8.289 e − 03 0.858 5.843 e − 03 7.390 e − 03 8.123 e − 03 0.871
1 / 80 2.643 e − 03 4.218 e − 03 4.366 e − 03 0.925 3.061 e − 03 3.851 e − 03 4.250 e − 03 0.934
1 / 160 1.351 e − 03 2.158 e − 03 2.235 e − 03 0.966 1.560 e − 03 1.960 e − 03 2.167 e − 03 0.972
1 / 320 6.781 e − 04 1.084 e − 03 1.123 e − 03 0.993 7.820 e − 04 9.811 e − 04 1.086 e − 03 0.997
1 / 640 3.351 e − 04 5.350 e − 04 5.549 e − 04 1.018 3.860 e − 04 4.831 e − 04 5.356 e − 04 1.020
1 / 1280 1.619 e − 04 2.576 e − 04 2.675 e − 04 1.053 1.866 e − 04 2.318 e − 04 2.578 e − 04 1.055
Table 2. Real, imaginary, and L ∞ errors for various spatial discretizations and selected fractional orders β in Example 1.
Table 2. Real, imaginary, and L ∞ errors for various spatial discretizations and selected fractional orders β in Example 1.
N β = 0.25 β = 0.85
Real Imaginary L ∞ Real Imaginary L ∞
10 3.894 e − 03 9.809 e − 03 9.998 e − 03 4.328 e − 03 8.925 e − 03 9.491 e − 03
15 5.017 e − 04 2.442 e − 03 2.490 e − 03 8.334 e − 04 2.196 e − 03 2.348 e − 03
20 1.710 e − 04 6.606 e − 04 6.741 e − 04 2.958 e − 04 5.602 e − 04 6.221 e − 04
25 1.026 e − 04 2.729 e − 04 2.803 e − 04 1.762 e − 04 2.081 e − 04 2.565 e − 04
30 9.974 e − 05 1.996 e − 04 2.055 e − 04 1.608 e − 04 1.413 e − 04 1.936 e − 04
Table 3. Numerical errors and CPU times at different final times and fractional orders, with Δ t = 1 / 400 , for Example 1.
Table 3. Numerical errors and CPU times at different final times and fractional orders, with Δ t = 1 / 400 , for Example 1.
β T Error measures CPU (s)
Real Imaginary L ∞ L 2 RMS
0.25 0.5 1.075 e − 05 1.670 e − 05 1.712 e − 05 1.205 e − 05 1.199 e − 05 0.058
1.0 5.045 e − 04 8.774 e − 04 8.964 e − 04 6.205 e − 04 6.174 e − 04 0.067
1.5 3.409 e − 02 9.691 e − 03 3.535 e − 02 2.454 e − 02 2.442 e − 02 0.112
0.50 0.5 1.398 e − 05 1.560 e − 05 1.769 e − 05 1.232 e − 05 1.226 e − 05 0.029
1.0 5.608 e − 04 8.352 e − 04 8.794 e − 04 6.064 e − 04 6.034 e − 04 0.065
1.5 2.049 e − 02 7.986 e − 03 2.167 e − 02 1.438 e − 02 1.431 e − 02 0.108
0.75 0.5 3.077 e − 05 1.790 e − 05 3.120 e − 05 2.156 e − 05 2.145 e − 05 0.027
1.0 6.354 e − 04 7.541 e − 04 8.524 e − 04 5.827 e − 04 5.798 e − 04 0.075
1.5 1.467 e − 02 6.560 e − 03 1.554 e − 02 9.972 e − 03 9.923 e − 03 0.108
Table 4. Errors in the real and imaginary components, L ∞ error norms, and temporal convergence rates C t for Example 2 at various values of β .
Table 4. Errors in the real and imaginary components, L ∞ error norms, and temporal convergence rates C t for Example 2 at various values of β .
δ t β = 0.45 β = 0.75
Real Imaginary L ∞ C t Real Imaginary L ∞ C t
1 / 10 9.876 e − 05 1.775 e − 04 2.018 e − 04 − 1.066 e − 03 3.951 e − 04 1.120 e − 03 −
1 / 20 7.375 e − 05 1.288 e − 04 1.477 e − 04 0.451 4.626 e − 04 1.786 e − 04 4.767 e − 04 1.233
1 / 40 4.724 e − 05 7.941 e − 05 9.200 e − 05 0.683 1.293 e − 04 1.233 e − 04 1.355 e − 04 1.815
1 / 80 2.766 e − 05 4.504 e − 05 5.266 e − 05 0.805 3.168 e − 05 8.713 e − 05 9.237 e − 05 0.553
1 / 160 1.536 e − 05 2.438 e − 05 2.872 e − 05 0.875 3.130 e − 05 5.758 e − 05 6.554 e − 05 0.495
1 / 320 8.252 e − 06 1.283 e − 05 1.521 e − 05 0.917 2.277 e − 05 3.537 e − 05 4.203 e − 05 0.641
1 / 640 4.340 e − 06 6.635 e − 06 7.904 e − 06 0.944 1.444 e − 05 2.059 e − 05 2.511 e − 05 0.743
1 / 1280 2.250 e − 06 3.393 e − 06 4.058 e − 06 0.962 8.513 e − 06 1.155 e − 05 1.432 e − 05 0.810
Table 5. Errors in the real and imaginary components, L ∞ errors, and temporal convergence rates C t for Example 2 at different values of β .
Table 5. Errors in the real and imaginary components, L ∞ errors, and temporal convergence rates C t for Example 2 at different values of β .
δ t β = 0.2 β = 0.9
Real Imaginary L ∞ C t Real Imaginary L ∞ C t
1 / 10 2.230 e − 04 1.310 e − 04 2.573 e − 04 − 4.000 e − 03 2.381 e − 04 4.004 e − 03 −
1 / 20 9.942 e − 05 4.715 e − 05 1.090 e − 04 1.239 1.903 e − 03 5.428 e − 04 1.973 e − 03 1.021
1 / 40 4.296 e − 05 1.662 e − 05 4.538 e − 05 1.264 1.103 e − 03 5.459 e − 04 1.227 e − 03 0.685
1 / 80 1.797 e − 05 5.800 e − 06 1.850 e − 05 1.294 6.613 e − 04 3.701 e − 04 7.560 e − 04 0.699
1 / 160 7.258 e − 06 2.241 e − 06 7.351 e − 06 1.332 3.827 e − 04 2.166 e − 04 4.388 e − 04 0.785
1 / 320 2.813 e − 06 1.496 e − 06 2.824 e − 06 1.380 2.132 e − 04 1.191 e − 04 2.437 e − 04 0.848
1 / 640 1.035 e − 06 8.956 e − 07 1.036 e − 06 1.447 1.157 e − 04 6.366 e − 05 1.318 e − 04 0.887
1 / 1280 3.555 e − 07 5.033 e − 07 5.069 e − 07 1.032 6.166 e − 05 3.356 e − 05 7.007 e − 05 0.911
Table 6. Numerical errors at distinct final times and fractional orders, with δ t = 1 / 400 , for Example 2.
Table 6. Numerical errors at distinct final times and fractional orders, with δ t = 1 / 400 , for Example 2.
β T Error measures CPU (s)
Real Imaginary L ∞ L 2 RMS
0.25 1.0 7.595 e − 07 2.457 e − 06 2.477 e − 06 1.442 e − 06 1.433 e − 06 0.230
2.0 7.938 e − 07 8.308 e − 07 9.541 e − 07 7.118 e − 07 7.074 e − 07 0.657
3.0 6.452 e − 07 3.865 e − 07 6.503 e − 07 5.051 e − 07 5.019 e − 07 1.154
4.0 5.359 e − 07 4.085 e − 07 6.576 e − 07 4.636 e − 07 4.608 e − 07 1.990
5.0 1.354 e − 05 4.203 e − 05 4.414 e − 05 3.165 e − 05 3.145 e − 05 3.035
0.50 1.0 8.444 e − 06 1.434 e − 05 1.660 e − 05 1.120 e − 05 1.114 e − 05 0.131
2.0 2.290 e − 07 1.864 e − 06 1.869 e − 06 1.157 e − 06 1.150 e − 06 0.290
3.0 2.762 e − 07 2.560 e − 07 3.217 e − 07 2.536 e − 07 2.520 e − 07 0.745
4.0 1.825 e − 07 2.666 e − 07 3.107 e − 07 2.123 e − 07 2.110 e − 07 1.313
5.0 1.260 e − 07 2.466 e − 07 2.719 e − 07 1.867 e − 07 1.855 e − 07 1.931
0.75 1.0 1.988 e − 05 2.987 e − 05 3.583 e − 05 2.316 e − 05 2.302 e − 05 0.098
2.0 4.374 e − 06 7.747 e − 06 8.890 e − 06 6.201 e − 06 6.163 e − 06 0.231
3.0 5.721 e − 06 5.358 e − 06 7.835 e − 06 5.611 e − 06 5.576 e − 06 0.599
4.0 2.351 e − 06 2.468 e − 06 3.409 e − 06 2.438 e − 06 2.423 e − 06 1.105
5.0 1.197 e − 06 1.010 e − 06 1.566 e − 06 1.121 e − 06 1.114 e − 06 1.837
Table 7. Errors in the real and imaginary components, L ∞ errors, and temporal convergence rates C t for Example 3 at different values of β .
Table 7. Errors in the real and imaginary components, L ∞ errors, and temporal convergence rates C t for Example 3 at different values of β .
δ t β = 0.35 β = 0.95
Real Imaginary L ∞ C t Real Imaginary L ∞ C t
1 / 10 1.695 e − 04 1.910 e − 04 2.537 e − 04 − 4.517 e − 03 8.331 e − 03 9.477 e − 03 −
1 / 20 7.437 e − 05 7.345 e − 05 1.037 e − 04 1.291 2.049 e − 03 4.180 e − 03 4.655 e − 03 1.026
1 / 40 3.145 e − 05 2.965 e − 05 4.272 e − 05 1.280 9.133 e − 04 2.154 e − 03 2.339 e − 03 0.993
1 / 80 1.298 e − 05 1.255 e − 05 1.778 e − 05 1.265 3.725 e − 04 1.083 e − 03 1.146 e − 03 1.030
1 / 160 5.270 e − 06 5.570 e − 06 7.513 e − 06 1.243 1.472 e − 04 5.197 e − 04 5.397 e − 04 1.086
1 / 320 2.113 e − 06 2.546 e − 06 3.243 e − 06 1.212 5.739 e − 05 2.389 e − 04 2.454 e − 04 1.137
1 / 640 8.351 e − 07 1.171 e − 06 1.409 e − 06 1.203 2.213 e − 05 1.062 e − 04 1.083 e − 04 1.180
1 / 1280 3.207 e − 07 5.238 e − 07 6.048 e − 07 1.220 8.477 e − 06 4.593 e − 05 4.669 e − 05 1.214
Table 8. Errors in the real and imaginary components, L ∞ errors, and temporal convergence rates C t for Example 3 at different values of β .
Table 8. Errors in the real and imaginary components, L ∞ errors, and temporal convergence rates C t for Example 3 at different values of β .
δ t β = 0.4 β = 0.6
Real Imaginary L ∞ C t Real Imaginary L ∞ C t
1 / 10 1.496 e − 04 1.834 e − 04 2.350 e − 04 − 2.863 e − 04 2.026 e − 04 3.500 e − 04 −
1 / 20 6.230 e − 05 6.994 e − 05 9.250 e − 05 1.345 1.080 e − 04 7.158 e − 05 1.292 e − 04 1.438
1 / 40 2.509 e − 05 2.852 e − 05 3.733 e − 05 1.309 4.134 e − 05 2.880 e − 05 5.013 e − 05 1.366
1 / 80 9.920 e − 06 1.241 e − 05 1.557 e − 05 1.261 1.585 e − 05 1.255 e − 05 2.007 e − 05 1.321
1 / 160 3.882 e − 06 5.651 e − 06 6.723 e − 06 1.212 6.040 e − 06 5.733 e − 06 8.253 e − 06 1.282
1 / 320 1.507 e − 06 2.637 e − 06 2.984 e − 06 1.172 2.277 e − 06 2.683 e − 06 3.491 e − 06 1.241
1 / 640 5.781 e − 07 1.234 e − 06 1.347 e − 06 1.147 8.432 e − 07 1.261 e − 06 1.510 e − 06 1.209
1 / 1280 2.157 e − 07 5.620 e − 07 5.978 e − 07 1.173 2.994 e − 07 5.832 e − 07 6.527 e − 07 1.210
Table 9. Numerical errors and CPU times at several final times and fractional orders β with δ t = 1 / 400 for Example 3.
Table 9. Numerical errors and CPU times at several final times and fractional orders β with δ t = 1 / 400 for Example 3.
β T Error measures CPU (s)
Real Imaginary L ∞ L 2 RMS
0.35 1.0 1.570 e − 06 1.983 e − 06 2.479 e − 06 1.278 e − 06 1.237 e − 06 1.745
1.5 9.832 e − 07 1.011 e − 06 1.371 e − 06 7.100 e − 07 6.871 e − 07 3.203
2.0 1.069 e − 04 1.761 e − 04 2.054 e − 04 1.044 e − 04 1.010 e − 04 4.847
0.55 1.0 4.110 e − 07 2.145 e − 06 2.184 e − 06 1.088 e − 06 1.053 e − 06 1.650
1.5 4.916 e − 08 1.116 e − 06 1.116 e − 06 5.573 e − 07 5.394 e − 07 3.029
2.0 6.950 e − 08 7.329 e − 07 7.346 e − 07 3.680 e − 07 3.562 e − 07 4.591
0.65 1.0 4.380 e − 06 2.665 e − 06 5.093 e − 06 2.629 e − 06 2.544 e − 06 1.624
1.5 6.291 e − 07 2.511 e − 07 6.294 e − 07 3.378 e − 07 3.269 e − 07 2.992
2.0 1.078 e − 07 4.545 e − 07 4.636 e − 07 2.300 e − 07 2.226 e − 07 4.517
Table 10. Errors in the real and imaginary components, L ∞ errors, and temporal convergence rates C t for Example 4 at different values of β .
Table 10. Errors in the real and imaginary components, L ∞ errors, and temporal convergence rates C t for Example 4 at different values of β .
δ t β = 0.2 β = 0.8
Real Imaginary L ∞ C t Real Imaginary L ∞ C t
1 / 10 2.080 e − 02 1.299 e − 03 2.084 e − 02 − 2.045 e − 02 6.114 e − 04 2.046 e − 02 −
1 / 20 1.144 e − 02 7.487 e − 04 1.146 e − 02 0.863 1.124 e − 02 7.200 e − 04 1.126 e − 02 0.861
1 / 40 5.976 e − 03 3.994 e − 04 5.989 e − 03 0.936 5.876 e − 03 4.906 e − 04 5.894 e − 03 0.934
1 / 80 3.051 e − 03 2.062 e − 04 3.058 e − 03 0.970 3.001 e − 03 2.911 e − 04 3.014 e − 03 0.968
1 / 160 1.541 e − 03 1.048 e − 04 1.544 e − 03 0.986 1.516 e − 03 1.630 e − 04 1.524 e − 03 0.984
1 / 320 7.739 e − 04 5.286 e − 05 7.756 e − 04 0.994 7.613 e − 04 8.856 e − 05 7.660 e − 04 0.992
1 / 640 3.874 e − 04 2.653 e − 05 3.883 e − 04 0.998 3.811 e − 04 4.720 e − 05 3.838 e − 04 0.997
1 / 1280 1.934 e − 04 1.327 e − 05 1.939 e − 04 1.002 1.903 e − 04 2.482 e − 05 1.917 e − 04 1.001
Table 11. Errors in the real and imaginary components, L ∞ errors, and temporal convergence rates C t for Example 4 at several values of β .
Table 11. Errors in the real and imaginary components, L ∞ errors, and temporal convergence rates C t for Example 4 at several values of β .
δ t β = 0.35 β = 0.75
Real error Imaginary L ∞ C t Real error Imaginary L ∞ C t
1 / 10 2.076 e − 02 1.444 e − 03 2.081 e − 02 − 2.050 e − 02 9.010 e − 04 2.052 e − 02 −
1 / 20 1.141 e − 02 8.799 e − 04 1.144 e − 02 0.863 1.127 e − 02 8.413 e − 04 1.130 e − 02 0.861
1 / 40 5.963 e − 03 4.823 e − 04 5.981 e − 03 0.936 5.890 e − 03 5.432 e − 04 5.913 e − 03 0.934
1 / 80 3.045 e − 03 2.531 e − 04 3.054 e − 03 0.970 3.008 e − 03 3.140 e − 04 3.023 e − 03 0.968
1 / 160 1.538 e − 03 1.300 e − 04 1.543 e − 03 0.985 1.519 e − 03 1.728 e − 04 1.528 e − 03 0.984
1 / 320 7.722 e − 04 6.600 e − 05 7.748 e − 04 0.994 7.631 e − 04 9.264 e − 05 7.682 e − 04 0.992
1 / 640 3.866 e − 04 3.328 e − 05 3.879 e − 04 0.998 3.820 e − 04 4.881 e − 05 3.849 e − 04 0.997
1 / 1280 1.930 e − 04 1.670 e − 05 1.937 e − 04 1.002 1.907 e − 04 2.540 e − 05 1.923 e − 04 1.001
Table 12. Numerical errors and CPU times at various final times and fractional orders β with δ t = 1 / 400 for Example 4.
Table 12. Numerical errors and CPU times at various final times and fractional orders β with δ t = 1 / 400 for Example 4.
β T Error measures CPU (s)
Real Imaginary L ∞ L 2 RMS
0.45 1.0 6.169 e − 04 6.071 e − 05 6.197 e − 04 3.275 e − 04 3.169 e − 04 1.507
2.0 7.466 e − 03 2.985 e − 04 7.472 e − 03 4.316 e − 03 4.177 e − 03 4.425
0.65 1.0 6.133 e − 04 7.428 e − 05 6.175 e − 04 3.263 e − 04 3.158 e − 04 1.533
2.0 7.468 e − 03 3.028 e − 04 7.473 e − 03 4.317 e − 03 4.178 e − 03 4.387
0.75 1.0 6.109 e − 04 7.549 e − 05 6.152 e − 04 3.250 e − 04 3.145 e − 04 1.526
2.0 7.469 e − 03 2.958 e − 04 7.474 e − 03 4.318 e − 03 4.179 e − 03 4.420
Table 13. Numerical errors L ∞ and the corresponding convergence rates C t for ψ and Φ in Example 5 for different values of β when T = 1 .
Table 13. Numerical errors L ∞ and the corresponding convergence rates C t for ψ and Φ in Example 5 for different values of β when T = 1 .
δ t β = 0.25 β = 0.55
ψ Φ ψ Φ
L ∞ C t L ∞ C t L ∞ C t L ∞ C t
1 / 10 5.665 e − 02 − 8.090 e − 03 − 5.652 e − 02 − 8.040 e − 03 −
1 / 20 3.174 e − 02 0.836 4.584 e − 03 0.820 3.162 e − 02 0.838 4.549 e − 03 0.822
1 / 40 1.700 e − 02 0.900 2.493 e − 03 0.879 1.692 e − 02 0.902 2.472 e − 03 0.880
1 / 80 8.891 e − 03 0.935 1.337 e − 03 0.899 8.845 e − 03 0.936 1.325 e − 03 0.899
1 / 160 4.618 e − 03 0.945 7.262 e − 04 0.880 4.592 e − 03 0.946 7.201 e − 04 0.880
1 / 320 2.421 e − 03 0.932 4.120 e − 04 0.818 2.407 e − 03 0.932 4.088 e − 04 0.817
1 / 640 1.307 e − 03 0.889 2.525 e − 04 0.707 1.300 e − 03 0.889 2.508 e − 04 0.705
1 / 1280 7.459 e − 04 0.809 1.721 e − 04 0.553 7.420 e − 04 0.809 1.712 e − 04 0.551
Table 14. Numerical errors L ∞ and the corresponding convergence rates C t for ψ and Φ in Example 5 for various values of β when T = 1 .
Table 14. Numerical errors L ∞ and the corresponding convergence rates C t for ψ and Φ in Example 5 for various values of β when T = 1 .
δ t β = 0.7 β = 0.9
ψ Φ ψ Φ
L ∞ C t L ∞ C t L ∞ C t L ∞ C t
1 / 10 5.648 e − 02 − 8.002 e − 03 − 5.664 e − 02 − 7.941 e − 03 −
1 / 20 3.155 e − 02 0.840 4.521 e − 03 0.824 3.154 e − 02 0.845 4.469 e − 03 0.829
1 / 40 1.687 e − 02 0.904 2.454 e − 03 0.881 1.682 e − 02 0.907 2.419 e − 03 0.886
1 / 80 8.809 e − 03 0.937 1.315 e − 03 0.900 8.766 e − 03 0.940 1.294 e − 03 0.902
1 / 160 4.571 e − 03 0.946 7.146 e − 04 0.880 4.544 e − 03 0.948 7.032 e − 04 0.880
1 / 320 2.396 e − 03 0.932 4.059 e − 04 0.816 2.379 e − 03 0.933 3.999 e − 04 0.815
1 / 640 1.293 e − 03 0.889 2.493 e − 04 0.703 1.283 e − 03 0.891 2.461 e − 04 0.700
1 / 1280 7.385 e − 04 0.809 1.704 e − 04 0.549 7.321 e − 04 0.810 1.687 e − 04 0.545
Table 15. Numerical errors for ψ and Φ at various final times and fractional orders β , with δ t = 1 / 1000 , for Example 5.
Table 15. Numerical errors for ψ and Φ at various final times and fractional orders β , with δ t = 1 / 1000 , for Example 5.
β T ψ Φ
L ∞ L 2 RMS L ∞ L 2 RMS
0.25 0.5 2.019 e − 04 9.306 e − 05 9.538 e − 05 3.469 e − 05 1.654 e − 05 1.695 e − 05
1.0 9.033 e − 04 4.005 e − 04 4.105 e − 04 1.946 e − 04 9.135 e − 05 9.363 e − 05
1.5 1.220 e − 02 5.241 e − 03 5.372 e − 03 2.945 e − 03 1.339 e − 03 1.373 e − 03
0.50 0.5 2.017 e − 04 9.294 e − 05 9.526 e − 05 3.464 e − 05 1.652 e − 05 1.693 e − 05
1.0 8.996 e − 04 3.988 e − 04 4.088 e − 04 1.938 e − 04 9.097 e − 05 9.324 e − 05
1.5 1.118 e − 02 4.801 e − 03 4.921 e − 03 2.684 e − 03 1.221 e − 03 1.252 e − 03
0.75 0.5 2.016 e − 04 9.293 e − 05 9.525 e − 05 3.453 e − 05 1.647 e − 05 1.688 e − 05
1.0 8.923 e − 04 3.956 e − 04 4.055 e − 04 1.921 e − 04 9.019 e − 05 9.245 e − 05
1.5 9.451 e − 03 4.053 e − 03 4.155 e − 03 2.250 e − 03 1.024 e − 03 1.049 e − 03
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.