Abstract
In computational and applied mathematics, root finding of nonlinear equations are of significant importance due to their wide applications in many branches of modern sciences such as Engineering, Mathematical Chemistry, Biomathematics, Physics, Statistics, etc. Newton’s method and Steffensen’s method are well-known methods that are often used to solve root finding problems, especially nonlinear functions. Unfortunately, there are some limitations for these two methods in terms of the simplicity of the method algorithm and efficiency of the method in solving complicated equations. The objective is to determine the best method among four numerical methods selected in solving root finding problem. All methods will be analysed based on convergence, accuracy, number of iteration and CPU times. In this project it shows that Newton’s method is still the best method to be used in solving nonlinear problems
Metadata
Item Type: | Thesis (Degree) |
---|---|
Creators: | Creators Email / ID Num. Mohd Tahirun, Nurlin Syakira 2021102101 |
Contributors: | Contribution Name Email / ID Num. Thesis advisor Mohd Ali, Mohd Rivaie UNSPECIFIED |
Subjects: | Q Science > QA Mathematics > Analysis > Difference equations. Functional equations. Delay differential equations. Integral equations |
Divisions: | Universiti Teknologi MARA, Terengganu > Kuala Terengganu Campus |
Programme: | Bachelor of Science (Hons.) Mathematical Modelling and Analytics |
Keywords: | Nonlinear Equations, Newton’s Method, Steffensen’s Method |
Date: | 2023 |
URI: | https://ir.uitm.edu.my/id/eprint/97761 |
Download
97761.pdf
Download (76kB)