- -

Low-complexity root-finding iteration functions with no derivatives of any order of convergence

RiuNet: Institutional repository of the Polithecnic University of Valencia

Share/Send to

Cited by

Statistics

Low-complexity root-finding iteration functions with no derivatives of any order of convergence

Show full item record

Cordero Barbero, A.; Torregrosa Sánchez, JR. (2015). Low-complexity root-finding iteration functions with no derivatives of any order of convergence. Journal of Computational and Applied Mathematics. 275:502-515. doi:10.1016/j.cam.2014.01.024

Por favor, use este identificador para citar o enlazar este ítem: http://hdl.handle.net/10251/65556

Files in this item

Item Metadata

Title: Low-complexity root-finding iteration functions with no derivatives of any order of convergence
Author:
UPV Unit: Universitat Politècnica de València. Departamento de Matemática Aplicada - Departament de Matemàtica Aplicada
Issued date:
Abstract:
In this paper, a procedure to design Steffensen-type methods of different orders for solving nonlinear equations is suggested. By using a particular divided difference of first order we can transform many iterative methods ...[+]
Subjects: Nonlinear equation , Iterative method , Derivative-free scheme , Divided difference , Efficiency index , Optimal order
Copyrigths: Reserva de todos los derechos
Source:
Journal of Computational and Applied Mathematics. (issn: 0377-0427 )
DOI: 10.1016/j.cam.2014.01.024
Publisher:
Elsevier
Publisher version: http://dx.doi.org/10.1016/j.cam.2014.01.024
Thanks:
This research was supported by Ministerio de Ciencia y Tecnologia MTM2011-28636-C02-02 and by Vicerrectorado de Investigacion, Universitat Politecnica de Valencia PAID-SP2012-0498.
Type: Artículo

This item appears in the following Collection(s)

Show full item record