Examples of the Best Piecewise Linear Approximation with Free Nodes
- 1 Downloads
The monograph published by E.Ya. Remez in 1957 addressed numerical methods with Chebyshev approximations. Particularly, the problem of the best uniform approximation of a function that is convex on an interval with continuous piecewise linear functions with free nodes was considered. In 1975, A.M. Vershik, V.N. Malozemov, and A.B. Pevnyi developed a general approach for constructing the best piecewise polynomial approximations with free nodes. The notion of partition with equal deviations was introduced, and it was found that such partition exists and generates the best piecewise polynomial approximation. In addition, a numerical method for constructing a partition with equal deviations was proposed. This paper gives three examples to describe the general approach to solving the problem of the best piecewise linear approximation with free nodes. In the case of an arbitrary continuous function, its best piecewise linear approximation in general is not continuous. It is continuous when approximating strictly convex and strictly concave functions.
KeywordsChebyshev approximations piecewise linear function partition with equal deviations
Unable to display preview. Download preview PDF.
- 2.V. N. Malozemov “Best piecewise polynomial approximation,” In: Selected Lectures on Extremal Problems (VVM, St. Petersburg, 2017), Vol. 2, pp. 316–325 [in Russian]. http://apmath. spbu.ru/cnsa/reps14.shtml#0424a. Accessed March 1, 2018.Google Scholar
- 3.V. F. Demyanov and V. N. Malozemov Introduction to Minimax (Nauka, Moscow, 1972; New York, Dover, 1990).Google Scholar
- 4.E. Ya. Remez, General Computational Methods of Chebyshev Approximation (Izd. Alad. Nauk Ukr. SSR, Kiev, 1957) [in Russian].Google Scholar