Approximation by solutions of general boundary value problems for elliptic equations of arbitrary order
Uwe Hamann, Günther Wildenhain (1987)
Banach Center Publications
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Uwe Hamann, Günther Wildenhain (1987)
Banach Center Publications
Similarity:
J. Prasad (1972)
Publications de l'Institut Mathématique [Elektronische Ressource]
Similarity:
Fernando Cobos (1988)
Colloquium Mathematicae
Similarity:
Jiři Močkoř (1975)
Colloquium Mathematicae
Similarity:
R. Taberski (1977)
Annales Polonici Mathematici
Similarity:
P. L. Papini (1987)
Matematički Vesnik
Similarity:
Zi-Xiao Yang, Bu-Xi Li (1990)
Compositio Mathematica
Similarity:
Stéphane Lozier, Damien Roy (2012)
Acta Arithmetica
Similarity:
E. Tarnawski (1956)
Fundamenta Mathematicae
Similarity:
R. B. Saxena (1962)
Annales Polonici Mathematici
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...