×
Zielke, Roland

Einige Eigenschaften schwacher Tschebyscheff-Systeme. (German) Zbl 0427.41020

J. Approximation Theory 25, 384-392 (1979).
Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page
scan of Zbl 0427.41020

Cited in 1 Review
Cited in 3 Documents

MSC:

41A65 Abstract approximation theory (approximation in normed linear spaces and other abstract spaces)
41A30 Approximation by other special function classes
41A50 Best approximation, Chebyshev systems

Keywords:

uniform approximation; weak Chebyshev systems
Cite Review PDF
Full Text: DOI

References:

[1] Cheney, E. W., Introduction to Approximation Theory (1966), McGraw-Hill: McGraw-Hill New York · Zbl 0161.25202
[2] Haar, A., Die Minkowskische Geometrie und die Annäherung an stetige Funktionen, Math. Ann., 78, 294-311 (1918) · JFM 46.0418.01
[3] Jones, R. C.; Karlovitz, L. A., Equioscillation under nonuniqueness in the approximation of continuous functions, J. Approximation Theory, 3, 138-145 (1970) · Zbl 0199.11701
[4] Karlin, S.; Studden, W. J., Tchebycheff Systems: With Applications in Analysis and Statistics (1966), Wiley: Wiley New York · Zbl 0153.38902
[5] Schönhage, A., Approximationstheorie (1971), W. de Gruyter: W. de Gruyter Berlin · Zbl 0212.41501
[6] Sommer, M.; Strauss, H., Eigenschaften von schwach Tschebyscheffschen Räumen, Institutsbericht Nr. 29 des Instituts für Angewandte Mathematik der Universität Erlangen (1976), März · Zbl 0374.41015
[7] Stockenberg, B., Zur Struktur von Čebyšev- und schwachen Čebyšev-Räumen, Dissertation (1976), Duisburg
[8] Zielke, R., On Transforming a Tchebyshev-system into a Markov-system, J. Approximation Theory, 9, 357-366 (1973) · Zbl 0273.41023
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.