In this paper, we develop a new eighth-order method for simple roots of non- linear equations via weight function and interpolation methods. The method requires only three(3) function evaluation and a derivative evaluation with 81/4 ≈ 1.682 efficiency index . Nume More
In this paper, we develop a new eighth-order method for simple roots of non- linear equations via weight function and interpolation methods. The method requires only three(3) function evaluation and a derivative evaluation with 81/4 ≈ 1.682 efficiency index . Numerical comparison between the proposed method with some other methods were presented, which shows that our method is promising .
Manuscript profile
There exist large varieties of conjugate gradient algorithms. In order to take advantage of the attractive features of Liu and Storey (LS) and Conjugate Descent (CD) conjugate gradient methods, we suggest hybridization of these methods in which the parameter is computed More
There exist large varieties of conjugate gradient algorithms. In order to take advantage of the attractive features of Liu and Storey (LS) and Conjugate Descent (CD) conjugate gradient methods, we suggest hybridization of these methods in which the parameter is computed as a convex combination of and respectively which the conjugate gradient (update) parameter was obtained from Secant equation. The algorithm generates descent direction and when the iterate jam, the direction satisfy sufficient descent condition. We report numerical results demonstrating the efficiency of our method. The hybrid computational scheme outperform or comparable with known conjugate gradient algorithms. We also show that our method converge globally using strong Wolfe condition.
Manuscript profile
In this article, the improvement of the numerical performance of the iterative scheme presented by Halilu and Waziri in [5] is considered. This is made possible by hybridizing it with Picard-Mann hybrid iterative process. In addition, the step length is calculated using More
In this article, the improvement of the numerical performance of the iterative scheme presented by Halilu and Waziri in [5] is considered. This is made possible by hybridizing it with Picard-Mann hybrid iterative process. In addition, the step length is calculated using the inexact line search technique. Under the preliminary conditions, the proposed method's global convergence is established. The numerical experiment shown in this paper depicts the efficiency of the proposed method, which improved the results than the double direction method [5], existing in the literature.
Manuscript profile
