scholarly journals Basic Steffensen's Method of Higher-Order Convergence

2021 ◽  
Vol 8 (4) ◽  
pp. 184-191
Author(s):  
Ola A. Ashour

In this paper, we introduce a new analog of a variant of Steffensen's method of fourth-order convergence for solving non-linear equations based on the q-deference operator.

1953 ◽  
Vol 4 (2) ◽  
pp. 205-230 ◽  
Author(s):  
A. Thom

SummaryThe paper describes in detail an older method than Relaxation of approximating to the solution of equations of the Laplace and Poisson type. The corresponding fourth order equations are discussed briefly, and a method of dealing with certain non-linear equations is indicated. A description is also given of the propagation of errors in the fields due to various causes.


2007 ◽  
Vol 188 (1) ◽  
pp. 1031-1036 ◽  
Author(s):  
Jisheng Kou ◽  
Yitian Li ◽  
Xiuhua Wang

Author(s):  
Khushbu Rajput ◽  
Asif Ali Shaikh ◽  
Sania Qureshi

This paper, investigates the comparison of the convergence behavior of the proposed scheme and existing schemes in literature. While all schemes having fourth-order convergence and derivative-free nature. Numerical approximation demonstrates that the proposed schemes are able to attain up to better accuracy than some classical methods, while still significantly reducing the total number of iterations. This study has considered some nonlinear equations (transcendental, algebraic and exponential) along with two complex mathematical models. For better analysis graphical representation of numerical methods for finding the real root of nonlinear equations with varying parameters has been included. The proposed scheme is better in reducing error rapidly, hence converges faster as compared to the existing schemes.


2021 ◽  
Vol 25 (Spec. issue 2) ◽  
pp. 401-409
Author(s):  
Malik Ullah ◽  
Fayyaz Ahmad

A five-point thirty-two convergence order derivative-free iterative method to find simple roots of non-linear equations is constructed. Six function evaluations are performed to achieve optimal convergence order 26-1 = 32 conjectured by Kung and Traub [1]. Secant approximation to the derivative is computed around the initial guess. High order convergence is attained by constructing polynomials of quotients for functional values.


Sign in / Sign up

Export Citation Format

Share Document