#### Abstract

Singularity problem exists in various branches of applied mathematics. Such ordinary differential equations accompany singular coefficients. In this paper, by using the properties of reproducing kernel, the exact solution expressions of dual singular problem are given in the reproducing kernel space and studied, also for a class of singular problem. For the binary equation of singular points, I put it into the singular problem first, and then reuse some excellent properties which are applied to solve the method of solving differential equations for its exact solution expression of binary singular integral equation in reproducing kernel space, and then obtain its approximate solution through the evaluation of exact solutions. Numerical examples will show the effectiveness of this method.

#### 1. Introduction

Singular problems exist in various branches of applied mathematics. The coefficients of one or some of the items in a given interval are of no significance at some point. It is difficult to solve the singular boundary value problems in the numerical calculation, and the classical numerical methods are not able to get a better numerical approximation. Based on the reproducing kernel space, it gives an extract solution expression by using the properties of reproducing kernel.

Generally, reproducing kernel theory can be divided into two aspects. On the one hand produced in integral theory, then the nuclear is considered as the definite integral operator continuous kernel. This theory is initiated by Mercer [1] in the term of “positive definite kernel,” which is equated by other scholars interested in references in the 1920s. Mercer found that continuous nuclear of positive definite integral equation has the following properties:

In the 1930s, E. H. Moore also found the same nature. He discussed the kernel function which is defined in the abstract set with property (1) and is used in the generalized integral equation in the analysis of “definite Hermitian Matrix” term. He proved that for every positive definite Hermitian matrix corresponding to a family of functions forms the Hilbert space which has the inner product , and the nuclear in this space has the property of reproducibility

Such a discovery connects two kinds of views of reproducing kernel, and this theory has also been proposed by Bochner in the term of “positive definite function” [2].

On the other hand the reproducing kernel theory produced in the article on harmonic boundary value of the biharmonic function written by Zaremba. Zaremba [3] was the first one who introduced a nuclear corresponding to a family of functions in special cases and proved the reproducibility (2). Aronszajn summarized previous work in 1943 and formed the theory of reproducing kernel, including the formation of a special case of the Bergman kernel function of the system [4]. In 1970, Larkin [5] solved the problem of the optimal approximation rules of nuclear regeneration in the Hilbert function space. While Chawla and Kaul gave the other optimal approximation rules [6] with polynomial precision in the Hilbert function space in 1974. Since then, a large number of foreign scholars discussed the reproducing kernel problems [7], done a lot of research work [8], and created many of the reproducing kernel construction methods [9] and how to make use of the kernel function of regeneration solving equations. Chacaltana et al. [10] introduced quantum Hilbert space innovatively and set up the reproducing kernel in this space.

The domestic research in the field of reproducing kernel and its properties began in the 1980s, Cui et al. [11, 12]. His main study is reproducing kernel space approximation theory and numerical methods. He constructed a reproducing kernel space and its finite expressions and proved it is a reproducing kernel Hilbert space. In 1986, he made a more in-depth research in the space [13] and obtained the optimal interpolation approximation expression. Thereafter, Várady et al. [14] discussed the surface interpolation together in the space. Kineri et al. [15] gave his definition of reproducing kernel space in two-dimensional rectangular area . Jordan studied multivariate interpolation in the space [16], and gave a multivariate interpolation formula. That same year, she further addressed the problem of computing multivariate interpolation. Fasshauer and Ye [17] studied the best approximation of bounded linear operator in space. Boying [18] discussed the spline interpolation of differential operator in . Meanwhile, Cui also defines some of the other reproducing kernel space in which approximate linear operator equations is studied to solve the problem. In addition, Wu and Zhang [19] give the reproducing kernel space, and the operator equation was solved in this space. Mohammadi and Mokhtari also put forward a reproducing kernel space in the literature [20], obtained the expression of reproducing kernel by convolution, and presented the expressions of analytical solution and numerical solution of a high order partial differential equation. Arqub et al. [21] give the accurate solution of a class of integrodifferential equations in reproducing kernel space. In recent years, people began to discuss numerical solution of nonlinear operator equation in the reproducing kernel space. Wang et al. [22] discussed approximate nonlinear operator equation solving problems in the reproducing kernel space; the equation is

Here , , : are bounded linear operator. Eigenvalue method and the factorization method which are obtained by using the good nature of reproducing kernel are the two solutions of (3).

Reproducing kernel space gives the ideal space framework of numerical analysis problem; in this space there is a function which makes the function in the corresponding space demonstrate the reproducibility through the inner product, so for the numerical analysis of the basic value of operation, there is a continuous signal. This is why the domestic and foreign scholars have devoted much energy to study the theory of reproducing kernel. Precisely because the problem of discrete values can be continuously shown, various types of optimization of numerical problems become possible. In addition, the regeneration of nuclear technique, combined with other direction, has produced many new theories and algorithms, such as signal processing, stochastic processes processing, estimation theory, wavelet transform [23], reproducing kernel particle method, and others which have many improvement application examples. Obviously, such functional analysis tools have good qualities whether in establishing theoretical framework or in a numerical algorithm.

In this paper, first of all, transform the dual singular equation into nonsingular problems, and then use the method of solving differential equations to solve the nonsingular problem by using some excellent properties in reproducing kernel space, resulting in exact solution expression of binary singular equation, finally get the approximate solution through the exact solution evaluation. At the same time, the paper calculates the error of the approximate solution through numerical example; it turns out the proposed method has the feasibility and effectiveness.

#### 2. Theory Review

##### 2.1. The Definition of Reproducing Kernel Space and Reproducing Kernel Method

###### 2.1.1. Definition of Reproducing Kernel Space

is a unary real absolutely continuous function confined to , besides .For any , , define the inner product and norm as follows: For details about reproducing kernel space, see [23]; the space on the norm (5) is a complete inner product space.

###### 2.1.2. The Reproducing Kernel Solution of

Look at the function Let Then get In order to make

only make each formula of the above equations, respectively, denoted as: (10), (11), and (12).

By (10), when , there is ; the characteristic equation is , then .

So

For (10), integral to

Let , then get The two formulas of the above equations, respectively, denoted by (15) from (11), (12), (15) we can get

##### 2.2. The Definition and Basic Properties of Reproducing Kernel Space

For different equation, we will construct different reproducing kernel space according to the actual situation. The literature [23] has given some reproducing kernel space. Although these spaces have different definition, inner product and reproducing kernel function, their corresponding reproducing kernel function has the regeneration properties similar to (10). Take the reproducing kernel space for example; give its method of construction and its algorithm.

The definition of the reproducing kernel space is as follows:

Here , , is a unary real absolutely continuous function affiliated to , , .

For any , its inner product and norm are defined as follows:

Similar to literature [23], we can prove that the reproducing kernel space on norm (19) is a Hilbert space.

The algorithm

Tidy is as follows:

In order to make , just let

By (22), when , , the characteristic equation is , so

By (22) to know, when , is continues, when , , there is a Jump , so satisfies the following conditions:

Put (23) into concrete expansion:

Further to know

From (27) to (35), a total of 8 equations, we can use a mathematic software programming to work out . can be applied to reproducing kernel space , and then obtain the kernel function ; its expression is

##### 2.3. The Definition of and Its Reproducing Kernel Expression

The definition of is

Here is second order completely continuous on and , ,

Its inner product is

The norm is .

The reproducing kernel before and after the space , respectively is and .

*Proof. * is the reproducing kernel of .

The proof of renewable:
Fix , then and are absolutely continuous on , .

Proof is absolutely continuous, while is second order completely continuous on . And the following are established:

So the reproducing kernel may consist of the product of two Spaces.

The results obtained in Section 2.3 can be moved over to get the reproducing kernel of .

#### 3. Solution of the Dual Singular Equations

In this chapter, we will discuss the following singular equation in reproducing kernel space

Here, is the periphery of , . Under the assumption that (41) has a unique solution, we will give its exact solution representation and approximate solution.

##### 3.1. The Transformation of the Problem

Equation (41) can be converted into the solution of the following equation:

##### 3.2. Space Election

The selection of reproducing kernel space is as follows.

The left choice is

The right choice is Define the operator Denoted as , among them:

The following is the proof of boundedness. Proved : is bounded linear operator Proved : is bounded linear operator

*(1) First Proof*. For all , then

Let . In fact, and are completely continuous so is completely continuous; furthermore .

Since , , , and are all continuous.

So and and yield .

Similarly .

And because .

We can get from the continuous , .

Therefore, .

(2)* The Linearity of ** Is Obvious.* Next we prove is bounded. Namely, proof is as follows: for all

Actually,

Similarly to prove , , are linear bounded.

##### 3.3. Expression of the Solution

The solution of is unique.

Assume belongs to ; note , ,

Theorem 1. * is perfect in .*

*Proof. *For all satisfy .*The Certificate*. . In fact, .

So and since is injective, therefore .

Theorem 2. *The true solution of is
**Prove**The exact solution is .**The approximate solution is *

Then get the exact solution for entry truncation in order to, respectively, get the approximate solution expression on .

#### 4. Numerical Example Analysis

In this chapter we will use the previously mentioned methods to calculate a numerical example and use it to test the validity of the application; all operations are running under the environment of Mathematica 5.0 mathematical software. From the numerical results it can be seen that our method is very effective.

*Example 3. *Solve the following dual singular problem

Here is the boundary of . Exact solutions for the given equation are ; we select 36 points in the rectangular area and, respectively, let , . The graphics of exact solution and approximate solution are shown in Figures 1 and 3. In Figure 1, ; the curve of approximate solution is almost the same as that of the exact solution. In Figure 3, , we can tell the difference between the curve of the approximate solution and the exact solution . Figure 2 shows the absolute error of the approximate solution and the exact solution , when . And when . Figure 4 indicates the absolute error of the approximate solution and the exact solution .

#### 5. Conclusions

Singular equation problems have wide application in engineering technology and increasingly penetrated into many fields of social science. In practice, a growing number of math problems and engineering problems to be converted into solving the singular equation. Therefore, the solution to mathematics and physics problem is of great significance. This paper discussed the solution to binary singular exact solution in the regeneration space. We give the exact solution expression in series. At the same time, yield its approximate solution through the study of the truncation of series and prove that the error between the approximation solution and exact solution is monotone decreasing and that is the interpolation function of accompanying the interpolation nodal. We also give some numerical examples to verify the accuracy of our method, and it turns out that our method is simple and effective.

#### Conflict of Interests

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

#### Acknowledgments

The authors should say thanks to the support of Key Project of National Natural Science Foundation in China (nos. 71271069 and 91024028), National Key Technology R&D Program of the Ministry of Science and Technology (no. 2012BAH81F03), Applied Technology R&D Project in Heilongjiang Province (no. GC13D401), Humanities and Social Sciences Foundation of Chinese Ministry of Education (no. 10YJC860040), and National Soft Science Foundation in China (no. 2008GXS5D113).