Solving the Signorini problem on the basis of domain decomposition techniques

From MaRDI portal
Publication:1265394


DOI10.1007/BF02684379zbMath0915.73077MaRDI QIDQ1265394

Joachim Schöberl

Publication date: 18 November 1998

Published in: Computing (Search for Journal in Brave)


65N55: Multigrid methods; domain decomposition for boundary value problems involving PDEs

65K10: Numerical optimization and variational techniques

74M15: Contact in solid mechanics

74P10: Optimization of other properties in solid mechanics

74A55: Theories of friction (tribology)


Related Items

An Optimization-Based Domain Decomposition Method for a Two-Body Contact Problem, Iteratively solving a kind of signorini transmission problem in a unbounded domain, Efficient contact solvers based on domain decomposition techniques., Augmented Lagrangian active set methods for obstacle problems, A preconditioner for a kind of coupled FEM-BEM variational inequality, Superrelaxation and the rate of convergence in minimizing quadratic functions subject to bound constraints, Uzawa block relaxation domain decomposition method for the two-body contact problem with Tresca friction, Scalable total BETI based algorithm for 3D coercive contact problems of linear elastostatics, An optimal algorithm for bound and equality constrained quadratic programming problems with bounded spectrum, A scalable FETI-DP algorithm for a semi-coercive variational inequality, FETI based algorithms for contact problems: Scalability, large displacements and 3D Coulomb friction, Domain decomposition for generalized unilateral semi-coercive contact problem with given friction in elasticity, Scalability and FETI based algorithm for large discretized variational inequalities, A scalable TFETI algorithm for two-dimensional multibody contact problems with friction, A scalable FETI-DP algorithm with non-penetration mortar conditions on contact interface, A scalable FETI-DP algorithm for a coercive variational inequality, Variationally consistent discretization schemes and numerical algorithms for contact problems



Cites Work