Research  Open  Published:
The new modified Ishikawa iteration method for the approximate solution of different types of differential equations
Fixed Point Theory and Applicationsvolume 2013, Article number: 52 (2013)
Abstract
In this article, the new Ishikawa iteration method is presented to find the approximate solution of an ordinary differential equation with an initial condition. Additionally, some numerical examples with initial conditions are given to show the properties of the iteration method. Furthermore, the results of absolute errors are compared with Euler, RungeKutta and Picard iteration methods. Finally, the present method, namely the new modified Ishikawa iteration method, is seen to be very effective and efficient in solving different type of the problem.
MSC:65K15, 65L07, 65L06, 65L70.
Introduction
Various kinds of numerical methods, especially iterative methods [1–3], were used to solve different types of differential equations. In recent years, there has been a growing interest in the treatment of iterative approximation of fixed point theory on normed linear spaces [4–13], Banach spaces [14–18] and Hilbert spaces [19, 20], respectively.
A new modified Ishikawa iteration method has been developed to find an approximate solution for different types of differential equations with initial conditions [13, 15–29] on metric spaces. The solutions are also obtained in terms of the Picard iteration. Also in Section 2, examples of these kinds of equations are solved using this new method which is called new modified Ishikawa iteration method and also the results are discussed and comparison using Euler [1, 2], RungeKutta [30, 31], and Picard iteration methods [1, 2, 27] is presented in tables and figures. Additionally, this approximated method can solve various different differential equations such as integral, difference, integrodifferential and functional differential equations. Finally, numerical results shows that the new modified Ishikawa iteration method is more or less effective and also convenient for solving different types of differential equations.
Now, let us give some of the important theorems and definitions in order to solve linear and nonlinear differential equations using a contraction mapping.
1 Preliminaries
Theorem 1.1 (Banach contraction principle)
Let $(X,d)$ be a complete metric space and $T:X\to X$ be a contraction with the Lipschitzian constant L. Then T has a unique fixed point $u\in X$. Furthermore, for any $x\in X$ we have
with
(see [13]).
Proof We first show uniqueness. Suppose there exist $x,y\in X$ with $T(x)=x$ and $T(y)=y$. Then
therefore $d(x,y)=0$.
To show existence select, $x\in X$. We first show that $\{{T}^{n}(x)\}$ is a Cauchy sequence. Notice for $n\in \{0,1,\dots \}$ that
Thus, for $m>n$ where $n\in \{0,1,\dots \}$,
That is, for $m>n$, $n\in \{0,1,\dots \}$,
This shows that $\{{T}^{n}(x)\}$ is a Cauchy sequence and since X is complete, there exists $u\in X$ with ${lim}_{n\to \mathrm{\infty}}{T}^{n}(x)=u$. Moreover, the continuity of T yields
therefore u is a fixed point of T. Finally, letting $m\to \mathrm{\infty}$ in (1.1) yields
□
Corollary 1.2 Let $(X,d)$ be a complete metric space and let $B({x}_{0},r)=\{x\in X:d(x,{x}_{0})<r\}$, where ${x}_{0}\in X$ and $r>0$. Suppose $T:B({x}_{0},r)\to X$ is a contraction (that is, $d(T(x),T(y))\le Ld(x,y)$ for all $x,y\in B({x}_{0},r)$ with $0\le L<1$) with $d(T({x}_{0}),{x}_{0})<(1L)r$. Then T has a unique fixed point in $B({x}_{0},r)$ (see [13]).
Definition 1.3 If the sequence ${\{{x}_{n}\}}_{n=0}^{\mathrm{\infty}}$ provides the condition ${x}_{n+1}=T{x}_{n}$ for $n=0,1,2,\dots $ , then this is called the Picard iteration [1, 27].
Definition 1.4 Let ${x}_{0}\in X$ be arbitrary. If the ${\{{x}_{n}\}}_{n=0}^{\mathrm{\infty}}$ sequence provides the condition
for $n=0,1,2,\dots $ , then this is called the Ishikawa iteration [16, 24] where $({\alpha}_{n})$ and $({\beta}_{n})$ are sequences of positive numbers that satisfy the following conditions:

(i)
$0\le {\alpha}_{n}\le {\beta}_{n}<1$, for all positive integers n,

(ii)
${lim}_{n\to \mathrm{\infty}}{\beta}_{n}=0$,

(iii)
${\sum}_{n\ge 0}{\alpha}_{n}{\beta}_{n}=\mathrm{\infty}$.
Definition 1.5 If $\lambda \in [0,1]$, $\gamma \in [0,1]$ and ${y}_{0}\in X$, T is defined as a contraction mapping with regard to Picard iteration and also the ${\{{y}_{n}\}}_{n=0}^{\mathrm{\infty}}$ sequence provides the conditions
then this is called a new modified Ishikawa iteration where $T={\int}_{{x}_{0}}^{x}F(t,{y}_{n}(t))\phantom{\rule{0.2em}{0ex}}dt$.
In order to illustrate the performance of the new modified Ishikawa iteration method in solving linear and nonlinear differential equations and justify the accuracy and efficiency of the method presented in this paper, we consider the following examples. In all examples, we used four types of iteration methods and the comparison is shown in figures and tables respectively.
2 Application of methods
Example 2.1 Let us consider the differential equation ${y}^{\prime}=\sqrt{y}$ subject to the initial condition $y(0)=1$.
Firstly, we obtained the exact solution of the equation as $y=\frac{1}{4}{(x+2)}^{2}=1+x+\frac{{x}^{2}}{4}$.
By Theorem 1.1 and Corollary 1.2, since $T={\int}_{{x}_{0}}^{x}F(t,{y}_{n}(t))\phantom{\rule{0.2em}{0ex}}dt$, then
So, $T(x)T(y)\le \frac{2}{3}xy$ is found. Thus T has a unique fixed point, which is the unique solution of the integral equation $T={\int}_{{x}_{0}}^{x}F(t,{y}_{n}(t))\phantom{\rule{0.2em}{0ex}}dt$ or the differential equation ${y}^{\prime}=\sqrt{y}$, $y(0)=1$.
Firstly, we approach the approximate solution using by the Picard iteration method. Thus
are obtained. If we take the series expansion of the function ${(x+1)}^{3/2}$ for the seven terms, then ${y}_{2}=1+x+\frac{{x}^{2}}{4}+\frac{{x}^{3}}{24}+\frac{{x}^{4}}{64}+\frac{{x}^{5}}{128}+\frac{7{x}^{6}}{1536}$ is found. Now, applying the new modified Ishikawa iteration method to the equation for $\lambda =0.5$, $\gamma =0.5$,
are found and also for $\lambda =0.5$, $\gamma =0.25$,
are obtained. On the other hand, for $\lambda =0.25$, $\gamma =0.5$,
are calculated. In the same way, for $\lambda =0.25$, $\gamma =0.25$,
are found and also for $\lambda =0.75$, $\gamma =0.25$,
are obtained. Similarly, for $\lambda =0.25$, $\gamma =0.75$,
are calculated. Finally, for $\lambda =0.75$, $\gamma =0.75$,
are obtained.
Now we calculate the approximate solution by the Euler method. At first we use the formula
with $F(x,y)=\sqrt{\mid y\mid}$, $h=0.2$ and ${x}_{0}=0$, ${y}_{0}=1$. From the initial condition $y(0)=1$, we have $F(0,1)=1$. We now proceed with the calculations as follows:
Finally, applying the RungeKutta method to the given initial value problem, we carry out the intermediate calculations in each step to give figures after the decimal point and round off the final results at each step to four such places. Here $F(x,y)=\sqrt{y}{x}_{0}=0$, ${y}_{0}=1$ and we are to use $h=0.2$. Using these quantities, we calculated successively ${k}_{1}$, ${k}_{2}$, ${k}_{3}$, ${k}_{4}$ and ${K}_{0}$ defined by
and ${K}_{0}=\frac{1}{6}({k}_{1}+2{k}_{2}+2{k}_{3}+{k}_{4})$, ${y}_{n+1}={y}_{n}+{K}_{0}$. Thus we find ${k}_{1}$, ${k}_{2}$, ${k}_{3}$, ${k}_{4}$ for $n=0$ as follows:
So, ${y}_{1}=1.209999565$ is obtained for ${x}_{1}=0.2$. On the other hand, we calculated ${k}_{1}$, ${k}_{2}$, ${k}_{3}$, ${k}_{4}$ for $n=1$ as follows:
Hence ${y}_{2}=1.4399999194$ is calculated for ${x}_{2}=0.4$. Finally we get ${k}_{1}$, ${k}_{2}$, ${k}_{3}$, ${k}_{4}$ for $n=2$ as follows:
Thus, ${y}_{3}=1.689999654$ is obtained for ${x}_{3}=0.6$.
After the necessary calculation which is done above, the comparison is shown schematically in Figure 1.
On the other hand, we may give Table 1, Table 2, Table 3 and Table 4 using the modified Ishikawa iteration method for different values of λ and γ. Now we may give Table 5 which is expressed that absolute error of Example 2.1 for different values of λ and γ with $x=0.2$, $x=0.4$ and $x=0.6$ respectively.
Corollary 2.1 If we compare the approximate solution with the different values of λ and γ, then the conclusion may be indicated using Table 1, Table 2, Table 3 and Table 4 as follows.
The best approximation is obtained taking the different values of λ and γ and using the new modified Ishikawa iteration method for $x=0.2$, $x=0.4$ and $x=0.5$ getting ($\lambda =0.25$, $\gamma =0.25$; $\lambda =0.5$, $\gamma =0.25$; $\lambda =0.25$, $\gamma =0.5$; $\lambda =0.75$, $\gamma =0.25$; $\lambda =0.5$, $\gamma =0.5$; $\lambda =0.25$, $\gamma =0.75$; $\lambda =0.75$, $\gamma =0.75$) respectively.
Similarly, we calculated the solution for $x=0.6$, $x=1$ and $x=1.5$ then the approximation is found more sensitive taking ($\lambda =0.25$, $\gamma =0.25$; $\lambda =0.5$, $\gamma =0.25$; $\lambda =0.25$, $\gamma =0.5$; $\lambda =0.75$, $\gamma =0.25$; $\lambda =0.5$, $\gamma =0.5$; $\lambda =0.25$, $\gamma =0.75$; $\lambda =0.75$, $\gamma =0.75$) respectively.
Corollary 2.2 Absolute error of the modified Ishikawa iteration method is computed taking different values of λ and γ ($x=0.2$, $x=0.4$ and $x=0.6$), which is not more effective than RungeKutta, Picard and Euler iteration methods.
Example 2.2
Let us consider the differential equation
subject to the initial condition
Firstly, we obtained the exact solution of the equation as $y=2{e}^{x}{x}^{2}2x2$.
Using Theorem 1.1 and Corollary 1.2, since $T={\int}_{{x}_{0}}^{x}F(t,{y}_{n}(t))\phantom{\rule{0.2em}{0ex}}dt$, then T has a unique fixed point, which is the unique solution of the differential equation ${y}^{\prime}=y+{x}^{2}$ with the initial condition $y(0)=0$.
At first, we approach the approximate solution by the Picard iteration method as follows:
Now applying the new modified Ishikawa iteration method to the equation for $\lambda =0.5$, $\gamma =0.5$, then
are found and also for $\lambda =0.5$, $\gamma =0.25$,
are obtained. On the other hand, for $\lambda =0.25$, $\gamma =0.5$,
are calculated. In the same way, for $\lambda =0.25$, $\gamma =0.25$,
are found and also for $\lambda =0.75$, $\gamma =0.25$,
are obtained. Similarly, for $\lambda =0.25$, $\gamma =0.75$,
are calculated. Finally, for $\lambda =0.75$, $\gamma =0.75$,
are found. Now, we get the approximate solution using by the Euler method. Firstly, we use the formula
with $F(x,y)=y+{x}^{2}$, $h=0.2$ and ${x}_{0}=0$, ${y}_{0}=0$. From the initial condition $y(0)=0$, we have $F(0,0)=0$. We now proceed with the calculations as follows:
Finally, applying the RungeKutta method to the given initial value problem, we carry out the intermediate calculations in each step to give figures after decimal point and round off the final results each at step to four such places. $F(x,y)=y+{x}^{2}$, ${x}_{0}=0$, ${y}_{0}=0$ and we are to use $h=0.2$. Using these quantities, we calculated successively ${k}_{1}$, ${k}_{2}$, ${k}_{3}$, ${k}_{4}$ and ${K}_{0}$ defined by
and ${K}_{0}=\frac{1}{6}({k}_{1}+2{k}_{2}+2{k}_{3}+{k}_{4})$, ${y}_{n+1}={y}_{n}+{K}_{0}$. Thus we find ${k}_{1}$, ${k}_{2}$, ${k}_{3}$, ${k}_{4}$ for $n=0$ as follows:
So, ${y}_{1}=0.0028066666666667$ is obtained for ${x}_{1}=0.2$. On the other hand, we calculated ${k}_{1}$, ${k}_{2}$, ${k}_{3}$, ${k}_{4}$ for $n=1$ as follows:
Hence ${y}_{2}=0.0236507293333334$ is calculated for ${x}_{2}=0.4$. Finally, we get ${k}_{1}$, ${k}_{2}$, ${k}_{3}$, ${k}_{4}$ for $n=2$ as follows:
Thus ${y}_{3}=0.08423766727440010142666666666667$ is obtained for ${x}_{3}=0.6$.
After the necessary calculation which is done above, the comparison is shown schematically in Figure 2.
On the other hand, we may give Table 6, Table 7, Table 8 and Table 9 by the new modified Ishikawa iteration method for different values of λ and γ. Now we may give Table 10 which is expressed that absolute error of Example 2.2 for different values of λ and γ with $x=0.2$, $x=0.4$ and $x=0.6$ respectively.
Corollary 2.3 If we compare the approximate solution with the different values of λ and γ, then the conclusion may be indicated using Table 6, Table 7, Table 8 and Table 9 as follows.
The best approximation is obtained taking the different values of λ and γ and using the modified Ishikawa iteration method for $x=0.2$, $x=0.4$ and $x=0.5$ getting ($\lambda =0.25$, $\gamma =0.25$; $\lambda =0.5$, $\gamma =0.25$; $\lambda =0.25$, $\gamma =0.5$; $\lambda =0.75$, $\gamma =0.25$; $\lambda =0.5$, $\gamma =0.5$; $\lambda =0.25$, $\gamma =0.75$; $\lambda =0.75$, $\gamma =0.75$) respectively.
Similarly, we calculated the solution for $x=0.6$, $x=1$ and $x=1.5$ then the approximation is found more sensitive taking ($\lambda =0.25$, $\gamma =0.25$; $\lambda =0.5$, $\gamma =0.25$; $\lambda =0.25$, $\gamma =0.5$; $\lambda =0.75$, $\gamma =0.25$; $\lambda =0.5$, $\gamma =0.5$; $\lambda =0.25$, $\gamma =0.75$; $\lambda =0.75$, $\gamma =0.75$) respectively.
Corollary 2.4 Absolute error of the modified Ishikawa iteration method is computed taking different values of λ and γ ($x=0.2$, $x=0.4$ and $x=0.6$), which is not more effective than Picard, RungeKutta and Euler iteration methods.
Example 2.3
Let us consider the differential equation
subject to the initial condition
Using Theorem 1.1 and Corollary 1.2, since $T={\int}_{{x}_{0}}^{x}F(t,{y}_{n}(t))\phantom{\rule{0.2em}{0ex}}dt$, then T has a unique fixed point, which is the unique solution of the differential equation ${y}^{\prime}=2x(y+1)$ with the initial condition $y(0)=0$.
Firstly, we obtained the exact solution of the equation as $y={e}^{{x}^{2}}1$. Then we approach the approximate solution by the Picard iteration method as follows:
Now, applying the new modified Ishikawa iteration method to the equation for $\lambda =0.5$, $\gamma =0.5$, then
are found and also for $\lambda =0.5$, $\gamma =0.25$,
are obtained. On the other hand, for $\lambda =0.25$, $\gamma =0.5$,
are calculated. In the same way, for $\lambda =0.25$, $\gamma =0.25$,
are found and also for $\lambda =0.75$, $\gamma =0.25$,
are obtained. Similarly, for $\lambda =0.25$, $\gamma =0.75$,
are calculated. Finally, for $\lambda =0.75$, $\gamma =0.75$,
are found. Now, we find the approximate solution using by the Euler method. Firstly, we use the formula
with $F(x,y)=2x(y+1)$, $h=0.2$ and ${x}_{0}=0$, ${y}_{0}=0$. From the initial condition $y(0)=0$, we have $F(0,0)=0$. We now proceed with the calculations as follows:
Finally, applying the RungeKutta method to the given initial value problem, we carry out the intermediate calculations in each step to give figures after the decimal point and round off the final results at each step to four such places.Here $F(x,y)=2x(y+1)$, ${x}_{0}=0$, ${y}_{0}=0$ and we are to use $h=0.2$. Using these quantities, we calculated successively ${k}_{1}$, ${k}_{2}$, ${k}_{3}$, ${k}_{4}$ and ${K}_{0}$ defined by
and ${K}_{0}=\frac{1}{6}({k}_{1}+2{k}_{2}+2{k}_{3}+{k}_{4})$, ${y}_{n+1}={y}_{n}+{K}_{0}$. Thus we find ${k}_{1}$, ${k}_{2}$, ${k}_{3}$, ${k}_{4}$ for $n=0$ as follows:
So, ${y}_{1}=0.040810666$ is obtained for ${x}_{1}=0.2$. On the other hand, we calculated ${k}_{1}$, ${k}_{2}$, ${k}_{3}$, ${k}_{4}$ for $n=1$ as follows:
Hence ${y}_{2}=0.173509529$ is calculated for ${x}_{2}=0.4$. Finally we get ${k}_{1}$, ${k}_{2}$, ${k}_{3}$, ${k}_{4}$ for $n=2$ as follows:
Thus ${y}_{3}=0.433321409$ is obtained for ${x}_{3}=0.6$.
After the necessary calculation which is done above, the comparison is shown schematically in Figure 3.
On the other hand, we may give Table 11, Table 12, Table 13 and Table 14 by the new modified Ishikawa iteration method for different values of λ and γ. Now we may give Table 15 which is expressed that absolute error of Example 2.3 for different values of λ and γ with $x=0.2$, $x=0.4$ and $x=0.6$ respectively.
Corollary 2.5 If we compare the approximate solution with the different values of λ and γ, then the conclusion may be indicated using by Table 11, Table 12, Table 13 and Table 14 as follows.
The best approximation is obtained taking the different values of λ and γ and using the modified Ishikawa iteration method for $x=0.2$, $x=0.4$ and $x=0.5$ getting ($\lambda =0.25$, $\gamma =0.25$; $\lambda =0.5$, $\gamma =0.25$; $\lambda =0.25$, $\gamma =0.5$; $\lambda =0.75$, $\gamma =0.25$; $\lambda =0.5$, $\gamma =0.5$; $\lambda =0.25$, $\gamma =0.75$; $\lambda =0.75$, $\gamma =0.75$) respectively.
Similarly, we calculated the solution for $x=0.6$, $x=1$ and $x=1.5$, then the approximation is found more sensitive taking ($\lambda =0.25$, $\gamma =0.25$; $\lambda =0.5$, $\gamma =0.25$; $\lambda =0.25$, $\gamma =0.5$; $\lambda =0.75$, $\gamma =0.25$; $\lambda =0.5$, $\gamma =0.5$; $\lambda =0.25$, $\gamma =0.75$; $\lambda =0.75$, $\gamma =0.75$) respectively.
Corollary 2.6 Absolute error of the modified Ishikawa iteration method is computed taking different values of λ and γ ($x=0.2$, $x=0.4$ and $x=0.6$), which is not more effective than Picard, RungeKutta and Euler iteration methods.
3 Conclusion
A new technique, using the new modified Ishikawa iteration method, to numerically solve the different types of differential equations is presented. All the numerical results obtained using the new modified Ishikawa iteration method described earlier show a very good agreement with the exact solution. Comparing the new modified Ishikawa iteration method with several other methods that have been advanced for solving linear and nonlinear differential equations shows that the new technique is reliable, powerful and promising. We believe that the efficiency of the new modified Ishikawa iteration method gives it much wider applicability which should be explored further.
References
 1.
Boyce WE, Diprima RC: Elementary Differential Equations and Boundary Value Problems. Wiley, New York; 1976.
 2.
Ross SL: Differential Equations. Wiley, New York; 1984.
 3.
Sun B: Existence and successive iteration of positive solutions to a thirdorder threepoint boundary value problem. Energy Procedia 2011, 13(3):6091–6096.
 4.
Berinde, V: Iterative approximation of fixed points. North University of Baia Mare, Romania, 18 Juin (2007)
 5.
Brouwer LEJ: On continuous onetoone transformations of surfaces into themselves. Proc. K. Ned. Akad. Wet. 1909, 11: 788–798.
 6.
Brouwer LEJ: On continuous onetoone transformations of surfaces into themselves. Proc. K. Ned. Akad. Wet. 1910, 12: 286–297.
 7.
Brouwer LEJ: On continuous onetoone transformations of surfaces into themselves. Proc. K. Ned. Akad. Wet. 1911, 13: 767–774.
 8.
Brouwer LEJ: On continuous onetoone transformations of surfaces into themselves. Proc. K. Ned. Akad. Wet. 1912, 14: 300–310.
 9.
Brouwer LEJ: On continuous onetoone transformations of surfaces into themselves. Proc. K. Ned. Akad. Wet. 1913, 15: 352–360.
 10.
Brouwer LEJ: On continuous onetoone transformations of surfaces into themselves. Proc. K. Ned. Akad. Wet. 1920, 22: 811–814.
 11.
Brouwer LEJ: On continuous onetoone transformations of surfaces into themselves. Proc. K. Ned. Akad. Wet. 1921, 23: 232–234.
 12.
Buong N, Land ND: Iteration methods for fixed point of a nonexpansive mapping. Int. Math. Forum 2011, 6(60):2963–2974.
 13.
Agarwal RP, Meehan M, O’Regan D 141. In Fixed Point Theory and Applications. Cambridge University Press, Cambridge; 2004.
 14.
Ahmed AES: Convergence of some doubly sequences iterations with errors in Banach spaces. Glob. J. Sci. Front. Res. 2010, 105: 65–69.
 15.
Ciric LB, Ume JS: Ishikawa iterative process with errors for nonlinear equations of generalized monotone type in Banach spaces. Math. Nachr. 2005, 27810: 1137–1146.
 16.
Ishikawa S: Fixed points and iterations of a nonexpansive mapping in a Banach space. Proc. Am. Math. Soc. 1974, 59(1):65–71.
 17.
Panyanak B: Mann and Ishikawa iterative processes for multivalued mappings in Banach spaces. Comput. Math. Appl. 2007, 54(6):872–877. 10.1016/j.camwa.2007.03.012
 18.
Shahzad N, Zegeye H: On Mann and Ishikawa iteration schemes for multivalued maps in Banach spaces. Nonlinear Anal., Theory Methods Appl. 2009, 71(3):838–844. 10.1016/j.na.2008.10.112
 19.
Isac G, Li J: The convergence property of Ishikawa iteration schemes in noncompact subsets of Hilbert spaces and its applications to complementary theory. Comput. Math. Appl. 2004, 47: 1745–1751. 10.1016/j.camwa.2004.06.018
 20.
Shang X, Qin M, Su Y: Strong convergence of Ishikawa iterative method for nonexpansive mappings in Hilbert spaces. J. Math. Inequal. 2007, 1(2):195–204.
 21.
Chang SS, Cho YJ, Kim JK: The equivalence between the convergence of modified Picard, modified Mann, and modified Ishikawa iterations. Math. Comput. Model. 2003, 37: 985–991. 10.1016/S08957177(03)001134
 22.
Chang SS: The Mann and Ishikawa iterative approximation of solutions to variational inclusions with accretive type mappings. Comput. Math. Appl. 1999, 37: 17–24.
 23.
Huang Z, Bu F: The equivalence between the convergence of Ishikawa and Mann iterations with errors for strongly successively pseudo contractive mappings without Lipschitzian. J. Math. Anal. Appl. 2007, 325(1):586–594. 10.1016/j.jmaa.2006.02.010
 24.
Ishikawa S: Fixed points by a new iteration method. Proc. Am. Math. Soc. 1974, 44(1):147–150. 10.1090/S00029939197403364695
 25.
Liu L: Fixed points of local strictly pseudocontractive mappings using Mann and Ishikawa iteration with errors. Indian J. Pure Appl. Math. 1995, 26(7):649–659.
 26.
Rhoades BE, Soltuz SM: The equivalence between the T stabilities of Mann and Ishikawa iterations. J. Math. Anal. Appl. 2006, 318(2):472–475. 10.1016/j.jmaa.2005.05.066
 27.
Soltuz SM: The equivalence of Picard, Mann and Ishikawa iterations dealing with quasicontractive operators. Math. Commun. 2005, 10(1):81–88.
 28.
Wattanawitoon K, Kumam P: Convergence theorems of modified Ishikawa iterative scheme for two nonexpansive semigroups. Fixed Point Theory Appl. 2010, 2010: 1–12.
 29.
Xu Y: Ishikawa and Mann iterative process with errors for nonlinear strongly accretive operator equations. J. Math. Anal. Appl. 1998, 224: 91–101. 10.1006/jmaa.1998.5987
 30.
Anastassi ZA, Simos TE: An optimized RungeKutta method for the solution of orbital problems. J. Comput. Appl. Math. 2005, 175(1):1–9. 10.1016/j.cam.2004.06.004
 31.
Tselios K, Simos TE: RungeKutta methods with minimal dispersion and dissipation for problems arising from computational acoustics. J. Comput. Appl. Math. 2005, 175(1):173–181. 10.1016/j.cam.2004.06.012
Author information
Authors’ original submitted files for images
Rights and permissions
About this article
Received
Accepted
Published
DOI
Keywords
 ordinary differential equation
 Euler method
 fixed point
 numerical analysis
 modified Ishikawa iteration
 Picard successive iteration method