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)




Related Items

Newton projection method as applied to assembly simulationOn the solution of convex QPQC problems with elliptic and other separable constraints with strong curvatureScalable total BETI based algorithm for 3D coercive contact problems of linear elastostaticsEngineering Multibody Contact Problems Solved by Scalable TBETIAn optimal algorithm for bound and equality constrained quadratic programming problems with bounded spectrumA projection iterative algorithm for the Signorini problem using the boundary element methodAugmented Lagrangian active set methods for obstacle problemsA preconditioner for a kind of coupled FEM-BEM variational inequalitySuperrelaxation and the rate of convergence in minimizing quadratic functions subject to bound constraintsScalable total BETI based solver for 3D multibody frictionless contact problems in mechanical engineeringSeparable spherical constraints and the decrease of a quadratic function in the gradient projection stepA scalable TFETI algorithm for two-dimensional multibody contact problems with frictionUzawa block relaxation domain decomposition method for the two-body contact problem with Tresca frictionIteratively solving a kind of signorini transmission problem in a unbounded domainProjector preconditioning and transformation of basis in FETI-DP algorithms for contact problemsA scalable FETI-DP algorithm for a coercive variational inequalityAn energy space finite element approach for elliptic Dirichlet boundary control problemsA scalable FETI-DP algorithm with non-penetration mortar conditions on contact interfaceFETI based algorithms for contact problems: Scalability, large displacements and 3D Coulomb frictionAn optimal algorithm and superrelaxation for minimization of a quadratic function subject to separable convex constraints with applicationsEfficient contact solvers based on domain decomposition techniques.Domain decomposition for generalized unilateral semi-coercive contact problem with given friction in elasticityAn Optimization-Based Domain Decomposition Method for a Two-Body Contact ProblemVariationally consistent discretization schemes and numerical algorithms for contact problemsA scalable FETI-DP algorithm for a semi-coercive variational inequalityScalability and FETI based algorithm for large discretized variational inequalities



Cites Work