`Advances in Mathematical PhysicsVolume 2014 (2014), Article ID 758195, 7 pageshttp://dx.doi.org/10.1155/2014/758195`
Research Article

## Iterative Multistep Reproducing Kernel Hilbert Space Method for Solving Strongly Nonlinear Oscillators

1Department of Mathematics, Faculty of Science, The University of Jordan, Amman 11942, Jordan
2Department of Science, Faculty of Science, Princess Sumaya University for Technology, Amman 11941, Jordan
3Nonlinear Analysis and Applied Mathematics (NAAM) Research Group, Faculty of Science, King Abdulaziz University, Jeddah 21589, Saudi Arabia
4Department of Mathematics, Faculty of Science, Al Balqa Applied University, Salt 19117, Jordan

Received 26 March 2014; Revised 21 May 2014; Accepted 22 May 2014; Published 17 June 2014

Copyright © 2014 Banan Maayah et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

#### Abstract

A new algorithm called multistep reproducing kernel Hilbert space method is represented to solve nonlinear oscillator’s models. The proposed scheme is a modification of the reproducing kernel Hilbert space method, which will increase the intervals of convergence for the series solution. The numerical results demonstrate the validity and the applicability of the new technique. A very good agreement was found between the results obtained using the presented algorithm and the Runge-Kutta method, which shows that the multistep reproducing kernel Hilbert space method is very efficient and convenient for solving nonlinear oscillator’s models.

#### 1. Introduction

Nonlinear oscillators have several applications in many fields of physics, engineering, and biology [14]. In general, nonlinear oscillator’s problems are sometimes too complicated to be solved exactly, so several numerical methods are proposed by many authors such as harmonic balance method, multiple scale method, Adomian decomposition method, homotopy perturbation method, homotopy analysis method, and differential transform method. The reader is kindly requested to go through [517] in order to know more details about these methods, including their history, their kinds and types, their modification for use, their scientific applications, and their characteristics.

Reproducing kernel theory has important applications in numerical analysis, differential equations, integral equations, integrodifferential equations, and probability and statistics [1820]. Recently, a lot of research work has been devoted to the applications of RKHS method for wide classes of stochastic and deterministic problems involving operator equations, differential equations, integral equations, and integrodifferential equations. The RKHS method was successfully used by many authors to investigate several scientific applications side by side with their theories. The reader is kindly requested to go through [2132] in order to know more details about RKHS method, including its history, its modification for use, its scientific applications, its kernel functions, and its characteristics.

The new algorithm is a simple modification of the RKHS method, for finding approximate solutions to the linear and nonlinear oscillator’s equations in large intervals. It is found that the corresponding RKHS method is valid only for short intervals, but, by using multistep RKHS method, more valid and accurate solutions over large intervals can be obtained. The new method has the following characteristics; first, it is of global nature in terms of the solutions obtained as well as its ability to solve other mathematical, physical, and engineering problems; second, it is accurate, needs less effort to achieve the results, and is developed especially for the nonlinear case; third, in the proposed method, it is possible to pick any point in the interval of integration and as well the approximate solutions will be applicable; fourth, the method does not require discretization of the variables, and it is not affected by computation round-off errors and one is not faced with necessity of large computer memory and time; fifth, the proposed approach does not resort to more advanced mathematical tools; that is, the algorithm is simple to understand and implement and should be thus easily accepted in the mathematical and engineering application’s fields.

This paper is comprised of four sections including the Introduction. In Section 2 we describe the multistep RKHS method. In Section 3 we present four examples to show the efficiency and simplicity of the method. The conclusions are given in Section 4.

#### 2. Multistep Reproducing Kernel Hilbert Space Method

In functional analysis, the RKHS is a Hilbert space of functions in which pointwise evaluation is a continuous linear functional. Equivalently, they are spaces that can be defined by reproducing kernels. In this section, we utilize the reproducing kernel concept to construct two reproducing kernel Hilbert spaces and to find out their representation of reproducing functions for solving second-order oscillator equation via RKHS technique.

Let us consider the following second-order nonlinear oscillator equation: subject to the initial conditions , .

Definition 1. Let be a Hilbert space of function on a set . A function is a reproducing kernel of if the following are satisfied. Firstly, for all . Secondly, for all for all .

Remark 2. The last condition in Definition 1, called “the reproducing property,” means that the value of the function at the point is reproduced by the inner product of with .

It is worth mentioning that the reproducing kernel of a Hilbert space is unique, and the existence of is due to the Riesz representation theorem, where completely determines the space . Moreover, every sequence of functions which converges strongly to a function in converges also in the pointwise sense. This convergence is uniform on every subset on on which is bounded. In this occasion, these spaces have wide applications including complex analysis, harmonic analysis, quantum mechanics, statistics, and machine learning. Subsequently, the space is constructed in which every function satisfies the initial conditions , and then utilized the space . For the theoretical background of reproducing kernel Hilbert space theory and its applications, we refer the reader to [1820].

Definition 3 (see [21]). A Hilbert space of functions on a nonempty abstract set is called a reproducing kernel Hilbert space if there exists a reproducing kernel of .

Definition 4 (see [24]). The inner space are absolutely continuous real-valued functions on , , and , , where the inner product and the norm in are defined, respectively, by and in which .
The space is a reproducing kernel if, for each fixed and any , there exist , such that .

Theorem 5 (see [23]). The space is a reproducing kernel and its reproducing kernel function can be written as where .

Definition 6 (see [21]). The inner product space is defined as is absolutely continuous real-valued function on , where the inner product and the norm in are defined, respectively, by and in which .

Theorem 7 (see [21]). The Hilbert space is a complete reproducing kernel and its reproducing kernel function can be written as

Reproducing kernel functions possess some important properties such as being symmetric, unique, and nonnegative. The reader is asked to refer to [1832] in order to know more details about reproducing kernel functions, including their mathematical and geometric properties, their types and kinds, and their applications and method of calculations.

In order to apply the proposed algorithm of multistep RKHS easily, we need to homogenize the initial conditions and . To do so, let ; then, (1) can be formulated in new form as follows: subject to the initial conditions , , where . Anyhow, define the operator such that . Hence, (4) can be converted into the equivalent form depending on (4) as where , and .

Now, we construct an orthogonal function system of the space . For a countable dense set of , let and where is the reproducing kernel space of and is the adjoint operator of . The orthonormal system of can be derived from the Gram-Schmidt orthogonalization process of : where are orthogonalization coefficients given as , , and for   in which , , and are the orthonormal system in .

Theorem 8. If is dense on , then is the complete system of and . The subscript by the operator indicates that the operator applies to the function of .

Theorem 9. If is dense on and the solution is unique on , then the solution of (5) is given by and the solution of (1) satisfies the form

Here, the approximate solution can be obtained by taking finitely many terms in the series representation of and . Also, since is a Hilbert space, it is clear that . Therefore, the sequence is convergent in the norm.

The major aim of this work is to find the approximate solution to (1). Next, we utilize the multistep RKHS procedure; to do so, we consider the nonlinear initial value problem (IVP) of (1). Indeed, let be the interval over which we want to find the solution of the IVP (1). Assume that the interval is divided into subintervals , , of equal step size , by using the nodes . Firstly, we apply the RKHS method to the following IVP: , , to obtain the approximate solution , . For and at each subinterval , we will use the initial conditions and and then apply the RKHS method over the interval . The process is repeated and generates a sequence of approximate solutions , as follows:where and .

The spaces and are complete Hilbert with some special properties. So, all the properties of the Hilbert space will hold. Further, these spaces possess some special and better properties which could make some problems be solved easier. For instance, many problems studied in space, which is a complete Hilbert space, require large amount of integral computations and such computations may be very difficult in some cases. Thus, the numerical integrals have to be calculated at the cost of losing some accuracy. However, the properties of and require no more integral computation for some functions, instead of computing some values of a function at some nodes. In fact, this simplification of integral computation not only improves the computational speed, but also improves the computational accuracy.

#### 3. Numerical Examples and Graphical Results

Numerical techniques are widely used by scientists and engineers to solve their problems. A major advantage for numerical techniques is that a numerical answer can be obtained even when a problem has no analytical solution. However, result from numerical analysis is an approximation, in general, which can be made as accurate as desired. Because a computer has a finite word length only a fixed number of digits are stored and used during computation. In order to demonstrate the applicability and effectiveness of the proposed algorithm, four examples will be solved numerically in this section.

Example 1. Consider the following linear oscillators equation: , subject to the initial conditions , . The exact solution is .

In this example, we apply the proposed algorithm on the interval and choose to divide the interval into subintervals with time step size . In fact, assume that the interval is divided into 15 subintervals , , of equal step size . Anyhow, we apply RKHS method with in each IVP:

The numerical results at some selected points in are given in Table 1, while, on the other aspect as well, Figure 1 shows that the results of our computations are in excellent agreement with the exact solution.

Table 1: Numerical results for Example 1.
Figure 1: (a) Plots of displacement of versus time: solid line the multistep RKHS method and dashed line exact solution. (b) Phase plane diagram of Example 1.

It is observed that the increase in the number of node results in a reduction in the absolute error and correspondingly an improvement in the accuracy of the obtained solution. This goes in agreement with the known fact; the error is monotone decreasing, where more accurate solutions are achieved using an increase in the number of nodes.

Example 2. Consider the following nonlinear oscillators equation: , subject to the initial conditions , .

In this example, we apply the proposed algorithm on the interval and choose to divide the interval to subintervals with time step size . Similarly, assume that the interval is divided into 150 subintervals , , of equal step size . Anyhow, we apply RKHS method with in each IVP:

Figure 2(a) shows that the results of our computations are in excellent agreement with the results obtained by the numerical solution of [11] using multistep differential transform method. In Figure 2(b) we give a comparison between the multistep RKHS method and RK method for the problem.

Figure 2: (a) Plots of displacement of versus time. (b) Phase plane diagram of Example 2: solid line the multistep RKHS method and dotted line RK method.

This procedure can be repeated till the arbitrary order coefficients of the multistep RKHS solution are obtained. Moreover, higher accuracy can be achieved by evaluating more components of the solution.

Example 3. Consider the following nonlinear oscillators equation: , subject to the initial conditions , .

In this example, we apply the proposed algorithm on the interval and choose to divide the interval to subintervals with time step size . In fact, assume that the interval is divided into 60 subintervals , , of equal step size . Anyhow, we apply RKHS method with in each IVP:

As in the last example, Figure 3(a) shows that the results of our computations are in excellent agreement with the results obtained by the numerical solution of [11] using multistep differential transform method. On the other hand, in Figure 3(b), we give a comparison between the multistep RKHS method and RK method for the problem.

Figure 3: (a) Plots of displacement of versus time. (b) Phase plane diagram of Example 3: solid line the multistep RKHS method and dashed line RK method.

Example 4. Consider the following nonlinear oscillators equation: , subject to the initial conditions , .
In this example, we apply the proposed algorithm on the interval and choose to divide the interval to subintervals with time step size . Similarly, assume that the interval is divided into 100 subintervals , , of equal step size . Anyhow, we apply RKHS method with in each IVP:
As a result, Figure 4(a) shows that the results of our computations are in excellent agreement with the results obtained by the numerical solution of [11] using multistep differential transform method. Anyhow, in Figure 4(b), we give a comparison between the multistep RKHS method and RK method for the problem.

Figure 4: (a) Plots of displacement of versus time. (b) Phase plane diagram of Example 4: solid line the multistep RKHS method and dashed line RK method.

#### 4. Conclusions

In this study, a new algorithm is proposed for finding a numerical solution of linear and nonlinear oscillators, namely, multistep reproducing kernel Hilbert space method. The main characteristic feature of the multistep RKHS method is that the global approximation can be established on the whole solution domain, in contrast with other numerical methods like one step and multistep methods, and the convergence is uniform. Indeed, the present method is accurate, needs less effort to achieve the results, and is especially developed for nonlinear case. On the other aspect as well, the derivatives of the approximate solutions are also uniformly convergent. Comparison results between multistep RKHS method solution and RK method are discussed; the results show that this method is accurate for solving this kind of equations.

#### Conflict of Interests

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

#### References

1. L. Dai and R. N. Jazar, Nonlinear Approaches in Engineering Applications, Springer, New York, NY, USA, 2012.
2. S. Strogatz, Nonlinear Dynamics and Chaos: With Applications to Physics, Biology, Chemistry, and Engineering, Perseus Books, Cambridge, Mass, USA, 1994.
3. A. H. Nayfeh, Perturbation Methods, John Wiley & Sons, New York, NY, USA, 1973.
4. A. H. Nayfeh and D. T. Mook, Nonlinear Oscillations, John Wiley & Sons, New York, NY, USA, 1979.
5. M. Ghadimi and H. D. Kaliji, “Application of the harmonic balance method on nonlinear equations,” World Applied Sciences Journal, vol. 22, no. 4, pp. 532–537, 2013.
6. F. Lakrad and M. Belhaq, “Periodic solutions of strongly non-linear oscillators by the multiple scales method,” Journal of Sound and Vibration, vol. 258, no. 4, pp. 677–700, 2002.
7. N. Movasaghi and H. Kheiri, Application of Adomian Decomposition Method to Nonlinear Oscillators, World Scientific and Engineering Academy and Society, 2009.
8. S. Momani, G. H. Erjaee, and M. H. Alnasr, “The modified homotopy perturbation method for solving strongly nonlinear oscillators,” Computers & Mathematics with Applications, vol. 58, no. 11-12, pp. 2209–2220, 2009.
9. M. Zurigat, S. Momani, and A. Alawneh, “The multi-step homotopy analysis method: a powerful scheme for handling non-linear oscillators,” Iranian Journal of Science & Technology, vol. 37, no. 3, pp. 421–429, 2013.
10. O. Abu-Arqub, A. El-Ajou, S. Momani, and N. Shawagfeh, “Analytical solutions of fuzzy initial value problems by HAM,” Applied Mathematics & Information Sciences, vol. 7, no. 5, pp. 1903–1919, 2013.
11. V. S. Ertürk, Z. M. Odibat, and S. Momani, “The multi-step differential transform method and its application to determine the solutions of non-linear oscillators,” Advances in Applied Mathematics and Mechanics, vol. 4, no. 4, pp. 422–438, 2012.
12. S. Momani, “Analytical approximate solutions of nonlinear oscillators by the modified decomposition method,” International Journal of Modern Physics C, vol. 15, no. 7, pp. 967–979, 2004.
13. J. Langari and M. Akbarzade, “The he's amplitude-frequency formulation for solving strongly nonlinear oscillators differential equations,” Advanced Studies in Theoretical Physics, vol. 5, no. 5–8, pp. 343–348, 2011.
14. J. I. Ramos, “An artificial parameter-decomposition method for nonlinear oscillators: Applications to oscillators with odd nonlinearities,” Journal of Sound and Vibration, vol. 307, no. 1-2, pp. 312–329, 2007.
15. A. Ebaid, S. Momani, S. H. Chang, and M. Aljoufi, “On the periodic solutions of the nonlinear oscillators,” Journal of Vibroengineering, vol. 16, no. 1, pp. 1–15, 2014.
16. B. Soltanalizadeh, “Differential transformation method for solving one-space-dimensional telegraph equation,” Computational & Applied Mathematics, vol. 30, no. 3, pp. 639–653, 2011.
17. B. Soltanalizadeh and A. Hajihosseini, “A new efficient technique for the numerical computation of the linear Boussinesq equation,” Wulfenia Journal, vol. 19, no. 8, pp. 123–137, 2012.
18. A. Berlinet and C. Thomas-Agnan, Reproducing Kernel Hilbert Spaces in Probability and Statistics, Kluwer Academic Publishers, Boston, Mass, USA, 2004.
19. M. Cui and Y. Lin, Nonlinear Numerical Analysis in the Reproducing Kernel Space, Nova Science, New York, NY, USA, 2009.
20. A. Daniel, Reproducing Kernel Spaces and Applications, Springer, 2003.
21. F. Geng and M. Cui, “Solving a nonlinear system of second order boundary value problems,” Journal of Mathematical Analysis and Applications, vol. 327, no. 2, pp. 1167–1181, 2007.
22. Y. Li, F. Geng, and M. Cui, “The analytical solution of a system of nonlinear differential equations,” International Journal of Mathematical Analysis, vol. 1, no. 9-12, pp. 451–462, 2007.
23. M. Cui and F. Geng, “Solving singular two-point boundary value problem in reproducing kernel space,” Journal of Computational and Applied Mathematics, vol. 205, no. 1, pp. 6–15, 2007.
24. E. Gao, S. Song, and X. Zhang, “Solving singular second-orderinitial/boundary value problems in reproducing Kernel Hilbert space,” Boundary Value Problems, vol. 2012, article 3, 2012.
25. N. Shawagfeh, O. Abu Arqub, and S. Momani, “Analytical solution of nonlinear second-order periodic boundary value problem using reproducing kernel method,” Journal of Computational Analysis and Applications, vol. 16, no. 4, pp. 750–762, 2014.
26. O. Abu Arqub, M. Al-Smadi, and S. Momani, “Application of reproducing kernel method for solving nonlinear Fredholm-Volterra integrodifferential equations,” Abstract and Applied Analysis, vol. 2012, Article ID 839836, 16 pages, 2012.
27. O. A. Arqub, M. Al-Smadi, and N. Shawagfeh, “Solving Fredholm integro-differential equations using reproducing kernel Hilbert space method,” Applied Mathematics and Computation, vol. 219, no. 17, pp. 8938–8948, 2013.
28. M. Al-Smadi, O. Abu Arqub, and S. Momani, “A computational method for two-point boundary value problems of fourth-order mixed integrodifferential equations,” Mathematical Problems in Engineering, vol. 2013, Article ID 832074, 10 pages, 2013.
29. M. Al-Smadi, O. Abu Arqub, and A. El-Ajuo, “A numerical method for solving systems of first-order periodic boundary value problems,” Journal of Applied Mathematics, vol. 2014, Article ID 135465, 10 pages, 2014.
30. O. Abu Arqub, “An iterative method for solving fourth-order boundary value problems of mixed type integro-differential equations,” Journal of Computational Analysis and Applications. In press.
31. S. Bushnaq, S. Momani, and Y. Zhou, “A reproducing kernel Hilbert space method for solving integro-differential equations of fractional order,” Journal of Optimization Theory and Applications, vol. 156, no. 1, pp. 96–105, 2013.
32. S. Bushnaq, B. Maayah, S. Momani, and A. Alsaidi, “A reproducing Kernel Hilbert space method for solving systems of fractional integro-differential equations,” Abstract and Applied Analysis, vol. 2014, Article ID 103016, 6 pages, 2014.