Local convergence for a family of iterative methods based on decomposition techniques
Ioannis K. Argyros; Santhosh George; Shobha Monnanda Erappa
Applicationes Mathematicae (2016)
- Volume: 43, Issue: 1, page 133-143
- ISSN: 1233-7234
Access Full Article
topAbstract
topHow to cite
topIoannis K. Argyros, Santhosh George, and Shobha Monnanda Erappa. "Local convergence for a family of iterative methods based on decomposition techniques." Applicationes Mathematicae 43.1 (2016): 133-143. <http://eudml.org/doc/286206>.
@article{IoannisK2016,
abstract = {We present a local convergence analysis for a family of iterative methods obtained by using decomposition techniques. The convergence of these methods was shown before using hypotheses on up to the seventh derivative although only the first derivative appears in these methods. In the present study we expand the applicability of these methods by showing convergence using only the first derivative. Moreover we present a radius of convergence and computable error bounds based only on Lipschitz constants. Numerical examples are also provided.},
author = {Ioannis K. Argyros, Santhosh George, Shobha Monnanda Erappa},
journal = {Applicationes Mathematicae},
keywords = {local convergence; order of convergence; Newton-like iterative methods},
language = {eng},
number = {1},
pages = {133-143},
title = {Local convergence for a family of iterative methods based on decomposition techniques},
url = {http://eudml.org/doc/286206},
volume = {43},
year = {2016},
}
TY - JOUR
AU - Ioannis K. Argyros
AU - Santhosh George
AU - Shobha Monnanda Erappa
TI - Local convergence for a family of iterative methods based on decomposition techniques
JO - Applicationes Mathematicae
PY - 2016
VL - 43
IS - 1
SP - 133
EP - 143
AB - We present a local convergence analysis for a family of iterative methods obtained by using decomposition techniques. The convergence of these methods was shown before using hypotheses on up to the seventh derivative although only the first derivative appears in these methods. In the present study we expand the applicability of these methods by showing convergence using only the first derivative. Moreover we present a radius of convergence and computable error bounds based only on Lipschitz constants. Numerical examples are also provided.
LA - eng
KW - local convergence; order of convergence; Newton-like iterative methods
UR - http://eudml.org/doc/286206
ER -
NotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.