Approximate interpolation by functions in a Haar space (Q909164): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q5573965 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3803111 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A constructive development of Chebyshev approximation theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A constructive analysis of the Remes algorithm / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3671621 / rank | |||
Normal rank |
Latest revision as of 12:26, 20 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Approximate interpolation by functions in a Haar space |
scientific article |
Statements
Approximate interpolation by functions in a Haar space (English)
0 references
1989
0 references
Let \(\{\phi_ 1,...,\phi_ n\}\) be a Chebyshev system in C(I), where I is a proper compact interval in R. In J. Approximation Theory 32, 257-270 (1981; Zbl 0472.41024)] the author proved that interpolation process can be performed approximately, with error at most \(\epsilon\), on a set of \(n+1\) distinct points of I, provided that set is sufficiently close to degenerating into an n-point one. The propose of this paper is to show how that approximate interpolation result can be substantially improved.
0 references
Haar space
0 references
totally bounded subset
0 references
Chebyshev system
0 references