Comparison of iterative method for finding root of non-linear equation / Nurfarah Anis Maarof
Root finding is a mathematical problem that can be solved using analytical or theoretical method. Numerical method is preferable due to its ability to find root where theoretical method failed. The aim of the research is to find the roots of function using four different numerical method which inclu...
Saved in:
| 主要作者: | |
|---|---|
| 格式: | Thesis |
| 語言: | English |
| 出版: |
2024
|
| 主題: | |
| 在線閱讀: | https://ir.uitm.edu.my/id/eprint/106223/1/106223.pdf |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 總結: | Root finding is a mathematical problem that can be solved using analytical or theoretical method. Numerical method is preferable due to its ability to find root where theoretical method failed. The aim of the research is to find the roots of function using four different numerical method which include Newton's method, Steffensen's method, Noor 1st method and Noor 2nd method. The result is analysed based on the number of iterations and CPU time. The performance profile by Dolan and More is used to determine the best method. It shows that newton method is the best in terms of number of iteration while Noor 1st method is the best in terms of CPU Time. |
|---|