dc.contributor.author |
Pohl, Leesa Kaye. |
|
dc.date.accessioned |
2012-10-26T13:29:57Z |
|
dc.date.available |
2012-10-26T13:29:57Z |
|
dc.date.created |
1982 |
en_US |
dc.date.issued |
2012-10-26 |
|
dc.identifier.uri |
http://hdl.handle.net/123456789/2118 |
|
dc.description |
iii, 73 leaves |
en_US |
dc.description.abstract |
The purpose,of this thesis is to point out some of the problems which may occur while attempting to solve a polynomial equation on the microcomputer. Specifically, programs are given which will solve polynomial equations of degree four or less using the formulas. Since it is not possible to solve a polynomial equation of degree five or more using a formula, programs are also given for Newton's, the secant, and the bisection methods. Solutions obtained by using these programs are given. Illustrations of some of the things which may cause problems are also given. Specifically, these include multiple roots, reducing the polynomial, and the order in which the roots are found. Problems encountered in getting the program itself to work are also discussed. |
en_US |
dc.language.iso |
en_US |
en_US |
dc.subject |
Equations-Numerical solutions. |
en_US |
dc.subject |
Polynomials. |
en_US |
dc.subject |
Mathematics-Data processing. |
en_US |
dc.title |
Limitations of solving polynomial equations on the microcomputer. |
en_US |
dc.type |
Thesis |
en_US |
dc.college |
las |
en_US |
dc.advisor |
John W. Carlson |
en_US |
dc.department |
mathematics, computer science, and economics |
en_US |