International Journal of Differential Equations

Volume 2015, Article ID 580741, 7 pages

http://dx.doi.org/10.1155/2015/580741

## Numerical Solution of Riccati Equations by the Adomian and Asymptotic Decomposition Methods over Extended Domains

^{1}Department of Applied Mathematics, Faculty of Mathematical Sciences, University of Guilan, P.O. Box 41335-1914, Rasht, Iran^{2}Department of Mathematics, Rasht Branch, Islamic Azad University, P.O. Box 41335-3516, Rasht, Iran^{3}Department of Mathematics, Guilan Science and Research Branch, Islamic Azad University, Rasht, Iran

Received 8 July 2015; Accepted 27 August 2015

Academic Editor: Timothy R. Marchant

Copyright © 2015 Jafar Biazar and Mohsen Didgar. 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

We combine the Adomian decomposition method (ADM) and Adomian’s asymptotic decomposition method (AADM) for solving Riccati equations. We investigate the approximate global solution by matching the near-field approximation derived from the Adomian decomposition method with the far-field approximation derived from Adomian’s asymptotic decomposition method for Riccati equations and in such cases when we do not find any region of overlap between the obtained approximate solutions by the two proposed methods, we connect the two approximations by the Padé approximant of the near-field approximation. We illustrate the efficiency of the technique for several specific examples of the Riccati equation for which the exact solution is known in advance.

#### 1. Introduction

It is well known that the Riccati equation asfinds surprisingly many applications in physics and mathematics such as random processes, optimal control, and diffusion problems [1]. In fact, the Riccati equation naturally arises in many fields of quantum mechanics, such as in quantum chemistry [2], the Wentzel-Kramers-Brillouin approximation [3], and super symmetry theories [4]. In addition, the Riccati equation plays a prominent role in variational calculus [5], nonlinear physics [6], renormalization group equations for coupling constants in quantum field theories [7, 8], and thermodynamics [9]. It is well known that one-dimensional static Schrödinger equation is closely related to the Riccati equation. Solitary wave solutions of a nonlinear partial differential equation can be expressed as a polynomial in two elementary functions satisfying a projective Riccati equation [10]. Beside important engineering and scientific applications that are well known, the newer applications include areas such as mathematical finance [11, 12].

Adomian and his coauthors have presented a systematic methodology for practical solution of linear or nonlinear and deterministic or stochastic operator equations, including algebraic equations, ordinary differential equations, partial differential equations, and integral and integrodifferential equations [13–18]. Adomian decomposition method is a powerful technique, which provides efficient algorithms for analytic approximate solutions and numerical simulations for real-world applications in the applied sciences and engineering. Using the ADM, we calculate a series solution, but, in practice, we approximate the solution by a truncated series. The series sometimes coincides with the Taylor expansion of the exact solution in the neighborhood of the point . Although the series can be rapidly convergent in a small region, it has a slower convergence rate in the wider region.

Several investigators have proposed a variety of approaches to solve the Riccati equation, approximately [19–24]. In order to obtain the global approximate solution of the Riccati equation, we combine the Padé approximant of the near-field approximation as derived from the ADM with the far-field approximation as derived from the AADM [25–28] to overcome the difficulty of a finite domain of convergence. Adomian introduced a variation of his decomposition method in [25] that can be used to obtain the asymptotic value of solutions. In this method, the recursion is the same as that in the ADM, but it uses a different canonical form of the differential equation such that it yields to a steady state solution of the equation. In fact, rather than nested integrations as in decomposition, we have nested differentiations, which will be expounded later. Haldar and Datta [29] applied the AADM to calculate integrals neither expressible in terms of elementary functions nor adequately tabulated.

This paper is arranged as follows. In the next section, we present a brief review of the ADM for nonlinear IVPs. In Section 3, we present a description of the AADM for solving the Riccati equation. In Section 4, we investigate several numerical examples. In Section 5, we present our conclusions and summarize our findings.

#### 2. Review of the Adomian Decomposition Method

We review the salient features of the Adomian decomposition method in solving IVPs for first-order nonlinear ordinary differential equations aswhere the functions , , and are analytic.

We rewrite (2) in Adomian’s usual operator-theoretic formwhere and then , , and . Next we rewrite (3) asand we apply the integral operator to both sides of (4):where since . In the case of a first-order ordinary differential equation, we have . ThereforeFor the sake of simplicity, we define the function as , and then, upon substitution, we obtainIn the ADM, the solution is represented by a series; sayand the nonlinearity comprises the Adomian polynomialswhereis called an Adomian polynomial, which were first defined by Adomian [13] asFor convenient reference, we list the first five Adomian polynomials

Several algorithms for the Adomian polynomials have been developed by Rach [30, 31], Adomian and Rach [32], Wazwaz [33], Biazar et al. [34], and several others. New, efficient algorithms with their subroutines written in Mathematica for rapid computer-generation of the Adomian polynomials have been provided by Duan in [35–37].

From (7)–(9) the solution components are determined by the classic Adomian recursion scheme:Thus the -term approximation as obtained from the ADM can serve as the near-field approximation of the solution , where is in the neighborhood of the initial point .

We remark that the convergence of the Adomian decomposition series has been previously proven by several researchers [30, 38–41]. For example, Abdelrazec and Pelinovsky [41] have recently published a rigorous proof of convergence for the ADM in accordance with the Cauchy-Kovalevskaya theorem.

#### 3. Description of Adomian’s Asymptotic Decomposition Method

In this section, we advocate Adomian’s asymptotic decomposition method for solving the Riccati equation. We remark that Adomian’s asymptotic decomposition method does not need use of the initial condition to obtain the asymptotic solution or the solution in the large, which is another, convenient advantage in computations using this technique. Rather than nested integrations as required by decomposition, we now have nested differentiations. In effect our aim is to solve for the solution by not inverting the linear differential operator , but instead by decomposing the nonlinear operator and hence determining the asymptotic solution . Toward this end, we rewrite (1) asFor the case when the coefficient , we can divide both sides of (14) by , and we haveSubstituting the respective decomposition series (i.e., and ), we obtainfrom which we design the asymptotic recursion schemeWe note that the Adomian polynomials for the quadratic nonlinearity areUsing the form of the Adomian polynomials in (19), we rewrite the recursion schemes (17) and (18) asIn view of (21) and after appropriate manipulations, we obtainConsequently, with this result, the solution components are given by the following recursion scheme:Thus the obtained -terms asymptotic approximation for the Riccati equation can serve as the far-field approximation, where is far from the initial point .

#### 4. Numerical Examples

In this section, several numerical examples are given to illustrate the efficiency of our technique as presented in this paper. We remark that all calculations are performed by Mathematica package 8.

*Example 1. *Consider the following Riccati equation:subject to initial condition .

The exact solution is known in advance to beIn Adomian’s operator notation, we havewhere , , and .

To apply Adomian decomposition method, equation (26) should be written as the following,Applying the inverse operator to both sides yieldsNext we consider the solution as a series and the nonlinearity , and upon substitution, we obtainThe components of the series solution are given by the recursion schemeThe first few components are as follows:The partial sums of the Adomian decomposition series can serve as a near-field approximate solution.

Solving (26) by Adomian’s asymptotic decomposition method, we first rewrite it asNext we assume the series and the nonlinearity .

Upon substitution and using the form of the Adomian polynomials in (19), we obtain the solution components of the far-field approximation according to the recursion scheme (23)from which we conclude that is the slant asymptote of the exact solution; that is, .

Computation shows that this Adomian decomposition series has a finite radius of convergence. By plotting the curves of and for several values of and , we do not find any regions of overlap. In this case, we connect the two approximations by the Padé approximant of or simply replace by its Padé approximant and then match the Padé approximant with . For example, we investigate and . The curves of the near-field approximation , the far-field approximation , and the exact solution are plotted in Figure 1.

We calculated the Padé approximant by Mathematica and found that the Padé approximant and the far-field approximation overlap in the approximate region ; see Figure 2. Thus we can match them aswhich is a global approximation, where belongs to the region of overlap and is the unit step function; that is,