We 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.
A parallel implementation of the Mortar Method in 2D and 3D
S Bertoluzza;M Pennacchio;
2013
Abstract
We 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.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
prod_286226-doc_113676.pdf
non disponibili
Descrizione: Parallel implementation
Tipologia:
Versione Editoriale (PDF)
Dimensione
531.26 kB
Formato
Adobe PDF
|
531.26 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
