International audienceWe build and analyze a substructuring preconditioner for the mortar method in the h-p finite element framework. Particular attention is given to the construction of the coarse component of the preconditioner in this framework, in which continuity at the cross points is not required. Two variants are proposed: the first one is an improved version of a coarse preconditioner already presented in [12]. The second is new and is built by using a Discontinuous Galerkin interior penalty method as coarse problem. A bound of the condition number is proven for both variants and their efficiency and scalability is illustrated by numerical experiments
Abstract. The Finite Element Tearing and Interconnecting (FETI) method is an iterative sub-structuri...
The mortar finite element method is a well-established method for the numerical solution of partial ...
summary:In this paper, we consider mortar-type Crouzeix-Raviart element discretizations for second o...
We propose and study an iterative substructuring method for an h-p Nitsche-type discretization, foll...
This thesis investigates domain decomposition methods, commonly classified as either overlapping Sch...
We propose and study an iterative substructuring method for an $$h$$h-$$p$$p Nitsche-type discretiza...
We analyse a class of preconditioners for the Mortar Method, based on substructuring. After splittin...
Large-scale finite element analysis often requires the iterative solution of equations with many unk...
In this article we consider the application of Schwarz-type domain decomposition preconditioners for...
In this article we consider the application of Schwarz-type domain decomposition preconditioners for...
CEMRACS 2012International audienceWe present here the generic parallel computational framework in C+...
We introduce a preconditioner based on a hierarchical low-rank compression scheme of Schur complemen...
AbstractIn this paper we give an overview on the definition of finite element spaces for the h-, p-,...
In this article we address the question of efficiently solving the algebraic linear system of equati...
Solving the linear elasticity and Stokes equations by an optimal domain decomposition method derived...
Abstract. The Finite Element Tearing and Interconnecting (FETI) method is an iterative sub-structuri...
The mortar finite element method is a well-established method for the numerical solution of partial ...
summary:In this paper, we consider mortar-type Crouzeix-Raviart element discretizations for second o...
We propose and study an iterative substructuring method for an h-p Nitsche-type discretization, foll...
This thesis investigates domain decomposition methods, commonly classified as either overlapping Sch...
We propose and study an iterative substructuring method for an $$h$$h-$$p$$p Nitsche-type discretiza...
We analyse a class of preconditioners for the Mortar Method, based on substructuring. After splittin...
Large-scale finite element analysis often requires the iterative solution of equations with many unk...
In this article we consider the application of Schwarz-type domain decomposition preconditioners for...
In this article we consider the application of Schwarz-type domain decomposition preconditioners for...
CEMRACS 2012International audienceWe present here the generic parallel computational framework in C+...
We introduce a preconditioner based on a hierarchical low-rank compression scheme of Schur complemen...
AbstractIn this paper we give an overview on the definition of finite element spaces for the h-, p-,...
In this article we address the question of efficiently solving the algebraic linear system of equati...
Solving the linear elasticity and Stokes equations by an optimal domain decomposition method derived...
Abstract. The Finite Element Tearing and Interconnecting (FETI) method is an iterative sub-structuri...
The mortar finite element method is a well-established method for the numerical solution of partial ...
summary:In this paper, we consider mortar-type Crouzeix-Raviart element discretizations for second o...