A scalable TFETI algorithm for two-dimensional multibody contact problems with friction
From MaRDI portal
Publication:1959466
DOI10.1016/j.cam.2010.05.042zbMath1248.74039MaRDI QIDQ1959466
Publication date: 7 October 2010
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2010.05.042
65N55: Multigrid methods; domain decomposition for boundary value problems involving PDEs
74M10: Friction in solid mechanics
74M15: Contact in solid mechanics
74S05: Finite element methods applied to problems in solid mechanics
74H15: Numerical approximation of solutions of dynamical problems in solid mechanics
65N30: Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs
Related Items
Optimal iterative QP and QPQC algorithms, A theoretically supported scalable TFETI algorithm for the solution of multibody 3D contact problems with friction, A domain decomposition method for two-body contact problems with Tresca friction, Quasistatic normal-compliance contact problem of visco-elastic bodies with Coulomb friction implemented by QP and SGBEM, Scalable total BETI based solver for 3D multibody frictionless contact problems in mechanical engineering, The R-linear convergence rate of an algorithm arising from the semi-smooth Newton method applied to 2D contact problems with friction, Engineering Multibody Contact Problems Solved by Scalable TBETI, On Domain Decomposition Algorithms for Contact Problems with Tresca Friction
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The FETI family of domain decomposition methods for inequality-constrained quadratic programming: application to contact problems with conforming and nonconforming interfaces
- An optimal algorithm for bound and equality constrained quadratic programming problems with bounded spectrum
- Optimal quadratic programming algorithms. With applications to variational inequalities
- Solution of variational inequalities in mechanics
- Solving the Signorini problem on the basis of domain decomposition techniques
- Monotone multigrid methods for elliptic variational inequalities. I
- An algorithm for the numerical realization of 3D contact problems with Coulomb friction.
- Implementation of the fixed point method in contact problems with Coulomb friction based on a dual splitting type technique
- Minimizing quadratic functions subject to bound constraints with the rate of convergence and finite termination
- FETI based algorithms for contact problems: Scalability, large displacements and 3D Coulomb friction
- Solution of contact problems by FETI domain decomposition with natural coarse space projections
- A localized version of the method of Lagrange multipliers and its applications
- A numerically scalable domain decomposition method for the solution of frictionless contact problems
- Approximation of the signorini problem with friction, obeying the coulomb law
- A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
- Monotone multigrid methods based on element agglomeration coarsening away from the contact boundary for the Signorini's problem
- Total FETI-an easier implementable variant of the FETI method for numerical solution of elliptic PDE
- On the Multiscale Solution of Constrained Minimization Problems
- Scalable TFETI algorithm for the solution of multibody contact problems of elasticity
- An Unconventional Domain Decomposition Method for an Efficient Parallel Solution of Large-Scale Finite Element Systems
- Box Constrained Quadratic Programming with Proportioning and Projections
- Monotone Multigrid Methods on Nonmatching Grids for Nonlinear Multibody Contact Problems
- Theoretically Supported Scalable FETI for Numerical Solution of Variational Inequalities
- Inexact Semimonotonic Augmented Lagrangians with Optimal Feasibility Convergence for Convex Bound and Equality Constrained Quadratic Programming
- Discretization methods and iterative solvers based on domain decomposition
- Efficient contact solvers based on domain decomposition techniques.
- Adaptive multigrid methods for Signorini's problem in linear elasticity.
