Doctoral Dissertations

Abstract

"Several linear and nonlinear algorithms for solving the discrete Tchebycheff problem are compared in this study. The Lawson algorithm is compared with two more well-known methods of linear Tchebycheff approximation. A new acceleration scheme for the Lawson algorithm is introduced and its performance is tested with an already existing acceleration technique. The new version is found to be better than the previous one but not as effective as the traditional Exchange method.

A nonlinear version of Lawson's algorithm is proposed for the solution of problems having approximating functions which are varisolvent. Some linear theorems of Lawson are extended to the nonlinear case. A modification of Osborne and Watson's nonlinear method is introduced and tested on five problems. This new technique improves the efficiency remarkably, particularly for larger problems"--Abstract, page ii.

Advisor(s)

Rigler, A. K.

Committee Member(s)

Engelhardt, Max
Pyron, Howard D.
Penico, Anthony J., 1923-2011
Dekock, Arlan R.
Edwards, D. R.

Department(s)

Mathematics and Statistics

Degree Name

Ph. D. in Mathematics

Sponsor(s)

National Science Foundation (U.S.)

Publisher

University of Missouri--Rolla

Publication Date

1973

Pagination

vii, 92 pages

Note about bibliography

Includes bibliographical references (pages 79-81).

Rights

© 1973 William Edward McBride, All rights reserved.

Document Type

Dissertation - Restricted Access

File Type

text

Language

English

Library of Congress Subject Headings

Approximation theory
Chebyshev systems

Thesis Number

T 2989

Print OCLC #

6024528

Electronic OCLC #

913831905

Link to Catalog Record

Electronic access to the full-text of this document is restricted to Missouri S&T users. Otherwise, request this publication directly from Missouri S&T Library or contact your local library.

http://laurel.lso.missouri.edu/record=b1066875~S5

Share

 
COinS