Displaying 21 – 40 of 425

Showing per page

A priori convergence of the greedy algorithm for the parametrized reduced basis method

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...

A priori convergence of the Greedy algorithm for the parametrized reduced basis method

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...

A priori convergence of the Greedy algorithm for the parametrized reduced basis method

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...

A result on best approximation in p -normed spaces

Abdul Latif (2001)

Archivum Mathematicum

We study best approximation in p -normed spaces via a general common fixed point principle. Our results unify and extend some known results of Carbone [ca:pt], Dotson [do:bs], Jungck and Sessa [ju:at], Singh [si:at] and many of others.

Almost ball remotal subspaces in Banach spaces

Tanmoy Paul (2012)

Studia Mathematica

We investigate almost ball remotal and ball remotal subspaces of Banach spaces. Several subspaces of the classical Banach spaces are identified having these properties. Some stability results for these properties are also proved.

Antiproximinal sets in the Banach space c ( X )

S. Cobzaş (1997)

Commentationes Mathematicae Universitatis Carolinae

If X is a Banach space then the Banach space c ( X ) of all X -valued convergent sequences contains a nonvoid bounded closed convex body V such that no point in C ( X ) V has a nearest point in V .

Currently displaying 21 – 40 of 425