NASA NTRS · 19670012885
Optimal control with Chebyshev minimax performance index
Explore connections, maps & timelines
Johnson, C. D.. 1967-04-01. Optimal control with Chebyshev minimax performance index. https://ntrs.nasa.gov/citations/19670012885
Cite the original work for its findings. Save a collection to share your selection of sources.
KEEP EXPLORING
The authors are concerned with the problem of finding among all polynomials of degree at most n and normalized to be 1 at c the one with minimal uniform norm on Epsilon. Here, Epsilon is a given ellipse with both foci on the real axis and c is a given real point not contained in Epsilon. Problems of this type arise in certain iterative matrix computations, and, in this context, it is generally believed and widely referenced that suitably normalized Chebyshev polynomials are optimal for such constrained approximation problems. In this note, the authors show that this is not true in general. Moreover, the authors derive sufficient conditions which guarantee that Chebyshev polynomials are optimal. Also, some numerical examples are presented.
Chebyshev approximations for Stumpff series of orders four and five
Optimal control of dynamic systems with minimax type performance index, discussing application of proposed method of solution