We consider implicit integration methods for the numerical solution of sti initial-value problems. In applying such methods, the implicit relations are usually solved by Newton iteration. However, it often happens that in subintervals of the integration interval the problem is nonsti or mildly sti with respect to the stepsize. In these nonsti subintervals, we do not need the (expensive) Newton ...

Inspired by the very recent work by Noor and Noor [9] and given a closed convex set-valued mapping C, we propose a split algorithm for solving the problem of finding an element x∗ which is a zero of a given maximal monotone operator T such that its image, Ax∗, under a linear operator, A, is in a closed convex set C(x∗). Then, we present two strong convergence results and state some examples as ...

and Applied Analysis 3 where {an}, {bn}, {αn} are appropriate sequences in 0, 1 . The theory of three-step iterative scheme is very rich, and this scheme, in the context of one or more mappings, has been extensively studied e.g., see Khan et al. 6 , Plubtieng and Wangkeeree 7 , Fukhar-ud-din and Khan 5 , Petrot 13 , and Suantai 14 . It has been shown in 15 that three-step method performs better...

In the recent paper [M. A. Noor, W. A. Khan, K. I. Noor and Eisa Al-Said, Higher-order iterative methods free from second derivative for solving nonlinear equations, International Journal of the Physical Sciences, Vol. 6 (8) (2011), 1887-1893] several iterative methods for solving nonlinear equations are presented. One of the methods is the three-step iterative method given in Algorithm (2.10) ...