On the convergence of an algorithm for rational Chebyshev approximation
Loading...
Authors
Franke, Richard H.
Subjects
Advisors
Date of Issue
1973-11
Date
1973-11
Publisher
Monterey, California. Naval Postgraduate School
Language
eng
Abstract
An algorithm for rational Chebyshev approximation based on computing the zeros of the error curve was investigated. At each iteration the proposed zeros are corrected by changing them toward the abscissa of the adjacent extreme of largest magnitude. The algorithm is formulated as a numerical solution of a certain system of ordinary differential equations. Convergence is obtained by showing the system is asymptotically stable at the zeros of the best approximation. With an adequate initial guess, the algorithm has never failed for functions which have a standard error curve. (
Type
Technical Report
Description
Series/Report No
Department
Identifiers
NPS Report Number
NPS-53Fe73111A
Sponsors
Foundation Research Program
Naval Postgraduate School
Funder
Format
Citation
Distribution Statement
Rights
This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.