On a Moser–Steffensen type method for nonlinear systems of equations
This paper is devoted to the construction and analysis of a Moser–Steffensen iterative scheme. The method has quadratic convergence without evaluating any derivative nor inverse operator. We present a complete study of the order of convergence for systems of equations, hypotheses ensuring the local...
| Autores: | , , , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión enviada para evaluación y publicación |
| Fecha de publicación: | 2016 |
| País: | España |
| Institución: | Universidad Politécnica de Cartagena(UPCT) |
| Repositorio: | Repositorio Digital UPCT |
| OAI Identifier: | oai:repositorio.upct.es:10317/10795 |
| Acceso en línea: | http://hdl.handle.net/10317/10795 http://link.springer.com/article/10.1007%2Fs00009-016-0735-3 |
| Access Level: | acceso abierto |
| Palabra clave: | Steffensen’s method Moser’s strategy Recurrence relations Local convergence Numerical analysis Matemática Aplicada 1206 Análisis Numérico |
| Sumario: | This paper is devoted to the construction and analysis of a Moser–Steffensen iterative scheme. The method has quadratic convergence without evaluating any derivative nor inverse operator. We present a complete study of the order of convergence for systems of equations, hypotheses ensuring the local convergence, and finally, we focus our attention to its numerical behavior. The conclusion is that the method improves the applicability of both Newton and Steffensen methods having the same order of convergence. |
|---|