  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.
