Abstract

In this work, the initial-boundary value problems for one-dimensional linear time-dependent Schrödinger parabolic and pseudoparabolic partial differential equations are studied. The modified double Laplace decomposition method is applied to get the semianalytic solutions and the explicit finite difference method to get the approximate solutions of the problems. The von Neumann stability analysis of the presented problems is also investigated.

1. Introduction

The parabolic partial differential equations (PPDEs) take place in several areas of applied mathematics, for instance in the heat diffusion equation and in fluid mechanics [1]. Pseudoparabolic partial differential equations (PPPDEs) arise in modelling various phenomena, such as diffusion, heat conduction, thermoelectricity, chemical engineering, subsurface water flow, population dynamics, and plasma physics [2]. Several analytical approximation methods have been structured to treat such problems. For instance, the modified double Laplace decomposition method (MDLDM) has been used to solve the singular one-dimensional PPPDE with initial conditions by Gadain [3]. Ilhan et al. [4] constructed a family of travelling wave solutions to the nonlinear PPPDEs utilizing the modified exponential function method. In [5], the authors employed the variational iteration method with He’s polynomials to solve a coupled PPPDE. A three-layer finite difference scheme (FDS) to a linear PPPDE with a delay has been dealt by Amirali and Gabil [6]. In [7], Yang has studied a finite volume element approximation of PPPDEs in three spatial dimensions. Singh et al. [8] solved approximately the two-dimensional diffusion equation with Dirichlet boundary conditions using an Euler matrix method. The authors in [9] studied a nonlinear PPPDE with initial and Dirichlet boundary conditions using spectral discretization in space. Huntul et al. [10] solved the inverse initial-Neumann boundary value problem for a third-order PPPDE using the CB-spline collocation method. In [11], the researcher used a finite time blow-up criterion to solve a semilinear PPPDE. The Jacobi pseudospectral method has been used to solve numerically the two-dimensional linear heat diffusion equations subject to the Neumann and Robin boundary conditions by Yang et al. [12].

The famous time-dependent one-dimensional linear Schrödinger partial differential equation (SPDE) in quantum physics is known as,where is the imaginary number, is Planck’s constant, and and represent the wave function and the potential function, respectively. Equation (1) has been reformulated by the use of the path integral approach considering the Gaussian probability distribution by Feynman and Hibbs [13].

In this work, an initial-boundary value problem for one-dimensional time-dependent linear Schrödinger parabolic and pseudoparabolic partial differential equation in the domain is considered as follows:where and are known sufficiently smooth functions, which may be complex-valued. Equation (2) is referred to as a Schrödinger parabolic partial differential equation (SPPDE) when , and as a Schrödinger pseudoparabolic partial differential equation (SPPPDE) when .

The MDLDM will be employed to find the semianalytic solution of problem (2). Many researchers consider it to be one of the best integral transforms. Jaradat et al. [14] used a Laplace–Adomian decomposition method (LADM) to obtain the semianalytical solution to the nonlinear SPDE with a harmonic oscillator in one and two dimensions. A nonlinear SPDE has been solved utilizing a double Laplace decomposition method by Gündoğdu and Ömer F [15]. The combination of the double Laplace transform and the Adomian decomposition method is called MDLDM.

On the other hand, the approximate solution of problem (2) will be obtained using the explicit FDS. Ghafouri et al. [16] have applied FDS to find the approximate solution of SPDE in a nanoscale side-contacted field effect diode. For solving multidimensional coupled damped Schrödinger systems in Bose–Einstein condensates, Oruç [17] used the radial basis function-FDS approach. The accuracy of FDS for the smooth solutions of SPDEs has been proven by Li et al. [18]. In [19], linear SPDE has been solved by the Sinc–Galerkin and Sinc collocation methods. The approximate solution of the cubic nonlinear SPDE in one and two dimensions has been achieved using the Haar wavelet collocation method in combination with the Crank–Nicolson scheme by Pervaiz and Imran [20]. Subaşi has proposed three distinct FDSs for the numerical solution of two-dimensional SPDE [21]. Fairweather and Khebchareon [22] have presented numerical methods for solving linear and nonlinear SPDE in one and various space variables. Lehtovaara et al. [23] have used the imaginary time propagation method to obtain the eigenvalues and eigenvectors of large matrices originating from the discretization of linear and nonlinear SPDEs. In [24], the authors have solved the Schrödinger eigenvalue equation by the imaginary time propagation technique using splitting methods with complex coefficients.

The paper is organized as follows. In Section 2, some information about the double Laplace transform is given. In Section 3, the MDLDM is explained with two examples to get the semianalytic solution for problems of type (2). In Section 4, the explicit FDS for problem (2) is described and the stability is proved. In Section 5, numerical examples are presented. In Section 6, the paper ends with a brief conclusion.

2. Preliminaries on Double Laplace Transform

Some important definitions and theorems of the double Laplace transform are given which are used further in this work.

Definition 1. Let us assume , a function of two variables and . The double Laplace transform of is defined by the following double improper integral:where and are complex numbers and and .

Definition 2. The inverse double Laplace transform of is defined as follows:where and are large enough that is defined for the real parts of and .

Definition 3. A function is said to be exponential order and on , if there exists a nonnegative constant such that .

Theorem 1. If is of an exponential order and a piecewise continuous function on and , then its double Laplace transform exists for and .

Theorem 2. Let and , there exist such that

Then, the following formulas yield:

3. Modified Double Laplace Decomposition Method

In this section, the MDLDM will be constructed to solve the following initial-boundary value problem for one-dimensional time-dependent linear SPPPDE in the domain ,with the following initial and boundary conditions:

Firstly, the double Laplace transform with respect to and is applied to both sides of (7), and the following is obtained:

In the next step, using the linearity and the differentiation properties of the double Laplace transform to equation (9), we obtain,where and symbolize the double Laplace transforms of and , respectively.

The LADM is used to define the solution of one-dimensional time-dependent linear SPPPDE by the infinite series as follows:

After this step, by applying the inverse double Laplace transform to both sides of equation (10) and using equation (11), as well as the linearity of the inverse transform, it holds,

From equation (12), the following recursive relationship can be acquired:

Finally, the resulting components are substituted into the decomposition series for , and then the required solution is obtained. Equations (13) and (14) are called the MDLDM of .

3.1. Applications of the Method

We will now analyze some examples to demonstrate the applicability of the MDLDM for solving the one-dimensional time-dependent linear SPPPDEs and SPPDEs.

Example 1. We consider the following initial-boundary value problem for a one-dimensional linear time-dependent SPPPDE:On applying the double Laplace transform to system (15) with respect to and , the following is obtained:When both sides of equation (16) are transformed with the inverse double Laplace transform, the result is as follows:Putting the expansion (11) into equation (17), it leads to the following:If both sides of equation (18) are compared, we get the following recursive relation:Using the above mentioned recursive relation, the other components are given as follows:The noise terms and between the components and can be taken away, and system (15) is still satisfied by the remaining term of . As a result, the required solution is given by,For the SPPDE of system (15), that is, , the same solution has been obtained.

Example 2. Consider the following initial-boundary value problem for a one-dimensional linear time-dependent SPPPDE:Using the steps mentioned in the previous example, the following components are obtained:Thus, the desired solution is as follows:For the SPPDE of system (22), we obtain the same solution.

4. Finite Difference Scheme and Its Stability

4.1. Construction of the FDS

Let . For some nonnegative integers and , the uniformly grid steps are introduced as,

The values of the function at the grid points are represented as .

In order to construct an explicit FDS, is approximated by the forward Euler scheme and the two derivatives and by the backward Euler scheme. Because the solution is assumed to be smooth enough, the following three-layer explicit FDS at any point can be written as follows:

Ignoring discretization errors of order , the explicit FDS for the SPPPDE of problem (2) can be written as,

However, the explicit FDS for the SPPDE of problem (2) can be obtained as,where and .

4.2. Stability and Convergence of the FDM

The von Neumann analysis will be used to investigate the stability of the two explicit FDSs (27) and (28). We start with the following usual assumption:

Inserting (29) into scheme (27) with supposing and , the following is obtained:

After several transformations, equation (30) becomes just a quadratic equation for the amplification factor , namely,

And we obtain,where and are the solutions of equation (31). It can be concluded from inequalities (32) and (33) that and , and follows that explicit FDS (27) is unconditionally stable.

In the same way, the stability of scheme (28) is verified, and we obtain the following:

So, explicit FDS (28) is stable at , unconditionally unstable at , and marginally stable at .

5. Numerical Experiments

In this part, the explicit FDM is applied to solve the algebraic systems (15) and (22). MATLAB code is presented in the Appendix. To analyze the error between the obtained analytical and approximate solutions, we use,

We have shown that the analytic solution of system (15) is as follows:and of system (22) is as follows:

We ran multiple simulations with different input parameters to compare the approximate and analytical solutions to quantitatively demonstrate the accuracy and efficiency of our schemes. The analytical solution was approximated using the MDLDM, while the approximate solution was approximated using the explicit FDS. The error analysis between the two solutions for systems (15) and (22) is shown in Tables 1 and 2, respectively.

Figures 1 and 2 show a comparison of the profile evolution of the analytical and approximate solutions for systems (15) and (22), respectively.

Since the exact solutions obtained for the mentioned systems did not contain the parameter , then the graph of the analytic solution does not change as the value of changes.

6. Conclusion

In this study, the initial-boundary value problems for one-dimensional linear time-dependent SPPPDE and SPPDE are discussed. The semianalytic and approximate solutions for the SPPPDE and SPPDE of problem (2) were obtained using MDLDM and explicit FDS, respectively. The von Neumann stability analysis of the submitted problems was investigated. The abovementioned tables and figures indicate that the values of have an impact on the solutions.

Appendix

MATLAB code

1clc; clear all; close all;2% 1D time-dependent linear Schrodinger pseudo-parabolic PDE in the domain [0, pi] x [0, pi]3% iut = Alpha utxx + uxx + f(t, x), 0t, x < pi4% f(t, x) = [(i + Alpha) cost + sint]sinx5% Initial condition u(0, x) = 0, 0 ≤ x <= pi6% Boundary conditions u(t, 0) = u(t, pi) = 0, 0 ≤ t<= pi7% Approximate solution by using explicit FDS8N = 70;9M = 90;10Alpha = 0.001;11h = pi/M;12tau = pi/N;13a = (Alpha/(tau (h^2)));14r = (−Alpha/(tau (h^2))−(1/(h^2)));15b = 0;16c = (−complex (0, 1)/tau + 2/(h^2)−2 Alpha/(tau (h^2))); % complex (0, 1) represents the imaginary number i17d = (complex (0, 1)/tau + 2 Alpha/(tau (h^2)));18for i = 2: N + 1;19A (i, i−1) = a;20A (i, i) = r;21end; A;22C = A;23for i = 2: N + 1;24K (i, i−1) = b;25end;26for i = 2: N + 1;27K (i, i) = c;28end;29for i = 2: N;30K (i, i + 1) = d;31end;32K (1, 1) = 1;33for i = 1: N + 1;34D (i, i) = 1;35end;36D;37% Finding fii (j);38for j = 1: M + 1;39x = (j−1) h;40fii (1, j: j) = 0; % Initial condition of the given problem41for k = 2: N + 1;42t = tau (k);43fii (k, j:j) = ((Alpha + complex (0, 1)) cos(t) + sin(t)) sin(x); % The given function f(t, x)44end;45end;46alpha (N + 1, N + 1, 1 : 1) = 0;47beta (N + 1, 1 : 1) = 0;48for j = 1: M−1;49alpha (:,:,j + 1: j + 1) = inv (K + C alpha(:,:,j:j)) (−A);50beta (:,j + 1: j + 1) = inv (K + C alpha(:,:,j:j)) (D fii(:,j:j)-C beta(:,j:j));51end;52U (N + 1, 1, M : M) = 0;53for z = M−1:−1:1;54U (:,:, z:z) = alpha (:,:,z + 1: z + 1) U (:,:,z + 1: z + 1) + beta (:,z + 1: z + 1);55end;56for z = 1: M;57app (:, z + 1: z + 1) = U(:,:, z:z);58end;59% Analytic solution;60for j = 1: M + 1;61for k = 1: N + 1;62x = (j−1) h;63t = tau (k−1);64ex (k, j: j) = sin(t) sin(x);65end;66end;67ex;68% Absolute error analysis;69maxes = max (max (abs (ex)));70maxapp = max (max (abs (app)));71maxerror = max (max (abs (ex−app)));72relativeerror = maxerror/maxapp;73Answer = [maxes, maxapp, maxerror, relativeerror]74% Plotting exact and approximate solutions separately;75[Xs, Ts] = meshgrid (0: h: pi, 0: tau: pi);76table = [ex; app];77table (1 : 2: end,:) = ex;78table (1 : 2: end,:) = app;79q = min (min (table));80 = max (max (table));81figure; surf (Xs, Ts, abs (ex)); title (‘Exact Solution’);82set (gca, ‘ZLim’, [q w]); rotate3d; xlabel (‘x’); ylabel (‘t’);83figure; surf (Xs, Ts, abs (app)); title (‘Approximate Solution’);84set (gca, ‘ZLim’, [q w]); rotate3d; xlabel (‘x’); ylabel (‘t’)

Data Availability

No data were used to support this study.

Conflicts of Interest

The authors declare that they have no conflicts of interest.