Original article: Projector preconditioning and transformation of basis in FETI-DP algorithms for contact problems

Authors:
Marta JarošOvá;Axel Klawonn;Oliver Rheinbach
Affiliations:
Department of Applied Mathematics, VŠB-Technical University of Ostrava, 17. Listopadu 15, 70833 Ostrava, Czech Republic;Fakultät für Mathematik, Universität Duisburg-Essen, Germany;Fakultät für Mathematik, Universität Duisburg-Essen, Germany
Venue:
Mathematics and Computers in Simulation
Year:
2012

Citing 9
Cited 1

Deflation of conjugate gradients with applications to boundary value problems

SIAM Journal on Numerical Analysis
Solving the Signorini problem on the basis of domain decomposition techniques

Computing
Dual-Primal FETI Methods for Three-Dimensional Elliptic Problems with Heterogeneous Coefficients

SIAM Journal on Numerical Analysis
Box Constrained Quadratic Programming with Proportioning and Projections

SIAM Journal on Optimization
Minimizing quadratic functions subject to bound constraints with the rate of convergence and finite termination

Computational Optimization and Applications
A Parallel Implementation of Dual-Primal FETI Methods for Three-Dimensional Linear Elasticity Using a Transformation of Basis

SIAM Journal on Scientific Computing
An Analysis of a FETI-DP Algorithm on Irregular Subdomains in the Plane

SIAM Journal on Numerical Analysis
Optimal Quadratic Programming Algorithms: With Applications to Variational Inequalities

Optimal Quadratic Programming Algorithms: With Applications to Variational Inequalities
A scalable FETI-DP algorithm for a coercive variational inequality

Applied Numerical Mathematics - Selected papers from the 16th Chemnitz finite element symposium 2003

Deflation, Projector Preconditioning, and Balancing in Iterative Substructuring Methods: Connections and New Results

SIAM Journal on Scientific Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Abstract: Two strategies, using edge averages, for FETI-DP (dual-primal finite element tearing and interconnecting) methods for contact problems are considered. The first one is a preconditioning technique by a conjugate projector, where the Lagrange multipliers corresponding to the variables of the coinciding edges are aggregated. The second one is an explicit transformation of basis introducing edge averages as new, additional primal variables. It is shown that both methods iterate in the same space and thus have the same rate of convergence. The theoretical result is confirmed by the solution of a model boundary variational inequality.