Successive Generation of Chebychev Approximation Solution

[+] Author and Article Information
Masanao Aoki

Department of Engineering, University of California, Los Angeles, Calif.

J. Basic Eng 87(1), 17-22 (Mar 01, 1965) (6 pages) doi:10.1115/1.3650503 History: Received February 05, 1963; Online November 03, 2011


Problems of filtering and prediction, which are significant parts of many control problems, can be treated as those of data-fitting, usually by the method of least squares. Then, the least-square data-fitting is essentially the process by which a best approximate solution is obtained, in the sense of least squares of deviation, of a system of overdetermined linear equations. The same problem is known as the Chebychev approximation problem when the absolute deviation is used as the measure of goodness of approximation. The paper gives a recursive algorithm for the Chebychev approximation problem by modifying a nonrecursive algorithm of Zuhovickii and Stiefel. An example of estimation processes is given in which the Chebychev approximation method gives an estimate whose variance is smaller than that of the least square estimate.

Copyright © 1965 by ASME
Your Session has timed out. Please sign back in to continue.





Some tools below are only available to our subscribers or users with an online account.

Related Content

Customize your page view by dragging and repositioning the boxes below.

Related Journal Articles
Related eBook Content
Topic Collections

Sorry! You do not have access to this content. For assistance or to subscribe, please contact us:

  • TELEPHONE: 1-800-843-2763 (Toll-free in the USA)
  • EMAIL: asmedigitalcollection@asme.org
Sign In