Displaying similar documents to “On multipoint constraints in FETI methods”

Some practical aspects of parallel adaptive BDDC method

Šístek, Jakub, Mandel, Jan, Sousedík, Bedřich

Similarity:

We describe a parallel implementation of the Balancing Domain Decomposition by Constraints (BDDC) method enhanced by an adaptive construction of coarse problem. The method is designed for numerically difficult problems, where standard choice of continuity of arithmetic averages across faces and edges of subdomains fails to maintain the low condition number of the preconditioned system. Problems of elasticity analysis of bodies consisting of different materials with rapidly changing stiffness...

A quasi-dual Lagrange multiplier space for serendipity mortar finite elements in 3D

Bishnu P. Lamichhane, Barbara I. Wohlmuth (2010)

ESAIM: Mathematical Modelling and Numerical Analysis

Similarity:

Domain decomposition techniques provide a flexible tool for the numerical approximation of partial differential equations. Here, we consider mortar techniques for quadratic finite elements in 3D with different Lagrange multiplier spaces. In particular, we focus on Lagrange multiplier spaces which yield optimal discretization schemes and a locally supported basis for the associated constrained mortar spaces in case of hexahedral triangulations. As a result, standard efficient iterative...

A Comparison of Dual Lagrange Multiplier Spaces for Mortar Finite Element Discretizations

Barbara I. Wohlmuth (2010)

ESAIM: Mathematical Modelling and Numerical Analysis

Similarity:

Domain decomposition techniques provide a powerful tool for the numerical approximation of partial differential equations. We focus on mortar finite element methods on non-matching triangulations. In particular, we discuss and analyze dual Lagrange multiplier spaces for lowest order finite elements. These non standard Lagrange multiplier spaces yield optimal discretization schemes and a locally supported basis for the associated constrained mortar spaces. As a consequence, standard...

An asynchronous three-field domain decomposition method for first-order evolution problems

Krupička, Lukáš, Beneš, Michal

Similarity:

We present an asynchronous multi-domain time integration algorithm with a dual domain decomposition method for the initial boundary-value problems for a parabolic equation. For efficient parallel computing, we apply the three-field domain decomposition method with local Lagrange multipliers to ensure the continuity of the primary unknowns at the interface between subdomains. The implicit method for time discretization and the multi-domain spatial decomposition enable us to use different...

Penalties, Lagrange multipliers and Nitsche mortaring

Christian Grossmann (2010)

Discussiones Mathematicae, Differential Inclusions, Control and Optimization

Similarity:

Penalty methods, augmented Lagrangian methods and Nitsche mortaring are well known numerical methods among the specialists in the related areas optimization and finite elements, respectively, but common aspects are rarely available. The aim of the present paper is to describe these methods from a unifying optimization perspective and to highlight some common features of them.

New trends in coupled simulations featuring domain decomposition and metacomputing

Philippe d'Anfray, Laurence Halpern, Juliette Ryan (2010)

ESAIM: Mathematical Modelling and Numerical Analysis

Similarity:

In this paper we test the feasibility of coupling two heterogeneous mathematical modeling integrated within two different codes residing on distant sites. A prototype is developed using Schwarz type domain decomposition as the mathematical tool for coupling. The computing technology for coupling uses a environment to implement a distributed client-server programming model. Domain decomposition methods are well suited to reducing complex physical phenomena into a sequence of parallel...