Solution of Delay Differential Equation via N^v_1 Iteration Algorithm
DOI:
https://doi.org/10.29020/nybg.ejpam.v13i5.3756Keywords:
Iteration schemes, Nv 1 iteration scheme, Convergence analysis, T − stability, Data DependencyAbstract
The aim of this paper is to define a new iteration scheme $N^v_1$ which converges to a fixed point faster than some previously existing methods such as Picard, Mann, Ishikawa, Noor, SP, CR, S, Picard-S, Garodia, $K$ and $K^*$ methods etc. The effectiveness and efficiency of our algorithm is confirmed by numerical example and some strong convergence, weak convergence, $T$-stability and data dependence results for contraction mapping are also proven. Moreover, it is shown that differential equation with retarted argument is solved using $N^v_1$ iteration process.Downloads
Published
2020-12-27
Issue
Section
Special Issue Dedicated to Professor Hari M. Srivastava on the Occasion of his 80th Birthday
License
Upon acceptance of an article by the journal, the author(s) accept(s) the transfer of copyright of the article to European Journal of Pure and Applied Mathematics.
European Journal of Pure and Applied Mathematics will be Copyright Holder.
How to Cite
Solution of Delay Differential Equation via N^v_1 Iteration Algorithm. (2020). European Journal of Pure and Applied Mathematics, 13(5), 1110-1130. https://doi.org/10.29020/nybg.ejpam.v13i5.3756