Masters Theses

Abstract

"This study examines the various considerations which are made when a function is approximated by a rational function. None of the four approximations considered here gives both a rapidly calculated approximation and one in which the maximum magnitude of the error function over a given interval is a minimum.

The second algorithm of Remes produces a sequence of rational approximations which converge to the rational approximation that minimizes the maximum magnitude of the error function for a given number of parameters to be calculated if the initial approximation in the sequence is chosen properly. Several rational function approximations are investigated that do not have the accuracy of the minimax approximation but may be calculated more rapidly"--Abstract, page ii.

Advisor(s)

Gillett, Billy E.

Committee Member(s)

Lee, Ralph E., 1921-2010
Carlile, Robert E.
Zenor, Hughes M., 1908-2001

Department(s)

Computer Science

Degree Name

M.S. in Computer Science

Publisher

University of Missouri at Rolla

Publication Date

1966

Pagination

iv, 216 pages

Note about bibliography

Includes bibliographical references (pages 47-48).

Rights

© 1966 Mary Frances Good, All rights reserved.

Document Type

Thesis - Open Access

File Type

text

Language

English

Library of Congress Subject Headings

Approximation theory -- Data processing
Error analysis (Mathematics)
Chebyshev approximation

Thesis Number

T 1950

Print OCLC #

5977720

Electronic OCLC #

910513995

Share

 
COinS