...- Invarianten bei verallgemeinerten Carlesonmengen.
A priori convergence of the greedy algorithm for the parametrized reduced basis method
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...
A priori convergence of the Greedy algorithm for the parametrized reduced basis method
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...
A priori convergence of the Greedy algorithm for the parametrized reduced basis method
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...
A Remark on Periodic Tchebyshev Systems.
A solution of an old problem of Karamata.
A type of continuous projections
Abschätzungen linearer Durchmesser in Sobolev- und Besov-Räumen.
Approximation in metric linear spaces
Bicontractive projections in sequence spaces and a few related kinds of maps
Bivariate Spline Functions and the Approximation of Linear Functionals.
Density in approximation theory.
Density methods and results in approximation theory
Approximation theory and functional analysis share many common problems and points of contact. One of the areas of mutual interest is that of density results. In this paper we briefly survey various methods and results in this area starting from work of Weierstrass and Riesz, and extending to more recent times.
Discrete, Nonlinear Approximation Problems in Polyhedral Norms.
Discrete, Nonlinear Approximation Problems in Polyhedral Norms. A Levenberg-Like Algorithm.
Equivalent theorem on Lupaş operators.
Fundamental quadratic splines and applications
Kriterien erster und zweiter Ordnung für lokal beste Approximationen bei Problemen mit Nebenbedingungen. - On First and Second Order Conditions for Locally Best Approximations for Constraint Problems.
Kriterien zweiter Ordnung für lokal beste Approximationen.
Linear problems (with extended range) have linear optimal algorithms.