scholarly journals Two-step secant type method with approximation of the inverse operator

2013 ◽  
Vol 5 (1) ◽  
pp. 150-155 ◽  
Author(s):  
S.M. Shakhno ◽  
H.P. Yarmola
Keyword(s):  
Numerical Experiment ◽  
Nonlinear Equations ◽  
Local Convergence ◽  
Quadratic Convergence ◽  
Inverse Operator ◽  
Convergence Order ◽  
Test Problems ◽  
Type Method ◽  
Consistent Approximation

The two-step secant type method with a consistent approximation of the inverse operator for solving nonlinear equations is proposed. The local convergence of the proposed method is studied and the quadratic convergence order is established. A numerical experiment is made on the test problems.

scholarly journals On an Aitken-Steffensen-Newton type method

2018 ◽  
Vol 34 (1) ◽  
pp. 85-92
Author(s):  
ION PAVALOIU ◽  
Keyword(s):  
Local Convergence ◽  
Convergence Result ◽  
Convergence Order ◽  
Monotone Convergence ◽  
Type Method ◽  
Numerical Examples ◽  
Newton Iterations ◽  
Convergence Orders

We consider an Aitken-Steffensen type method in which the nodes are controlled by Newton and two-step Newton iterations. We prove a local convergence result showing the q-convergence order 7 of the iterations. Under certain supplementary conditions, we obtain monotone convergence of the iterations, providing an alternative to the usual ball attraction theorems. Numerical examples show that this method may, in some cases, have larger (possibly sided) convergence domains than other methods with similar convergence orders.

scholarly journals Convergence Analysis of a Three Step Newton-like Method for Nonlinear Equations in Banach Space under Weak Conditions

2016 ◽  
Vol 54 (2) ◽  
pp. 37-46
Author(s):  
Ioannis K. Argyros ◽  
Santhosh George
Keyword(s):  
Banach Space ◽  
Convergence Analysis ◽  
Nonlinear Equations ◽  
Local Convergence ◽  
Convergence Order ◽  
Order Method ◽  
Numerical Examples ◽  
Local Convergence Analysis

Abstract In the present paper, we study the local convergence analysis of a fifth convergence order method considered by Sharma and Guha in [15] to solve equations in Banach space. Using our idea of restricted convergence domains we extend the applicability of this method. Numerical examples where earlier results cannot apply to solve equations but our results can apply are also given in this study.

scholarly journals New Simpson type method for solving nonlinear equations

2021 ◽  
Vol 5 (1) ◽  
pp. 94-100
Author(s):  
U. K. Qureshi ◽  
◽  
A. A. Shaikhi ◽  
F. K. Shaikh ◽  
S. K. Hazarewal ◽  
...  
Keyword(s):  
Applied Sciences ◽  
Numerical Methods ◽  
Nonlinear Equation ◽  
Nonlinear Equations ◽  
Real World ◽  
Convergence Order ◽  
Type Method ◽  
Numerical Examples ◽  
The Real ◽  
Better Than

Finding root of a nonlinear equation is one of the most important problems in the real world, which arises in the applied sciences and engineering. The researchers developed many numerical methods for estimating roots of nonlinear equations. The this paper, we proposed a new Simpson type method with the help of Simpson 1/3rd rule. It has been proved that the convergence order of the proposed method is two. Some numerical examples are solved to validate the proposed method by using C++/MATLAB and EXCEL. The performance of proposed method is better than the existing ones.

scholarly journals Local Comparison between Two Ninth Convergence Order Algorithms for Equations

Algorithms ◽  
2020 ◽  
Vol 13 (6) ◽  
pp. 147
Author(s):  
Samundra Regmi ◽  
Ioannis K. Argyros ◽  
Santhosh George
Keyword(s):  
Error Estimates ◽  
Nonlinear Equations ◽  
Local Convergence ◽  
Numerical Experiments ◽  
Radius Of Convergence ◽  
Convergence Order ◽  
Convergence Criteria ◽  
First Derivative ◽  
Local Comparison ◽  
Uniqueness Of The Solution

A local convergence comparison is presented between two ninth order algorithms for solving nonlinear equations. In earlier studies derivatives not appearing on the algorithms up to the 10th order were utilized to show convergence. Moreover, no error estimates, radius of convergence or results on the uniqueness of the solution that can be computed were given. The novelty of our study is that we address all these concerns by using only the first derivative which actually appears on these algorithms. That is how to extend the applicability of these algorithms. Our technique provides a direct comparison between these algorithms under the same set of convergence criteria. This technique can be used on other algorithms. Numerical experiments are utilized to test the convergence criteria.

scholarly journals A Modified Ren’s Method with Memory Using a Simple Self-Accelerating Parameter

Mathematics ◽  
2020 ◽  
Vol 8 (4) ◽  
pp. 540 ◽  
Author(s):  
Xiaofeng Wang ◽  
Qiannan Fan
Keyword(s):  
Nonlinear Equations ◽  
Numerical Experiments ◽  
New Method ◽  
Convergence Order ◽  
Type Method ◽  
Computational Costs ◽  
With Memory ◽  
Theoretical Results

In this paper, a self-accelerating type method is proposed for solving nonlinear equations, which is a modified Ren’s method. A simple way is applied to construct a variable self-accelerating parameter of the new method, which does not increase any computational costs. The highest convergence order of new method is 2 + 6 ≈ 4.4495 . Numerical experiments are made to show the performance of the new method, which supports the theoretical results.

An Efficient Sixth-Order Convergent Newton-Type Iterative Method for Nonlinear Equations

2012 ◽  
Vol 220-223 ◽  
pp. 2585-2588
Author(s):  
Zhong Yong Hu ◽  
Fang Liang ◽  
Lian Zhong Li ◽  
Rui Chen
Keyword(s):  
Iterative Method ◽  
Nonlinear Equations ◽  
Newton’S Method ◽  
Newton's Method ◽  
Efficiency Index ◽  
Sixth Order ◽  
Type Method ◽  
Second Derivatives ◽  
Better Than

In this paper, we present a modified sixth order convergent Newton-type method for solving nonlinear equations. It is free from second derivatives, and requires three evaluations of the functions and two evaluations of derivatives per iteration. Hence the efficiency index of the presented method is 1.43097 which is better than that of classical Newton’s method 1.41421. Several results are given to illustrate the advantage and efficiency the algorithm.

scholarly journals Extending the Applicability of a Two-Step Chord-Type Method for Non-Differentiable Operators

Mathematics ◽  
2019 ◽  
Vol 7 (9) ◽  
pp. 804
Author(s):  
Ioannis K. Argyros ◽  
Neha Gupta ◽  
J. P. Jaiswal
Keyword(s):  
Approximate Solution ◽  
Convergence Analysis ◽  
Banach Spaces ◽  
Recurrence Relation ◽  
Convergence Theorem ◽  
Local Convergence ◽  
Existence And Uniqueness ◽  
Numerical Illustration ◽  
Type Method ◽  
Local Convergence Analysis

The semi-local convergence analysis of a well defined and efficient two-step Chord-type method in Banach spaces is presented in this study. The recurrence relation technique is used under some weak assumptions. The pertinency of the assumed method is extended for nonlinear non-differentiable operators. The convergence theorem is also established to show the existence and uniqueness of the approximate solution. A numerical illustration is quoted to certify the theoretical part which shows that earlier studies fail if the function is non-differentiable.

Sign in / Sign up

Export Citation Format

Share Document