On the Rate of Convergence of Discretization in Chebyshev Approximation
Bruce A. Chalmers
Abstract
Bruce A. Chalmers
Abstract
We compare complex or real linear Chebyshev approximation on a compact interval X with approximation on one of its closed subsets Y. We show that under suitable conditions the best approximation on X approaches the best approximation on X like $({\text{density of}}\,Y)^2 $. This indicates that we can obtain very good near best approximations on the interval by solving best approximation problems on subsets of the interval which contain only “small” numbers of points.
OpenAlex reports 8 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
We compare complex or real linear Chebyshev approximation on a compact interval X with approximation on one of its closed subsets Y. We show that under suitable conditions the best approximation on X approaches the best approximation on X like $({\text{density of}}\,Y)^2 $. This indicates that we can obtain very good near best approximations on the interval by solving best approximation problems on subsets of the interval which contain only “small” numbers of points.
Key concepts: Mathematics, Approximation theory, Discretization, Minimax approximation algorithm, Equioscillation theorem, Interval (graph theory), Chebyshev filter, Muffin-tin approximation