All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 13 Next

Displaying 241 – 260 of 540

Showing per page

A posteriori Error Estimates For the 3D Stabilized Mortar Finite Element Method applied to the Laplace Equation

Zakaria Belhachmi (2010)

ESAIM: Mathematical Modelling and Numerical Analysis

We consider a non-conforming stabilized domain decomposition technique for the discretization of the three-dimensional Laplace equation. The aim is to extend the numerical analysis of residual error indicators to this model problem. Two formulations of the problem are considered and the error estimators are studied for both. In the first one, the error estimator provides upper and lower bounds for the energy norm of the mortar finite element solution whereas in the second case, it also estimates...

A Posteriori Error Estimates on Stars for Convection Diffusion Problem

B. Achchab, A. Agouzal, K. Bouihat (2010)

Mathematical Modelling of Natural Phenomena

In this paper, a new a posteriori error estimator for nonconforming convection diffusion approximation problem, which relies on the small discrete problems solution in stars, has been established. It is equivalent to the energy error up to data oscillation without any saturation assumption nor comparison with residual estimator

A posteriori error estimates with post-processing for nonconforming finite elements

Friedhelm Schieweck (2002)

ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique

For a nonconforming finite element approximation of an elliptic model problem, we propose a posteriori error estimates in the energy norm which use as an additive term the “post-processing error” between the original nonconforming finite element solution and an easy computable conforming approximation of that solution. Thus, for the error analysis, the existing theory from the conforming case can be used together with some simple additional arguments. As an essential point, the property is exploited...

A posteriori Error Estimates with Post-Processing for Nonconforming Finite Elements

Friedhelm Schieweck (2010)

ESAIM: Mathematical Modelling and Numerical Analysis

For a nonconforming finite element approximation of an elliptic model problem, we propose a posteriori error estimates in the energy norm which use as an additive term the “post-processing error” between the original nonconforming finite element solution and an easy computable conforming approximation of that solution. Thus, for the error analysis, the existing theory from the conforming case can be used together with some simple additional arguments. As an essential point, the property is...

A posteriori error estimation for reduced-basis approximation of parametrized elliptic coercive partial differential equations : “convex inverse” bound conditioners

Karen Veroy, Dimitrios V. Rovas, Anthony T. Patera (2002)

ESAIM: Control, Optimisation and Calculus of Variations

We present a technique for the rapid and reliable prediction of linear-functional outputs of elliptic coercive partial differential equations with affine parameter dependence. The essential components are (i) (provably) rapidly convergent global reduced-basis approximations – Galerkin projection onto a space W N spanned by solutions of the governing partial differential equation at N selected points in parameter space; (ii) a posteriori error estimation – relaxations of the error-residual equation...

A Posteriori Error Estimation for Reduced-Basis Approximation of Parametrized Elliptic Coercive Partial Differential Equations: “Convex Inverse” Bound Conditioners

Karen Veroy, Dimitrios V. Rovas, Anthony T. Patera (2010)

ESAIM: Control, Optimisation and Calculus of Variations

We present a technique for the rapid and reliable prediction of linear-functional outputs of elliptic coercive partial differential equations with affine parameter dependence. The essential components are (i ) (provably) rapidly convergent global reduced-basis approximations – Galerkin projection onto a space WN spanned by solutions of the governing partial differential equation at N selected points in parameter space; (ii ) a posteriori error estimation – relaxations of the error-residual equation...

A preconditioner for the FETI-DP method for mortar-type Crouzeix-Raviart element discretization

Chunmei Wang (2014)

Applications of Mathematics

In this paper, we consider mortar-type Crouzeix-Raviart element discretizations for second order elliptic problems with discontinuous coefficients. A preconditioner for the FETI-DP method is proposed. We prove that the condition number of the preconditioned operator is bounded by ( 1 + log ( H / h ) ) 2 , where H and h are mesh sizes. Finally, numerical tests are presented to verify the theoretical results.

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

Currently displaying 241 – 260 of 540