1978SIAM Journal on Numerical AnalysisRequires access

On the Rate of Convergence of Discretization in Chebyshev Approximation

Bruce A. Chalmers

Open publisher page 8 citations

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.

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 8 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Mathematics, Approximation theory, Discretization, Minimax approximation algorithm, Equioscillation theorem, Interval (graph theory), Chebyshev filter, Muffin-tin approximation

Related papers

Back to paper searchBrowse research topicsOriginal source
On the Rate of Convergence of Discretization in Chebyshev Approximation — Research Paper | ScholarLens