On some computational orders of convergence

  1. Grau-Sánchez, M. 1
  2. Noguera, M. 1
  3. Gutiérrez, J.M. 2
  1. 1 Universitat Politècnica de Catalunya
    info

    Universitat Politècnica de Catalunya

    Barcelona, España

    ROR https://ror.org/03mb6wj31

  2. 2 Universidad de La Rioja
    info

    Universidad de La Rioja

    Logroño, España

    ROR https://ror.org/0553yr311

Journal:
Applied Mathematics Letters

ISSN: 0893-9659

Year of publication: 2010

Volume: 23

Issue: 4

Pages: 472-478

Type: Article

beta Ver similares en nube de resultados
DOI: 10.1016/J.AML.2009.12.006 SCOPUS: 2-s2.0-76749090063 WoS: WOS:000276270300028 GOOGLE SCHOLAR

More publications in: Applied Mathematics Letters

Institutional repository: lock_openOpen access Editor

Related Projects

Regiones de accesibilidad y optimización de procesos iterativos para resolver ecuaciones no lineales. Aplicaciones

2009/00009/001

Abstract

Two variants of the Computational Order of Convergence (COC) of an iterative method for solving nonlinear equations are presented. Furthermore, the way to approximate the COC and the new variants to the local order of convergence is analyzed. The new definitions given here does not involve the unknown root. Numerical experiments using adaptive arithmetic with multiple precision and a stopping criteria are implemented without using any known root. © 2009 Elsevier Ltd. All rights reserved.