Theoretically supported scalable feti for numerical solution of variational inequalities

被引:26
作者
Dostal, Zdenek [1 ]
Horak, David
机构
[1] Tech Univ Ostrava, FEI VSB, CZ-70833 Ostrava, Czech Republic
[2] AS CR, Inst Geon, Ostrava, Czech Republic
关键词
domain decomposition; variational inequality; scalability; parallel algorithms; FETI; DOMAIN DECOMPOSITION METHOD; NATURAL COARSE-SPACE; OPTIMAL DUAL PENALTY; CONTACT PROBLEMS; AUGMENTED LAGRANGIANS; SUBSTRUCTURING METHOD; DP ALGORITHM; PART I; CONVERGENCE; SCALABILITY;
D O I
10.1137/050639454
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
The FETI method with a natural coarse grid is combined with recently proposed optimal algorithms for the solution of bound and/or equality constrained quadratic programming problems in order to develop a scalable solver for elliptic boundary variational inequalities such as those describing equilibrium of a system of bodies in mutual contact. A discretized model problem is first reduced by the duality theory of convex optimization to the quadratic programming problem with bound and equality constraints. The latter is then modified by means of orthogonal projectors to the natural coarse grid introduced by Farhat, Mandel, and Roux [Comput. Methods Appl. Mech. Engrg., 115 ( 1994), pp. 365-385]. Finally, the classical results on linear scalability for linear problems are extended to boundary variational inequalities. The results are validated by numerical experiments. The experiments also confirm that the algorithm enjoys the same parallel scalability as its linear counterpart.
引用
收藏
页码:500 / 513
页数:14
相关论文
共 42 条