Masters Theses

Abstract

"The purpose of this study was to investigate and recommend various methods instrumental in finding the roots of a polynomial p(x) = 0. Many different methods are present today, and each has its advantages and disadvantages.

Through thorough investigation, the author has ascertained the key methods to be the method of Bisection, the Newton-Raphson method, and the Bairstow method. Special support in the form of algebraic theorems on the locations and kind of roots are extremely helpful. This combination of theorems and methods provides assurance, speed, and the ability to obtain complex roots.

The Bisnewbar method developed by this author combines the above methods and the algebraic theorems to provide a method capable of returning all real and complex roots"--Abstract, page i.

Advisor(s)

Gillett, Billy E.

Committee Member(s)

Lee, Ralph E., 1921-2010
Wellek, Robert M.
Murphy, William John

Department(s)

Computer Science

Degree Name

M.S. in Computer Science

Publisher

University of Missouri at Rolla

Publication Date

1967

Pagination

iv, 93 pages

Note about bibliography

Includes bibliographical references (pages 91-92).

Rights

© 1967 Charles Ray O'Daniel, All rights reserved.

Document Type

Thesis - Open Access

File Type

text

Language

English

Library of Congress Subject Headings

Polynomials -- Mathematical models
Equations, Roots of
Numerical calculations -- Data processing

Thesis Number

T 1973

Print OCLC #

5980591

Electronic OCLC #

921147508

Share

 
COinS