E. Kalluci, and F. Hoxha. International Journal of Innovative Science and Modern Engineering (IJISME), 3 (2):
37-40(January 2015)
Abstract
Root finding is one of the most significant problems not only of applied mathematics, but also of engineering sciences, physics, finance etc. The implementation of efficient numerical methods to build-in functions in different software programs is a task we want to achieve. We possess different groups of methods with sufficiently good convergence order, but as we know the higher the speed is a larger amount of function and derivative evaluations per iteration is needed. In this paper we will present new multipoint methods with higher computational efficiency, than known ones. The comparison will be made by defining the computational efficiency based on the convergence order, and the efficiency index, which measures the cost of performing iteration.
%0 Journal Article
%1 noauthororeditor
%A Kalluci, Eglantina
%A Hoxha, Fatmir
%D 2015
%E Kumar, Dr. Shiv
%J International Journal of Innovative Science and Modern Engineering (IJISME)
%K convergence efficiency finding. index iterative method of order root
%N 2
%P 37-40
%T Accelerated Multipoint Root Finding Iterative Methods
%U https://www.ijisme.org/wp-content/uploads/papers/v3i2/B0779013215.pdf
%V 3
%X Root finding is one of the most significant problems not only of applied mathematics, but also of engineering sciences, physics, finance etc. The implementation of efficient numerical methods to build-in functions in different software programs is a task we want to achieve. We possess different groups of methods with sufficiently good convergence order, but as we know the higher the speed is a larger amount of function and derivative evaluations per iteration is needed. In this paper we will present new multipoint methods with higher computational efficiency, than known ones. The comparison will be made by defining the computational efficiency based on the convergence order, and the efficiency index, which measures the cost of performing iteration.
@article{noauthororeditor,
abstract = {Root finding is one of the most significant problems not only of applied mathematics, but also of engineering sciences, physics, finance etc. The implementation of efficient numerical methods to build-in functions in different software programs is a task we want to achieve. We possess different groups of methods with sufficiently good convergence order, but as we know the higher the speed is a larger amount of function and derivative evaluations per iteration is needed. In this paper we will present new multipoint methods with higher computational efficiency, than known ones. The comparison will be made by defining the computational efficiency based on the convergence order, and the efficiency index, which measures the cost of performing iteration.},
added-at = {2021-09-21T09:37:37.000+0200},
author = {Kalluci, Eglantina and Hoxha, Fatmir},
biburl = {https://www.bibsonomy.org/bibtex/25fd74a09403c9114c668458390331763/ijisme_beiesp},
editor = {Kumar, Dr. Shiv},
interhash = {0ce3321d2a0625d92af2a7cb70251dd6},
intrahash = {5fd74a09403c9114c668458390331763},
issn = {2319-6386},
journal = {International Journal of Innovative Science and Modern Engineering (IJISME)},
keywords = {convergence efficiency finding. index iterative method of order root},
language = {En},
month = {January },
number = 2,
pages = {37-40},
timestamp = {2021-09-21T09:37:37.000+0200},
title = {Accelerated Multipoint Root Finding Iterative Methods},
url = {https://www.ijisme.org/wp-content/uploads/papers/v3i2/B0779013215.pdf},
volume = 3,
year = 2015
}