"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.
Rigler, A. K.
Pyron, Howard D.
Penico, Anthony J., 1923-2011
Dekock, Arlan R.
Edwards, D. R.
Mathematics and Statistics
Ph. D. in Mathematics
National Science Foundation (U.S.)
University of Missouri--Rolla
vii, 92 pages
© 1973 William Edward McBride, All rights reserved.
Dissertation - Restricted Access
Library of Congress Subject Headings
Print OCLC #
Electronic OCLC #
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
McBride, William Edward, "Tchebycheff approximation on a discrete point set: algorithms old and new" (1973). Doctoral Dissertations. 252.
Share My Dissertation If you are the author of this work and would like to grant permission to make it openly accessible to all, please click the button above.