Masters Theses

Abstract

"The convergence of classical iterative procedures, when applied to a system of nonlinear algebraic or transcendental equations, is highly dependent upon a good initial approximation to the desired roots. Most of the classical iterative schemes have convergence factors between one and two. In this paper iterative schemes of order two and greater are studied in connection with a parameter perturbation process. The parameter perturbation process relaxes the restrictions on the choice of initial values. The procedure divides each problem into a number of subsidiary problems. Each subsidiary system of equations is then solved until a solution is found to the original problem. The study presents a discussion of the iteration functions chosen, of the parameter perturbation algorithm and the conditions for convergence"--Abstract, page ii.

Advisor(s)

Lee, Ralph E., 1921-2010

Committee Member(s)

Gillett, Billy E.
Zenor, Hughes M., 1908-2001
Carlile, Robert E.

Department(s)

Computer Science

Degree Name

M.S. in Computer Science

Publisher

University of Missouri at Rolla

Publication Date

1965

Pagination

iv, 59 pages

Note about bibliography

Includes bibliographical references (pages 50-51).

Rights

© 1965 Robert N. Delozier, All rights reserved.

Document Type

Thesis - Open Access

File Type

text

Language

English

Library of Congress Subject Headings

Computational intelligence
Evolution equations, Nonlinear
Iterative methods (Mathematics)
Perturbation (Mathematics)

Thesis Number

T 1789

Print OCLC #

5968993

Electronic OCLC #

835100441

Share

 
COinS