A scalable TFETI based algorithm for 2d and 3d frictionless contact problems

Authors:
Zdeněk Dostál;Tomáš Brzobohatý;Tomáš Kozubek;Alex Markopoulos;Vít Vondrák
Affiliations:
Department of Applied Mathematics, FEECS VŠB-Technical University of Ostrava, Ostrava, Czech Republic;Department of Mechanics, FME VŠB-Technical University of Ostrava, Ostrava, Czech Republic;Department of Applied Mathematics, FEECS VŠB-Technical University of Ostrava, Ostrava, Czech Republic;Department of Mechanics, FME VŠB-Technical University of Ostrava, Ostrava, Czech Republic;Department of Applied Mathematics, FEECS VŠB-Technical University of Ostrava, Ostrava, Czech Republic
Venue:
LSSC'09 Proceedings of the 7th international conference on Large-Scale Scientific Computing
Year:
2009

Citing 9
Cited 0

Solving the Signorini problem on the basis of domain decomposition techniques

Computing
Monotone Multigrid Methods on Nonmatching Grids for Nonlinear Multibody Contact Problems

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

Computational Optimization and Applications
Inexact Semimonotonic Augmented Lagrangians with Optimal Feasibility Convergence for Convex Bound and Equality Constrained Quadratic Programming

SIAM Journal on Numerical Analysis
An Optimal Algorithm for Bound and Equality Constrained Quadratic Programming Problems with Bounded Spectrum

Computing
Theoretically Supported Scalable FETI for Numerical Solution of Variational Inequalities

SIAM Journal on Numerical Analysis
Theoretically supported scalable BETI method for variational inequalities

Computing
Optimal Quadratic Programming Algorithms: With Applications to Variational Inequalities

Optimal Quadratic Programming Algorithms: With Applications to Variational Inequalities
Total FETI based algorithm for contact problems with additional non-linearities

Advances in Engineering Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

We report our recent results in the development of theoretically supported scalable algorithms for the solution of large scale complex contact problems of elasticity The algorithms combine the TFETI based domain decomposition method adapted to the solution of 2D and 3D frictionless multibody contact problems of elasticity with our in a sense optimal algorithms for the solution of the resulting quadratic programming problems Rather surprisingly, the theoretical results are qualitatively the same as the classical results on scalability of FETI for the linear elliptic problems The efficiency of the method is demonstrated by the results of numerical experiments with parallel solution of both coercive and semicoercive 2D and 3D contact problems.