A Characterization of C(X) Among Algebras on Planar Sets by the Existence of a Finite Universal Korovkin System.
Page 1 Next
M. Pannenberg (1987)
Mathematische Annalen
Beg, Ismat (1999)
International Journal of Mathematics and Mathematical Sciences
Narang, T.D. (1986)
Publications de l'Institut Mathématique. Nouvelle Série
Samanta, Hora Krishna (1997)
International Journal of Mathematics and Mathematical Sciences
Gustavo Corach, Alejandra Maestripieri, Demetrio Stojanoff (2005)
Banach Center Publications
A positive operator A and a closed subspace of a Hilbert space ℋ are called compatible if there exists a projector Q onto such that AQ = Q*A. Compatibility is shown to depend on the existence of certain decompositions of ℋ and the ranges of A and . It also depends on a certain angle between A() and the orthogonal of .
W.H. Ling, H.W. McLaughlin, M.L. Smith (1976/1977)
Numerische Mathematik
H. Berens, M. Finzel (1990)
Numerische Mathematik
Kravvaritis, Dimitrie, Păltineanu, Gavriil (2004)
Abstract and Applied Analysis
Michael Pannenberg (1986)
Journal für die reine und angewandte Mathematik
Zajíček, L. (1984)
Proceedings of the 11th Winter School on Abstract Analysis
Jan Krzysztof Kowalski (1984)
Banach Center Publications
S. B. Stechkin (1989)
Banach Center Publications
Petr Gurka, Alois Kufner (1989)
Banach Center Publications
T. D. Narang (1982)
Matematički Vesnik
T. D. Narang (1985)
Matematički Vesnik
Khan, A.R., Hussain, N., Khan, L.A. (2000)
International Journal of Mathematics and Mathematical Sciences
Wolfgang Lusky (1979)
Studia Mathematica
T. D. Narang, Sangeeta (2010)
Publications de l'Institut Mathématique
Annalisa Buffa, Yvon Maday, Anthony T. Patera, Christophe Prud’homme, Gabriel Turinici (2012)
ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique
The convergence and efficiency of the reduced basis method used for the approximation of the solutions to a class of problems written as a parametrized PDE depends heavily on the choice of the elements that constitute the “reduced basis”. The purpose of this paper is to analyze the a priori convergence for one of the approaches used for the selection of these elements, the greedy algorithm. Under natural hypothesis on the set of all solutions to the problem obtained when the parameter varies, we...
Annalisa Buffa, Yvon Maday, Anthony T. Patera, Christophe Prud’homme, Gabriel Turinici (2012)
ESAIM: Mathematical Modelling and Numerical Analysis
The convergence and efficiency of the reduced basis method used for the approximation of the solutions to a class of problems written as a parametrized PDE depends heavily on the choice of the elements that constitute the “reduced basis”. The purpose of this paper is to analyze the a priori convergence for one of the approaches used for the selection of these elements, the greedy algorithm. Under natural hypothesis on the set of all solutions to the problem obtained when the parameter varies, we...
Page 1 Next