Hostname: page-component-848d4c4894-hfldf Total loading time: 0 Render date: 2024-05-01T13:22:12.024Z Has data issue: false hasContentIssue false
  • English
  • Français

On a Parallel Implementation of the Mortar ElementMethod

Published online by Cambridge University Press:  15 August 2002

Gassav S. Abdoulaev ,
Yves Achdou ,
Yuri A. Kuznetsov  and
Christophe Prud'homme
Gassav S. Abdoulaev
Affiliation:
Institute of Numerical Mathematics, Russian Academy of Sciences, Ul. Gubkina 8, GSP-1, Moscow, Russia.
Yves Achdou
Affiliation:
INSA Rennes, 20 avenue des Buttes de Coesmes, 35043 Rennes, France and CMAP, École Polytechnique, 91128 Palaiseau Cedex, France. yves.achdou@insa-rennes.fr.
Yuri A. Kuznetsov
Affiliation:
Institute of Numerical Mathematics, Russian Academy of Sciences, Ul. Gubkina 8, GSP-1, Moscow, Russia.
Christophe Prud'homme
Affiliation:
ASCI, CNRS, Université Paris Sud, bâtiment 506, 91405 Orsay, France and INRIA Rocquencourt.
Get access

Abstract

We discuss a parallel implementation of the domain decomposition method based on the macro-hybrid formulation of a second order elliptic equation and on an approximation by the mortar element method. The discretization leads to an algebraic saddle- point problem. An iterative method with a block- diagonal preconditioner is used for solving the saddle- point problem. A parallel implementation of the method is emphasized. Finally the results of numerical experiments are presented.

Keywords

Domain decomposition; mortar finite element method; saddle-point problem; preconditioned iterative method; parallel computing.
Type
Research Article
Information
ESAIM: Mathematical Modelling and Numerical Analysis , Volume 33 , Issue 2 , March 1999 , pp. 245 - 259
Copyright
© EDP Sciences, SMAI, 1999

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)