Solution of complex polynomial equations using surrogate equation (with computer program)
This paper introduces a new algorithm in finding the roots of a complex polynomial equation. The algorithm uses a mathematical formula which resembles the formula of Newton's method. The complete proof of the theorem which supports the new algorithm is presented.To show the efficiency of the ne...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | text |
| Language: | English |
| Published: |
Animo Repository
1991
|
| Subjects: | |
| Online Access: | https://animorepository.dlsu.edu.ph/etd_bachelors/15949 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | De La Salle University |
| Language: | English |
| Summary: | This paper introduces a new algorithm in finding the roots of a complex polynomial equation. The algorithm uses a mathematical formula which resembles the formula of Newton's method. The complete proof of the theorem which supports the new algorithm is presented.To show the efficiency of the new algorithm, it is compared with Newton's method. Both methods were applied on common complex polynomial equations. The methods were compared based on the speed of computation and accuracy.Included in this paper is a computer program written in Turbo Pascal version 4.0. The program accepts polynomial equations whose numerical coefficients follow the format of a comlex number. The program further restricts the user from using equations of degree greater than 10. |
|---|