Solution of complex polynomial equations using surrogate equation (with computer program)
Date of Publication
1991
Document Type
Bachelor's Thesis
Degree Name
Bachelor of Science in Mathematics
College
College of Science
Department/Unit
Mathematics and Statistics
Abstract/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.
Abstract Format
html
Language
English
Format
Accession Number
TU05697
Shelf Location
Archives, The Learning Commons, 12F, Henry Sy Sr. Hall
Physical Description
74 numb. leaves
Keywords
Polynomials; Equations; Computer programs
Recommended Citation
Castro, H. D., & Uy, E. V. (1991). Solution of complex polynomial equations using surrogate equation (with computer program). Retrieved from https://animorepository.dlsu.edu.ph/etd_bachelors/15949