scholarly journals Rootfinding : An Iterative Tool to Solve Different Problems

2015 ◽  
Vol 5 ◽  
pp. 121-125
Author(s):  
Iswarmani Adhikari

The aim of this paper is to apply the iteration methods for the solution of non-linear equations. Among the various root finding techniques, two of the common iterative methods Regula-falsi (false position) and the Secant method are used in two different problems to show the applications of numerical analysis in different fields. The Himalayan Physics Vol. 5, No. 5, Nov. 2014 Page: 121-125

2021 ◽  
Vol 23 (07) ◽  
pp. 858-866
Author(s):  
Gauri Thakur ◽  
◽  
J.K. Saini ◽  

In numerical analysis, methods for finding roots play a pivotal role in the field of many real and practical applications. The efficiency of numerical methods depends upon the convergence rate (how fast the particular method converges). The objective of this study is to compare the Bisection method, Newton-Raphson method, and False Position Method with their limitations and also analyze them to know which of them is more preferred. Limitations of these methods have allowed presenting the latest research in the area of iterative processes for solving non-linear equations. This paper analyzes the field of iterative methods which are developed in recent years with their future scope.


Eng ◽  
2021 ◽  
Vol 2 (1) ◽  
pp. 80-98
Author(s):  
Chaman Lal Sabharwal

Finding the roots of non-linear and transcendental equations is an important problem in engineering sciences. In general, such problems do not have an analytic solution; the researchers resort to numerical techniques for exploring. We design and implement a three-way hybrid algorithm that is a blend of the Newton–Raphson algorithm and a two-way blended algorithm (blend of two methods, Bisection and False Position). The hybrid algorithm is a new single pass iterative approach. The method takes advantage of the best in three algorithms in each iteration to estimate an approximate value closer to the root. We show that the new algorithm outperforms the Bisection, Regula Falsi, Newton–Raphson, quadrature based, undetermined coefficients based, and decomposition-based algorithms. The new hybrid root finding algorithm is guaranteed to converge. The experimental results and empirical evidence show that the complexity of the hybrid algorithm is far less than that of other algorithms. Several functions cited in the literature are used as benchmarks to compare and confirm the simplicity, efficiency, and performance of the proposed method.


2014 ◽  
Vol 9 (17) ◽  
pp. 752-757 ◽  
Author(s):  
Ahmad Mir Nazir ◽  
Rafiq Naila

Author(s):  
Aleksandr A. Samarskii ◽  
Evgenii S. Nikolaev

2016 ◽  
Vol 35 ◽  
pp. 127-134
Author(s):  
Goutam Kumar Saha ◽  
Shapla Shirin

In this paper fuzzy version of secant method has been introduced to obtain approximate solutions of a fuzzy non-linear equation. Graphical representations of the approximate solutions have also been shown. The idea of converging to the root to the desired degree of accuracy, which is the optimum solution, of a fuzzy non-linear equation has been focused.GANIT J. Bangladesh Math. Soc.Vol. 35 (2015) 127-134


Sign in / Sign up

Export Citation Format

Share Document