In this paper, we propose few new algorithms of third order convergence for minimization of nonlinear functions which is based on geometric construction of iteration functions of order three to develop cubically convergent iterative methods. Then comparative study among the new algorithms and Newton’s algorithm is established by means of examples.

In this paper, a new two-step Newton-type method with third-order convergence for solving systems of nonlinear equations is proposed. We construct the new method based on the integral interpolation of Newton’s method. Its cubic convergence and error equation are proved theoretically, and demonstrated numerically. Its application to systems of nonlinear equations and boundary-value problems of n...

— We present a local convergence analysis for an improved Jarratt-type methods of order at least five to approximate a solution of a nonlinear equation in a Banach space setting. The convergence ball and error estimates are given using hypotheses up to the first Fréchet derivative in contrast to earlier studies using hypotheses up to the third Fréchet derivative. Numerical examples are also pro...

In this paper, we provide local and global convergence guarantees for recovering CP (Candecomp/Parafac) tensor decomposition. The main step of the proposed algorithm is a simple alternating rank-1 update which is the alternating version of the tensor power iteration adapted for asymmetric tensors. Local convergence guarantees are established for third order tensors of rank k in d dimensions, wh...