#### Abstract

Based on He’s variational iteration method idea, we modified the fractional variational iteration method and applied it to construct some approximate solutions of the generalized time-space fractional Schrödinger equation (GFNLS). The fractional derivatives are described in the sense of Caputo. With the help of symbolic computation, some approximate solutions and their iterative structure of the GFNLS are investigated. Furthermore, the approximate iterative series and numerical results show that the modified fractional variational iteration method is powerful, reliable, and effective when compared with some classic traditional methods such as homotopy analysis method, homotopy perturbation method, adomian decomposition method, and variational iteration method in searching for approximate solutions of the Schrödinger equations.

#### 1. Introduction

In the past decades, due to the numerous applications of fractional differential equations (FDEs) in the areas of nonlinear science [1], many important phenomena can be described successfully using the FDEs models such as materials and processes [2], engineering and physics [3], dielectric polarization [4], and quantitative finance [5]. Searching for solutions of these FDEs plays an important and significant role in all aspects of this subject. But because of the complexity of nonlinear terms and fractional derivative, it is very difficult for us to obtain the exact analytic solutions of most FDEs, so approximate and numerical methods must be considered. A great deal of efforts have been proposed for these problems, like the homotopy analysis method (HAM) [6], the homotopy perturbation method (HPM) [7], the adomian decomposition method (ADM) [8], the generalized differential transform method [9], and so forth [10].

The variational iteration method (VIM) established in 1999 by He in [11] is thoroughly used by many researchers to construct the approximate solutions of a wide variety of scientific and engineering models [12, 13]. After some modifications, the fractional variational iteration method (FVIM) was applied to fractional differential equations by He and many authors [1419]. The motivation of this paper is to construct some analytical approximate solutions for the GFNLS powerfully. Firstly, we give some modifications for the FVIM and extend the application of the FVIM. Secondly, we use the modified fractional variational iteration method (MFVIM) to the GFNLS and compare the efficiency of MFVIM with some other traditional perturbation methods. The results show that MFVIM gives rapid and standard convergence to the exact solution if such a solution exists.

We give some basic definitions and properties of the fractional calculus theory which are used further in this paper; we define the following fractional integral and derivatives [20, 21].

Definition 1. A real function is said to be in the space , where , , if there exists a real number such that , where and it is said to be in the space if and only if , .

Definition 2. The Riemann-Liouville fractional integral operator of order for a function , , is defined as follows: Also one has the following properties:

Definition 3. For , , and , the Caputo fractional derivative operator of order on the whole space is defined as follows:
Also one has the following properties:

#### 2. Analysis of the MFVIM and the FGNLS

Consider the following generalized time and space fractional nonlinear Schrödinger equation with variable coefficients [22, 23]: where , , , is the trapping potential, and , are the slowly increasing dispersion coefficient and nonlinear coefficient, respectively. If we select , , this equation turns to the famous nonlinear Schrödinger equations in optical fiber [2426].

According to the FVIM [1419], we can build a correction functional for (5) as follows: with the initial condition , where is a general Lagrange’s multiplier which can be identified optimally with the variational theory. The function is a restricted variation which means . Therefore, we first determine the Lagrange multiplier that will be identified optimally via integration by parts [27]. The successive approximations , , of the solution will be readily obtained through and any selective function . The initial values are usually used for choosing the zeroth approximation . With determined, then several approximations , follow immediately. Consequently, the exact solution may be procured by using . The convergence of FVIM has been proved in [28]. In this paper, notice that (5) is a complex differential equation with complex modulus term , as we all know, a complex function can be written as , where and are real functions, noticed that , we can give some modification for the iteration formulation (6), assume that , we get the MFVIM for (5). This modification should enhance rapidly the efficiency of our iteration.

In what follows, in order to illustrate the strength of this method, we will apply the MFVIM to some models about (5).

#### 3. Approximate Solutions for the FGNLS

Example 4. We first consider the time-fractional NLS equation [29]: The correction functional for (7) reads Making the above correction functional stationary, After getting the coefficients of to zero we can determine the Lagrange multiplier We produce the iteration formulation as follows: As stated before, we can select ; using the iteration (11) and the mathematica software, we obtain the following successive approximations: The exact solution of (7) is where is the Mittag-Leffler function. If we let in (13), the exact solution of the regular NLS equation (7) can be obtained as follows:

Example 5. We now consider the time-space fractional NLS equation [30, 31]: With the similar process, we get the iteration formulation as follows: Using the iteration (16) and the mathematica software, we obtain the following successive approximations: The exact solution of (15) is If we let and let in (18), the exact solution of the regular NLS equation (15) can be obtained as follows:

Remark 6. The solution (18) is more standard than the result (3.18) in [30]. If one selects or , the solution (19) is the same as the result (49) in [29], the result (3.21) in [30], and the result (29) in [31], but one can find that this iteration is much more standard and powerful than the HAM, the ADM, and the VIM mentioned in [2931].

Example 7. Consider the following time-space fractional NLS equation [23]: With the similar process, we get the iteration formulation as follows: If we select , using the iteration (21) and the mathematica software, we obtain the following successive approximations: where , , , and , , ; , ; , , ; .
The exact solution of (20) is If we let and let in (23), the exact solution of the regular NLS equation (20) can be obtained as follows. If we select , with the same process, we can also obtain the following exact solution of (20):

Remark 8. If one selects , the solution (23) is more standard than the result (5.10) in [23]. The solutions (23) and (25) are new exact solutions for (20) to our knowledge.

Comparisons between the real part of some numerical results and the exact solution (23) are summarized in Tables 1 and 2, and the simulations for , , and are plotted in Figures 1 and 2, which shows that the MFVIM produced a rapidly convergent series.

#### 4. Summary

In this paper, the MFVIM is used for finding approximate and exact solutions of the GFNLS equation with Caputo derivative. The obtained results indicate that the MFVIM is effective, convenient, and powerful method for solving nonlinear fractional complex differential equations when comparing it with some other traditional asymptotic decomposition methods such as HAM, VIM, and ADM. We believe that these methods should play an important role for finding exact and approximate solutions in the mathematical physics.

#### Conflict of Interests

The authors declare that there is no conflict of interests regarding the publication of this paper.

#### Acknowledgments

This paper is supported by the National Nature Science Foundation of China (no. 61070231); the Outstanding Personal Program in Six Fields of Jiangsu (2009188); and the General Program of Innovation Foundation of NanJing Institute of Technology (Grant no. CKJB201218).