A dual iterative substructuring method with a penalty term
type: Item
instance of: scholarly article
title: A dual iterative substructuring method with a penalty term
zbMATH Open document ID: 1165.65078
author: Chang-Ock Lee
author: Eun-Hee Park
published in: Numerische Mathematik
publication date: 2009-05-05T00:00:00Z
review text: The authors consider an iterative substructuring method with Lagrangian multipliers for second order elliptic problems as a variant of the finite element tearing and interconnecting-dual penalty method. They design a dual iterative substructuring algorithm which deals with the continuity constraint across the interface in view of the augmented Lagrangian method. The saddle-point problem related to the augmented Lagrangian functional is reduced to the dual problem with Lagrange multipliers as unknowns.
reviewed by: Constantin Popa
Mathematics Subject Classification ID: 65N30
Mathematics Subject Classification ID: 65F10
Mathematics Subject Classification ID: 65N55
Mathematics Subject Classification ID: 35J25
zbMATH DE Number: 5550617
zbMATH Keywords: substructuring methods
zbMATH Keywords: Lagrangian multipliers
zbMATH Keywords: FETI-DP methods
zbMATH Keywords: second order elliptic problems
zbMATH Keywords: finite element tearing and interconnecting-dual penalty
zbMATH Keywords: saddle-point problem
MaRDI profile type: Publication
full work available at URL: s00211-008-0202-6
OpenAlex ID: W2201076023
cites work: Iterative Solution Methods
cites work: Preconditioning and Two-Level Multigrid Methods of Arbitrary Degree of Approximation
cites work: Incorporation of linear multipoint constraints in domain-decomposition-based iterative solvers. II: Blending FETI-DP and mortar methods and assembling floating substructures
cites work: Thevenin decomposition and large-scale optimization
cites work: The Construction of Preconditioners for Elliptic Problems by Substructuring. I
cites work: Q4253847
cites work: Q4814505
cites work: A method of finite element tearing and interconnecting and its parallel solution algorithm
cites work: NURBS approximation of surface / surface intersection curves
cites work: Q5588268
cites work: Q3038523
cites work: Finite Element Methods for Navier-Stokes Equations
cites work: Q3486792
cites work: Complexity of Parallel Implementation of Domain Decomposition Techniques for Elliptic Partial Differential Equations
cites work: Multiplier and gradient methods
cites work: Q4717947
cites work: Dual-Primal FETI Methods for Three-Dimensional Elliptic Problems with Heterogeneous Coefficients
cites work: Convergence of a substructuring method with Lagrange multipliers
cites work: On the convergence of a dual-primal substructuring method
cites work: Data communication in parallel architectures
cites work: Domain Decomposition with Nonmatching Grids: Augmented Lagrangian Approach
cites work: Q4825126
DOI: 10.1007/S00211-008-0202-6
description: scientific article; zbMATH DE number 5550617