Title: Mathematical Model Formulation and Comparison Study of Various Methods of Root- Finding Problems
Abstract:A number of methods are available to find the root of function. The study is aimed to compare Bisection method, Newton-Raphson method and Secant method in term of time, iteration needed to get root in...A number of methods are available to find the root of function. The study is aimed to compare Bisection method, Newton-Raphson method and Secant method in term of time, iteration needed to get root in a desire level of error. A mathematical polynomial equation for beam deflection developed and the point at which maximum deflection occurs find by Bisection method, Newton-Raphson method and Secant method. We compare these root finding methods by using the software MATLAB R2008a. It would seem obvious that Newton's method is faster, since it converges more quickly. However, to compare performance, we must consider both cost and speed of convergence (1). From the above observation it is seen that the Bisection method converge at 25 th iteration while Newton-Raphson method and Secant method converge at 3 rd and 4 th iteration respectively. In Newton-Raphson method two functions evaluate per iteration and in Secant method only a single function (from 2 nd ) evaluate per iteration. Then it was conclude that among three methods Secant method is converge fasterRead More
Publication Year: 2015
Publication Date: 2015-01-01
Language: en
Type: dataset
Indexed In: ['datacite']
Access and Citation
Cited By Count: 2
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot