Scalability and FETI based algorithm for large discretized variational inequalities

DOI10.1016/S0378-4754(02)00088-5zbMath1015.65026OpenAlexW1974396656MaRDI QIDQ1861354

David Horák, Zdeněk Dostál

Publication date: 16 March 2003

Published in: Mathematics and Computers in Simulation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0378-4754(02)00088-5

zbMATH Keywords

algorithmvariational inequalitydomain decompositionnumerical experimentsparallel computation

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Variational inequalities (49J40) Parallel numerical computation (65Y05)

Related Items

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 ⋮ Superrelaxation and the rate of convergence in minimizing quadratic functions subject to bound constraints ⋮ A theoretically supported scalable TFETI algorithm for the solution of multibody 3D contact problems with friction ⋮ An algorithm for the numerical realization of 3D contact problems with Coulomb friction. ⋮ Preconditioned iteration for saddle-point systems with bound constraints arising in contact problems ⋮ Scalable TFETI algorithm for the solution of multibody contact problems of elasticity ⋮ Theoretically supported scalable BETI method for variational inequalities ⋮ FETI-based algorithms for modelling of fibrous composite materials with debonding ⋮ A scalable FETI-DP algorithm for a coercive variational inequality ⋮ A priori error estimates and an inexact primal-dual active set strategy for linear and quadratic finite elements applied to multibody contact problems ⋮ A primal--dual active set strategy for nonlinear multibody contact problems ⋮ A scalable FETI-DP algorithm with non-penetration mortar conditions on contact interface ⋮ FETI based algorithms for contact problems: Scalability, large displacements and 3D Coulomb friction ⋮ An optimal algorithm and superrelaxation for minimization of a quadratic function subject to separable convex constraints with applications ⋮ Semi-monotonic inexact augmented Lagrangians for quadratic programing with equality constraints ⋮ Variationally consistent discretization schemes and numerical algorithms for contact problems ⋮ A scalable FETI-DP algorithm for a semi-coercive variational inequality

Uses Software

• PETSc

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A class of iterative methods for finite element equations
• Solving the Signorini problem on the basis of domain decomposition techniques
• Augmented Lagrangians with adaptive precision control for quadratic programming with equality constraints
• Solution of contact problems by FETI domain decomposition with natural coarse space projections
• A numerically scalable domain decomposition method for the solution of frictionless contact problems
• A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
• An Unconventional Domain Decomposition Method for an Efficient Parallel Solution of Large-Scale Finite Element Systems
• Mixed and Hybrid Finite Element Methods
• On the Maximization of a Concave Quadratic Function with Box Constraints
• Box Constrained Quadratic Programming with Proportioning and Projections
• Augmented Lagrangians with Adaptive Precision Control for Quadratic Programming with Simple Bounds and Equality Constraints
• Duality-based domain decomposition with natural coarse-space for variational inequalities