Convergence of a Penalty-Finite Element Approximation for an Obstacle Problem.
N. Kikuchi (1981)
Numerische Mathematik
Similarity:
N. Kikuchi (1981)
Numerische Mathematik
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...
Giuseppe Geymonat, Peter Oswald (1989)
Banach Center Publications
Similarity:
G. Opfer (1982)
Numerische Mathematik
Similarity:
Wanka, G., Krallert, U. (1999)
Zeitschrift für Analysis und ihre Anwendungen
Similarity:
O. P. Goyal (1965)
Matematički Vesnik
Similarity:
O. P. Goyal (1965)
Matematički Vesnik
Similarity:
Draganov, Borislav, Ivanov, Kamen (2007)
Serdica Mathematical Journal
Similarity:
2000 Mathematics Subject Classification: 46B70, 41A10, 41A25, 41A27, 41A35, 41A36, 42A10. The paper presents a method of relating two K-functionals by means of a continuous linear transform of the function. In particular, a characterization of various weighted K-functionals by unweighted fixed-step moduli of smoothness is derived. This is applied in estimating the rate of convergence of several approximation processes. Partially supported by grant No. 103/2007...
Popa, Emil C. (2002)
General Mathematics
Similarity:
Fernando Cobos (1988)
Colloquium Mathematicae
Similarity:
Bagh, Adib (2001)
Abstract and Applied Analysis
Similarity:
J. Prasad (1972)
Publications de l'Institut Mathématique [Elektronische Ressource]
Similarity:
Bellettini, G. (1997)
Journal of Convex Analysis
Similarity: