Zobrazeno 1 - 10
of 26
pro vyhledávání: '"D. K. R. Babajee"'
Publikováno v:
Journal of Applied Mathematics, Vol 2012 (2012)
Construction of iterative processes without memory, which are both optimal according to the Kung-Traub hypothesis and derivative-free, is considered in this paper. For this reason, techniques with four and five function evaluations per iteration, whi
Externí odkaz:
https://doaj.org/article/e91a408ac41a4c36957f93cc81854527
Publikováno v:
SeMA Journal. 76:227-248
Kung–Traub conjecture states that an iterative method without memory for finding the simple zero of a scalar equation could achieve convergence order $$2^{d-1}$$ , where d is the total number of function evaluations. Babajee (Algorithms 9:1, 2016)
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3207ecb3107bbf2902dcc9fa90145678
https://doi.org/10.1007/s40324-018-0174-0
https://doi.org/10.1007/s40324-018-0174-0
Publikováno v:
Numerical Algorithms. 74:593-607
In this work, we have improved the order of the double-step Newton method from four to five using the same number of evaluation of two functions and two first order Frechet derivatives for each iteration. The multi-step version requires one more func
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::94eed121865a2f36ad9b859f785973a0
https://doi.org/10.1007/s11075-016-0163-2
https://doi.org/10.1007/s11075-016-0163-2
Publikováno v:
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
instname
instname
[EN] Many iterative methods for solving nonlinear equations have been developed recently. The main advantage claimed by their authors is the improvement of the order of convergence. In this work, we compare their dynamical behavior on quadratic polyn
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::619cfa3ea5ae3a2a502efff9099c9729
https://doi.org/10.1016/j.cam.2014.09.020
https://doi.org/10.1016/j.cam.2014.09.020
Publikováno v:
Afrika Matematika. 27:865-876
In this paper, we have presented a family of two-point fourth order, three-point sixth order and four-point twelfth order iterative methods without memory based on power mean using weight function. The family of fourth order methods is optimal in the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d8852b5cafefb07eaebff1ca44e4120b
https://doi.org/10.1007/s13370-015-0380-1
https://doi.org/10.1007/s13370-015-0380-1
Autor:
D. K. R. Babajee
Publikováno v:
Algorithms, Vol 8, Iss 3, Pp 552-561 (2015)
Algorithms
Volume 8
Issue 3
Pages 552-561
Algorithms
Volume 8
Issue 3
Pages 552-561
In this paper, we present three improvements to a three-point third order variant of Newton’s method derived from the Simpson rule. The first one is a fifth order method using the same number of functional evaluations as the third order method, the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d73dddaf9e0bec9044e46e4726d0c734
https://doi.org/10.3390/a8030552
https://doi.org/10.3390/a8030552
Autor:
D. K. R. Babajee
Publikováno v:
Afrika Matematika. 26:689-697
The one-parameter Chebyshev-Halley family is an important family of one-point third order iterative methods which requires one function, one first and one second derivative evaluations. The famous Chebyshev, Halley and Super-Halley methods are its me
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ebfb7dfebff163986ee8f337d5576faa
https://doi.org/10.1007/s13370-014-0237-z
https://doi.org/10.1007/s13370-014-0237-z
Publikováno v:
Journal of the Egyptian Mathematical Society, Vol 21, Iss 3, Pp 346-353 (2013)
An optimal method is developed for approximating the multiple zeros of a nonlinear function, when the multiplicity is known. Analysis of convergence for the proposed technique is studied to reveal the fourth-order convergence. We further investigate
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::01d42552591c895077bed4538ee9d489
https://doi.org/10.1016/j.joems.2013.03.011
https://doi.org/10.1016/j.joems.2013.03.011
Autor:
D. K. R. Babajee, Vishal Chandr Jaunky
Publikováno v:
ISRN Applied Mathematics. 2013:1-10
The Newton secant method is a third-order iterative nonlinear solver. It requires two function and one first derivative evaluations. However, it is not optimal as it does not satisfy the Kung-Traub conjecture. In this work, we derive an optimal fourt
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::40786a0d7ed03f4a03459dcdcc0487c9
https://doi.org/10.1155/2013/785287
https://doi.org/10.1155/2013/785287
Autor:
D. K. R. Babajee, S. K. Khratti
Publikováno v:
Annual Review of Chaos Theory, Bifurcations and Dynamical Systems, Vol 4, Pp 16-29 (2013)
Many variants of existing multipoint methods have been developed. Recently, Khratti et al. (2011) developed a unifying family of two-point fourth order methods which contains the well-known Ostrowski method. The authors also obtained some new methods
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doajarticles::1be472d3c58d1111f5b9d5cf64c125c1
http://arctbds.com/volume4/dynamic_4order_ostrowski_method.pdf
http://arctbds.com/volume4/dynamic_4order_ostrowski_method.pdf