Miquel Grau-Sánchez, Miquel Noguera, Àngela Grau, José R. Herrero
Published 2012-02-20Version 1
Four new variants of the Computational Order of Convergence (COC) of a one-point iterative method with memory for solving nonlinear equations are presented. Furthermore, the way to approximate the new variants to the local order of convergence is analyzed. Three of the new definitions given here do not involve the unknown root. Numerical experiments using adaptive arithmetic with multiple precision and a stopping criteria are implemented without using any known root.
Rates of convergence for the approximation of dual shift-invariant systems in $l_2(Z)$
A Technique to Composite a Modified Newton's Method for Solving Nonlinear Equations
Convergence of adaptive finite element methods for eigenvalue problems
![QR code for arXiv:1202.4236 [math.NA]](http://oss.arxitics.com/images/favicon.svg)