#### Abstract

We provide in this study an effective finite element method of the Schrödinger equation with inverse square singular potential on circular domain. By introducing proper polar condition and weighted Sobolev space, we overcome the difficulty of singularity caused by polar coordinates’ transformation and singular potential, and the weak form and the corresponding discrete scheme based on the dimension reduction scheme are established. Then, using the approximation properties of the interpolation operator, we prove the error estimates of approximation solutions. Finally, we give a large number of numerical examples, and the numerical results show the effectiveness of the algorithm and the correctness of the theoretical results.

#### 1. Introduction

Schrödinger equation with the inverse square or centrifugal potential plays an important role in quantum mechanics, quantum cosmology, nuclear physics, molecular physics, and so on [1–8]. The potential has the same differential order as the Laplacian operator near the origin, which usually leads to strong singularities and cannot be treated as a lower-order perturbation term [9–14]. Li et al. [15] proposed an efficient finite element method to discuss the numerical solution of time-fractional Schrö dinger equations. Thus, we need to develop some new numerical methods to solve Schrödinger equation with inverse square singular potential.

In recent years, more and more attention has been paid to the numerical methods of the schrödinger equations with similar singular potential [1, 16–21]. However, many numerical methods are based on low-order finite element methods. If we solve these problems directly in two-dimensional domain, it will cost a lot of computing time and memory capacity to obtain high-precision numerical solutions [22–24]. In practice, we usually need to solve the Schrödinger equation with inverse square singular potential on circular domain. As far as we know, there are few reports on an effective numerical method for the Schrödinger equation with inverse square potential in circular domain. Thus, the purpose of this paper is to propose an effective finite element method of the Schrödinger equation with inverse square singular potential on circular domain. By introducing proper polar condition and weighted Sobolev space, we overcome the difficulty of singularity caused by polar coordinates transformation and singular potential and establish the weak form and corresponding discrete scheme based on the dimension reduction format. Then, using the approximation properties of interpolation operator, we prove the error estimates of approximation solutions. Finally, we give a large number of numerical examples, and the numerical results show the effectiveness of the algorithm and the correctness of the theoretical results [25, 26].

The rest of this paper is organized as follows. In Section 2, we derive an equivalent scheme based on variable separation. In Section 3, we prove the existence and uniqueness of the solution. In Section 4, we prove the error estimation of approximation solutions. In Section 5, we describe the details for an efficient implementation of the algorithm. In Section 6, we provide some numerical experiments to show the accuracy and efficiency of our algorithm. Finally, in Section 7, we give some concluding remarks.

#### 2. An Equivalent Scheme Based on Variable Separation

We are interested in studying the following Schrödinger equation with inverse square singular potential:where and with . Let , , and . Then, the Laplace operator in polar coordinates is as follows:

We can rewrite (1) and (2) as follows:

Since and are periodic in , then we havewhere and are the Fourier coefficients of and , respectively. We can derive from (3) and (6) that

To make (7) and (8) meaningful, we need introduce the following essential pole conditions:The pole condition (9) can be further reduced to

Using the orthogonal properties of Fourier basis functions and polar condition (10), we can reduce (4) and (5) to a series of equivalent one-dimensional Schrödinger equations as follows:where

#### 3. Existence and Uniqueness of the Solution

For convenience, we use the expression to mean that , where is a positive constant. In order to derive the weak form and corresponding discrete scheme of equations (11) and (12), we need to introduce the usual weighted Sobolev space:with the corresponding inner product and norm,and the nonuniformly weighted Sobolev space:with the corresponding inner product and norm,where is a weight function. Then, the weak form of equations (11) and (12) is to find , such thatwhere

Define approximation space , where is a piecewise linear interpolation polynomial space. Then, the corresponding discrete scheme of (18) is to find , such that

Lemma 1. * is a continuous and coercive bilinear functional on , i.e.,*

*Proof. *We derive from the Cauchy–Schwarz inequality that

Lemma 2. *If , then is a bounded linear functional on , i.e.,*

*Proof. *From Cauchy–Schwarz inequality, we have

This finishes our proof.

Theorem 1. *If , then problems (18) and (20) have unique solutions and , respectively.*

*Proof. *From Lemma 1, we havefor . That is, is a bounded and positive definite bilinear functional defined on . In addition, from Lemma 2, we havewhich means is a bounded linear functional defined on . Then, from Lax–Milgram lemma, we know that equations (18) and (20) have unique solutions and , respectively.

#### 4. Error Estimation of Approximation Solutions

In this section, we will present the error estimates of approximate solutions. Define the piecewise linear interpolation operator bywhere is the linear interpolation polynomial of on interval . Let

Then, from error formula of linear interpolating remainder term, we havewhere is a function depending on .

Theorem 2. *Let . Suppose that is smooth enough such that , where is a large enough constant() in Fourier transformation. Then, it holdswhere , .*

*Proof. *Sincethen we derive thatThen, we obtainThus, we derive that

The proof of Theorem 2 is complete.

Lemma 3. *For any , the following inequality holds:*

*Proof. *Since , then we haveThus, we derive that

Theorem 3. *Let and be the solutions of problems (18) and (20), respectively. Then, the following inequality holds:*

*Proof. *We derive from (18) and (20) thatThen, we haveWe derive from Lemma 1 and (40) thatThen, we obtainThen, we haveWe derive from Lemma 3 thatCombining with Theorem 2, we can obtain the desired result.

#### 5. Implementation of the Algorithm

To solve the discrete scheme (20), we need to construct a set of basis functions of approximation space. Letwhere . It is clear that

Set

Let

Substituting expression (48) into (20) and taking through all the basis functions in we obtain the following linear system:where

From the properties of the basis functions, we know that the stiff matrices and mass matrix in (49) are all tridiagonal sparse matrices.

#### 6. Numerical Experiments

We will perform some numerical tests in order to show the convergence and the effectiveness of our algorithm. We operate our programs in MATLAB 2015b.

Let be the approximation solution of exact solution .

By using the following polar coordinate transformation,we obtain

We define the error between the exact solution and the approximation solution as follows:

*Example 1. *We take , . It is clear that satisfies the boundary condition (2). The can be obtained by substituting into equation (1). Next, we solve problems (1) and (2) by using the algorithm proposed in this paper. We list the errors between exact solution and approximation solutions in Table 1 for different and . In order to further show the accuracy and convergence of our algorithm, we present the figures and their error figures of exact solution and approximation solution in Figures 1 and 2, respectively.

We observe from Table 1 that the error achieve about with and . In addition, we can see from Figures 1 and 2 that the numerical solution converges to exact solution with the decrease of .

**(a)**

**(b)**

**(a)**

**(b)**

*Example 2. *We take , and . It is obvious that satisfies the boundary condition (2). Similarly, can be obtained by substituting into equation (1). We list the errors between exact solution and approximation solutions in Table 2 for different and . In order to further show the accuracy and convergence of our algorithm, we present the figures and their error figures of exact solution and approximation solution in Figures 3 and 4, respectively.

We observe from Table 2 that the error achieves about with and . In addition, we can see from Figures 3 and 4 that the numerical solution converges to exact solution with the decrease of .

**(a)**

**(b)**

**(a)**

**(b)**

*Example 3. *We take , and . We list the errors between exact solution and approximation solutions in Table 3 for different and . We also present the figures and their error figures of exact solution and approximation solution in Figures 5 and 6, respectively.

We observe from Table 3 that the error achieves about with and . In addition, we can see from Figures 5 and 6 that the numerical solution converges to exact solution with the decrease of .

**(a)**

**(b)**

**(a)**

**(b)**

#### 7. Conclusions

We present in this paper an efficient finite element method for the Schrödinger equation with the inverse square potential on the circular domain. By using polar coordinate transformation and Fourier basis function expansion, we reduce the original problem into a series of equivalent one-dimensional problems. By introducing polar conditions, we overcome not only the difficulty brought by the singular potential but also the degree of freedom which is greatly reduced by dimension reduction. Thus, we only spend less computing time and memory capacity to obtain high-precision numerical solutions. Numerical results show that our algorithm is very effective. We mainly focus on, in this paper, the Schrödinger equation with the inverse square potential on the circular domain. In fact, we can extend our method to the Schrödinger equation with more complex potentials.

#### Data Availability

The data used to support the findings of this study are included within the article.

#### Conflicts of Interest

The authors declare that they have no conflicts of interest.

#### Acknowledgments

The research of Junying Cao was supported by NSFC (nos. 11901135 and 11961009) and Foundation of Guizhou Science and Technology Department (nos. [2020]1Y015 and [2017]1086).