A note on degree of approximation by Nörlund and Riesz operators
P. Chandra (1990)
Matematički Vesnik
Similarity:
P. Chandra (1990)
Matematički Vesnik
Similarity:
K. Faulstich, W. Luh, L. Tomm (1981)
Manuscripta mathematica
Similarity:
Hans-Jürgen Schmeisser, Winfried Sickel (1989)
Banach Center Publications
Similarity:
Fernando Cobos (1988)
Colloquium Mathematicae
Similarity:
J. Prasad (1972)
Publications de l'Institut Mathématique [Elektronische Ressource]
Similarity:
R. Taberski (1977)
Annales Polonici Mathematici
Similarity:
Jiři Močkoř (1975)
Colloquium Mathematicae
Similarity:
Tulsi Dass Narang (1986)
Archivum Mathematicum
Similarity:
Albert Cohen (2009)
Bollettino dell'Unione Matematica Italiana
Similarity:
We discuss the performances of greedy algorithms for two problems of numerical approximation. The first one is the best approximation of an arbitrary function by an N-terms linear combination of simple functions adaptively picked within a large dictionary. The second one is the approximation of an arbitrary function by a piecewise polynomial function on an optimally adapted triangulation of cardinality N. Performance is measured in terms of convergence rate with respect to the number...
Czesław Olech (1968)
Colloquium Mathematicae
Similarity:
P. L. Papini (1987)
Matematički Vesnik
Similarity:
Stéphane Lozier, Damien Roy (2012)
Acta Arithmetica
Similarity:
R. B. Saxena (1962)
Annales Polonici Mathematici
Similarity: