CEMRACS 2012International audienceWe present here the generic parallel computational framework in C++ called Feel++ for the mortar finite element method with the arbitrary number of subdomain partitions in 2D and 3D. An iterative method with block-diagonal preconditioners is used for solving the algebraic saddle-point problem arising from the finite element discretization. Finally we present a scalability study and the numerical results obtained using Feel++ library
The framework of mortar methods [3,4] provides a powerful tool to analyze the coupling of different ...
AbstractThe combined finite–discrete element method (FDEM) belongs to a family of methods of computa...
This work documents two contributions to the parallel resolution of large systems of equations resul...
CEMRACS 2012International audienceWe present here the generic parallel computational framework in C+...
Targeting simulations on parallel hardware architectures, this paper presents computational kernels ...
International audienceWe discuss a parallel implementation of the domain decomposition method based ...
This thesis investigates domain decomposition methods, commonly classified as either overlapping Sch...
We discuss a parallel implementation of the domain decomposition method based on the macro-hybrid fo...
Thèse effectuée à l'ONERA: Office National d'Etudes et de Recherches Aerospatiales92322 ChatillonThe...
Summary. We consider elliptic problems with discontinuous coefficients discretized by finite element...
Summary. Mortar discretizations have been developed for coupling different ap-proximations in differ...
Abstract. The Finite Element Tearing and Interconnecting (FETI) method is an iterative sub-structuri...
In this paper, a three-level BDDC algorithm is developed for the solutions of large sparse algebraic...
International audienceWe build and analyze a substructuring preconditioner for the mortar method in ...
This is the published version, also available here: http://dx.doi.org/10.1137/07069081X.In this pape...
The framework of mortar methods [3,4] provides a powerful tool to analyze the coupling of different ...
AbstractThe combined finite–discrete element method (FDEM) belongs to a family of methods of computa...
This work documents two contributions to the parallel resolution of large systems of equations resul...
CEMRACS 2012International audienceWe present here the generic parallel computational framework in C+...
Targeting simulations on parallel hardware architectures, this paper presents computational kernels ...
International audienceWe discuss a parallel implementation of the domain decomposition method based ...
This thesis investigates domain decomposition methods, commonly classified as either overlapping Sch...
We discuss a parallel implementation of the domain decomposition method based on the macro-hybrid fo...
Thèse effectuée à l'ONERA: Office National d'Etudes et de Recherches Aerospatiales92322 ChatillonThe...
Summary. We consider elliptic problems with discontinuous coefficients discretized by finite element...
Summary. Mortar discretizations have been developed for coupling different ap-proximations in differ...
Abstract. The Finite Element Tearing and Interconnecting (FETI) method is an iterative sub-structuri...
In this paper, a three-level BDDC algorithm is developed for the solutions of large sparse algebraic...
International audienceWe build and analyze a substructuring preconditioner for the mortar method in ...
This is the published version, also available here: http://dx.doi.org/10.1137/07069081X.In this pape...
The framework of mortar methods [3,4] provides a powerful tool to analyze the coupling of different ...
AbstractThe combined finite–discrete element method (FDEM) belongs to a family of methods of computa...
This work documents two contributions to the parallel resolution of large systems of equations resul...