Numerical calculation of complex root functions / Irdina Sofea Zuraimi
In the field of mathematics, science and engineering, determining the root of a function in the form of complex root is an issue that is often encountered. Complex root could be determined theoretically and numerically. The aim of this project is to determine the best numerical method in computing t...
Saved in:
| 主要作者: | |
|---|---|
| 格式: | Thesis |
| 語言: | English |
| 出版: |
2024
|
| 主題: | |
| 在線閱讀: | https://ir.uitm.edu.my/id/eprint/106179/1/106179.pdf |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 總結: | In the field of mathematics, science and engineering, determining the root of a function in the form of complex root is an issue that is often encountered. Complex root could be determined theoretically and numerically. The aim of this project is to determine the best numerical method in computing the complex roots. Three numerical methods will be studied which are: Complex Newton, Complex Secant, and Complex Halley’s. The tested function consists of different type of polynomial functions with complex roots. The results are analysed based on the number of iterations, CPU time and modulus of complex root. Numerical results demonstrates that, in terms of number of iterations, the best method is Complex Halley’s. While in terms of CPU times, the best method is Complex Newton method. |
|---|