Abstract

On the basis of sampling approximation for a function defined on a bounded interval by combining Coiflet-type wavelet expansion and technique of boundary extension, a space-time fully decoupled formulation is proposed to solve multidimensional Schrödinger equations with generalized nonlinearities and damping. By applying a wavelet Galerkin approach for spatial discretization, nonlinear Schrödinger equations are first transformed into a system of ordinary differential equations, in which all matrices are completely independent of time and never need to be recalculated in the time integration. Then, the classical fourth-order explicit Runge–Kutta method is used to solve the resulting semidiscretization system. By studying several widely considered test problems, results demonstrate that when a relatively fine mesh is adopted, the present wavelet algorithm has a much better computational accuracy and efficiency than many existing numerical methods, due to its higher order of convergence in space which can go up to 6.

1. Introduction

The time-dependent Schrödinger equation with nonlinear potential functions is one of the most important mathematical models in modern science due to its wide applications in many different fields, such as nonlinear optics, plasma physics, and semiconductor industry [15]. The present study considers the three-dimensional generalized nonlinear Schrödinger equation (GNLSE) [637]with the initial conditionand the Dirichlet boundary conditionIn (1)–(3), is the complex unit, with vector is a complex-valued unknown function, is the Laplace operator, and , , , and are known real functions for and . In GNLSE (1), the external potential is a given real function, whose specific form is dependent on different problems. For example, it is usually chosen as either a harmonic confining potential , or an optical lattice potential with constants , , and , for studying the Bose–Einstein condensation [5, 26]. The nonlinearities and which are real-valued smooth functions with respect to the density are determined by the specific application. Note that, in this study, the most popular nonlinear term with constant [110] has been extended to the general form which can be chosen as arbitrary function as needed, such as , , , and , where , and are real constants [26, 36]. Moreover, the general damping term which is usually ignored in many studies [816, 1825, 2734] is also considered in GNLSE (1), because the damping effect may play an important role and should not be ignored in some physical processes [7, 17, 26, 35, 36], such as the inelastic collisions in Bose–Einstein condensation [7, 26].

Because of the broad applications of GNLSE (1), developing accurate and efficient numerical methods for solving such equations has attracted considerable research attention in the past few years. For instance, Mohebbi and Dehghan [15] studied two-dimensional linear Schrödinger equations by using a compact boundary value method with fourth-order accuracy in both space and time. Liao et al. [16] applied a fourth-order compact difference scheme to solve the two-dimensional linear Schrödinger equation without damping term. In order to save cost on computation, the finite difference schemes combining with the alternating direction implicit method are developed to study the multidimensional Schrödinger equations [1820, 23, 24, 30, 34]. In such algorithms, handling multidimensional problems is transformed into solving a series of one-dimensional problems by introducing intermediate variables. Moreover, many other numerical methods are also proposed to solve multidimensional Schrödinger equations, such as the collocation method [21, 22, 27, 33], the Galerkin method [27, 31], and the mesh-free methods [25, 31, 32]. The above methods are effective for solving Schrödinger equations under certain conditions. However, many of them will encounter severe difficulties in uniformly solving the three-dimensional generalized nonlinear Schrödinger equation (1). For example, the time-splitting methods need to obtain the density by solving analytically a nonlinear differential equation [7, 8, 21, 26], which is an extremely difficult task for general damping term . And when the classical collocation method [25] and Galerkin type method [32] are employed to solve directly the nonlinear Schrödinger equation, the matrices generated in the spatial discretization of nonlinear terms will be dependent on the time-dependent unknown vector and must be recalculated at each time step [25, 32, 38], thereby consuming considerable computing resources. Because such repeated recalculations of matrices from the spatial discretization of nonlinear term can be regarded as reperforming the spatial discretization at each time step [38], these methods [25, 27, 32] cannot divide the solution procedure into two completely separate processes, that is, the spatial discretization and the time integration. Therefore, the decoupling between spatial and temporal discretizations in these methods [25, 27, 32] is incomplete [38].

In the current work, a space-time fully decoupled formulation by combining a wavelet Galerkin technique and the classical fourth-order explicit Runge–Kutta method is proposed to uniformly solve the three-dimensional generalized nonlinear Schrödinger equation (1). In such a space-time fully decoupled wavelet formulation, all matrices generated in the spatial discretization of the nonlinear partial differential equation (1) are constant matrices and need not to be updated in the subsequent time integration. In addition, a systematic comparison between the present solutions and those obtained by using many existing numerical methods is conducted by solving several widely considered test problems.

2. Sampling Approximation of an Interval-Bounded -Function

Based on the theory of wavelet based multiresolution analysis, a set of scaling bases for three-dimensional space can be directly obtained by the tensor products of one-dimensional wavelet bases [39, 40]. Therefore following our previous work [4144], a function can be approximated aswhere , , and are the decomposition level, respectively, in the , , and directions, and the modified one-dimensional wavelet basis [4144]withIn (5), is the generalized Coiflet-type orthogonal scaling function with first-order moment and number of vanishing moments of the corresponding wavelet function, which is developed by Wang [41]. In addition, the functionsin which coefficients and of numerical differentiation are determined by matrices ,  , , and with subscripts .

Since the sampling approximation (4) is valid for all functions , for arbitrary nonlinear operator holding , by treating as a new function and applying (4), we havewhich provides the foundation for conducting a space-time fully decoupled formulation [38].

3. Solution of the Generalized Nonlinear Schrödinger Equation

At the beginning of the solution to the three-dimensional generalized nonlinear Schrödinger equation (1), by introducing , where and are real-valued functions, we rewrite it into two coupled time-dependent nonlinear partial differential equationsin which and .

Following the wavelet approximations (4) and (8), the unknown functions , nonlinear terms and , and terms and can be expressed as

Substituting (10)–(14) into (9), then multiplying both sides of the resulting equation by ,  ,  , and , respectively, and performing integration over the domain , one can obtain a series of ordinary differential equations. Considering boundary conditions (3), these ordinary differential equations can be written intoin which vectors , , , matrices , , and subscripts , , , , , , and . In (15) and (16), vector operational rules and will always hold for vectors and , and the generalized connection coefficient can be exactly and readily obtained without numerical integral but based on the database independent of the specific problems [38]. In addition, the vector determined by boundary conditions can be expressed aswith

Note that in the semidiscretization system (15) of the three-dimensional generalized nonlinear Schrödinger equation (1), both of and are constant matrices, which are completely independent of the unknown vector and time . Thus, in subsequent time integration for solving nonlinear ordinary differential equations (15), no matrix generated from spatial discretization needs updating, implying that full decoupling between spatial and temporal discretizations is achieved in the present wavelet algorithm.

Since the Coiflet scaling function holds the orthogonality, following definition (5) of wavelet basis , one can obtain the relation for or . Therefore, when the decomposition level , the symmetrical matrix is almost a diagonal matrix with only nonzero elements located in positions, whose distribution pattern is shown in Figure 1 when . Thus, the computational cost for estimating the inverse matrix of matrix is not very high. Moreover, considering the Coiflet scaling function with the compact support , there is the relation for . Therefore, is a banded matrix with bandwidth for the decomposition level . Therefore, the computational complexity of the proposed wavelet method is acceptable.

Finally, one can obtain an approximate solution of GNSE (1) by employing a time integration scheme to solve the nonlinear ordinary differential equations (15). In this study, the classical fourth-order explicit Runge–Kutta method is adopted, and then we havein which , and is the time step. Iteratively applying (19) and directly using the initial condition (2), one can obtain the unknown vector at each time step, which can be used to reconstruct the approximate solution based on scheme (10).

4. Numerical Examples

In this section, we use several numerical examples to demonstrate the accuracy and applicability of the proposed wavelet method for solving two- and three-dimensional generalized nonlinear Schrödinger equations (1).

To effectively evaluate the performance of numerical solutions, we introduce the error norms and , and the corresponding convergence rates in space and , which are, respectively, defined by [9, 18, 20, 23]in which and are the numerical and exact solutions, respectively, and is the number of grid points in space. To make the convergence rates and estimated by (22) being spatial convergence rates, a time step small enough to guarantee that the errors mainly come from the spatial discretization is adopted in the following computation.

Example 1. Consider the two-dimensional linear Schrödinger equation with trapping potential [6, 10, 18, 24]with the initial and boundary conditions extracted from its exact solution . Figure 2 shows the error norm of the present wavelet solution at time under for various numbers of grid points in space , as well as those obtained by using the Peaceman-Rachford alternating direction implicit method (PR-ADI) [6, 18], semidiscrete high-order compact scheme (SD-HOC) [10, 18], high-order compact alternating direction implicit method (HOC-ADI) [18], and the linearized compact alternating direction implicit method (L-HOC-ADI) [24].

Example 2. We consider the two-dimensional cubic nonlinear Schrödinger equation [34]subjected to the initial and boundary conditions extracted from the exact solution . In Table 1, we list the error norms of numerical solutions at time under achieved, respectively, from the proposed wavelet method, and the higher order compact alternating direction implicit method (HOC-ADI) [34].

Example 3. Consider the two-dimensional Gross-Pitaevskii Equation [28]with , and the initial and Dirichlet boundary conditions extracted from the exact solution . Figure 3 shows the error norm of numerical solutions at time under obtained by using the present wavelet method, the fourth-order nonlinear compact and energy conservative difference scheme (FONCECD) [28], and the fourth-order linearized compact and energy conservative difference scheme (FOLCECD) [28].

Example 4. We consider the two-dimensional nonlinear Schrödinger equation [9, 23, 24, 34].which has the exact solution . Figure 4 plots the error norms of the present wavelet solutions with as a function of the number of grid points in space , as well as those obtained by using the split-step finite difference method (SSFD) [9], HOC-ADI [23, 34], linearized alternating direction implicit scheme (L-ADI) [24], L-HOC-ADI [24], and CCD-PRADI [34].

Example 5. Consider the two-dimensional nonlinear Schrödinger equation with dampingsubjected to the initial and boundary conditions extracted from the exact solution . The error norms of the present wavelet solutions at time and 3 under various space-time meshes are listed in Table 2.

Example 6. Consider the following two-dimensional nonlinear Schrödingerwith the initial condition and boundary condition extracted from the exact solution . Table 3 shows the spatial convergence of the present wavelet solutions at time and 3.

Example 7. We consider the three-dimensional nonlinear Schrödinger equation [9].whose exact solution is . In Table 4, we make a comparison of the error norm between the present wavelet solutions and those achieved from SSFD [9].

It can be seen from Tables 14 and Figures 24 that the proposed space-time fully decoupled wavelet Galerkin method has a good accuracy, efficiency, and stability. Moreover, these results also demonstrate that its order of convergence in space can go up to 6. In addition, we can see from the comparisons shown in Figures 24 and Tables 14 that when a relatively fine mesh is adopted, the present wavelet solutions have a much better numerical accuracy than those obtained by many other existing numerical methods, including PR-ADI [6, 18], SD-HOC [10, 18], HOC-ADI [18, 23, 34], L-HOC-ADI [24], FONCECD [28], FOLCECD [28], SSFD [9], and L-ADI [24].

5. Conclusion

In this study, we introduced a sampling approximation for a function defined on a three-dimensional domain by combining Coiflet-type wavelet expansion and technique of boundary extension. On the basis of such a wavelet approximation, a space-time fully decoupled wavelet Galerkin is proposed to solve uniformly the multidimensional generalized nonlinear Schrödinger equation with damping, in which all matrices generated from the spatial discretization of nonlinear partial differential equations are completely independent of time and need not be updated in the time integration. By solving seven widely considered test problems, the present wavelet algorithm shows considerably high precision and fast convergence rate in space compared with many other existing numerical methods.

Conflicts of Interest

The authors declare that they have no conflicts of interest.

Acknowledgments

This research is supported by grants from the National Natural Science Foundation of China (11502103, 11421062), the Fundamental Research Funds for the Central Universities (lzujbky-2015-178), and the Open Fund of State Key Laboratory of Structural Analysis for Industrial Equipment (GZ15115).