A numerically scalable domain decomposition method for the solution of frictionless contact problems (Q2720000): Difference between revisions

@@ Property / cites work @@
+Formulation and analysis of conserving algorithms for frictionless dynamic contact/ impact problems
+Normal rank
@@ Property / cites work @@
+A mixed formulation for frictional contact problems prone to Newton like solution methods
+Normal rank
@@ Property / cites work @@
+A mathematical programming approach to three-dimensional contact problems with friction
+Normal rank
@@ Property / cites work @@
+Frictionless contact of elastic bodies by finite element method and mathematical programming technique
+Normal rank
@@ Property / cites work @@
+The conjugate gradient method for unilateral problems
+Normal rank
@@ Property / cites work @@
+Multiplier methods for engineering optimization
@@ Property / cites work: Multiplier methods for engineering optimization / rank @@
+Normal rank
@@ Property / cites work @@
+Various numerical methods for solving unilateral contact problems with friction
+Normal rank
@@ Property / cites work @@
+Modular analysis of assemblages of three-dimensional structures with unilateral contact conditions
+Normal rank
@@ Property / cites work @@
+An augmented lagrangian treatment of contact problems involving friction
+Normal rank
@@ Property / cites work @@
+Large scale applications on parallel computers of a mixed domain decomposition method
+Normal rank
@@ Property / cites work @@
+A method of finite element tearing and interconnecting and its parallel solution algorithm
+Normal rank
@@ Property / cites work @@
+Convergence of a substructuring method with Lagrange multipliers
+Normal rank
@@ Property / cites work @@
+The two-level FETI method for static and dynamic plate problems I: An optimal iterative solver for biharmonic systems
+Normal rank
@@ Property / cites work @@
+The two-level FETI method II: Extension to shell problems, parallel implementation and performance results
+Normal rank
@@ Property / cites work @@
+Theoretical comparison of the FETI and algebraically partitioned FETI methods, and performance comparisons with a direct sparse solver
+Normal rank