A new higher-order optimal derivative free scheme for multiple roots

[EN] In this paper, we presented a novel and efficient fourth order derivative free optimal family of iterative methods for approximating the multiple roots of nonlinear equations. Initially the convergence analysis is performed for particular values of multiple roots afterward it concludes in gener...

ver descrição completa

Detalhes bibliográficos
Autores: Behl, Ramandeep, Cordero Barbero, Alicia|||0000-0002-7462-9173, Torregrosa Sánchez, Juan Ramón|||0000-0002-9893-0761
Formato: artículo
Fecha de publicación:2022
País:España
Recursos:Universitat Politècnica de València (UPV)
Repositorio:RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Idioma:inglés
OAI Identifier:oai:riunet.upv.es:10251/192126
Acesso em linha:https://riunet.upv.es/handle/10251/192126
Access Level:acceso abierto
Palavra-chave:Nonlinear equation
Iterative method
Multiple root
Efficiency index
Convergence
MATEMATICA APLICADA
Descrição
Resumo:[EN] In this paper, we presented a novel and efficient fourth order derivative free optimal family of iterative methods for approximating the multiple roots of nonlinear equations. Initially the convergence analysis is performed for particular values of multiple roots afterward it concludes in general form. In addition, we study several numerical experiments on real life problems in order to confirm the efficiency and accuracy of our methods. We illustrate the applicability and comparisons of our methods on eigenvalue problem, Van der Waals equation of state, continuous stirred tank reactor (CSTR), Plank's radiation and clustering problem of roots with earlier robust iterative methods. Finally, on the basis of obtained computational results, we conclude that our methods perform better than the existing ones in terms of CPU timing, absolute residual errors, asymptotic error constants, absolute error difference between two last consecutive iterations and approximated roots compared to the existing ones. (c) 2021 Published by Elsevier B.V.