. "3"^^ . "Durham University" . . . "RIV/61989100:27240/07:00015142" . "3"^^ . . "Sadowsk\u00E1, Marie" . "domain decomposition, boundary elements, variational inequality, scalability, BETI"@en . "27240" . . "Being concerned with a semicoercive 2D contact model problem, we firstly decompose the domain into disjunct subdomains and then we use the symmetric representation of the local Steklov - Poincar\u00E9 operator to get the weak formulation of our problem in the form of variational inequality. After a suitable approximation of the Steklov - Poincar\u00E9 operator, we use the Ritz method to obtain the quadratic programming problem with both equality and inequality constraints. We further switch to the dual problem and in order to improve the conditioning, we apply the so-called natural coarse grid. The resulting quadratic programming problem with bound and equality constraints is numerically solved by an algorithm based on semimonotonic augmented Lagrangians. Finally, we present experiments indicating the numerical scalability of the algorithm."@en . . . "2007-08-17+02:00"^^ . "Durham" . . "Durham" . "[11F6AB4CDCC3]" . "Bouchala, Ji\u0159\u00ED" . "Solving 2D Contact Problem by Boundary Element Tearing and Interconnecting Method"@en . . "Z(MSM6198910027)" . . . "Dost\u00E1l, Zden\u011Bk" . . "Proceedings of the 6th UK Conference on Boundary Integral Method" . . "978-0-9535558-3-3" . "450988" . "Solving 2D Contact Problem by Boundary Element Tearing and Interconnecting Method" . . . "8"^^ . "Solving 2D Contact Problem by Boundary Element Tearing and Interconnecting Method" . "RIV/61989100:27240/07:00015142!RIV11-MSM-27240___" . "Solving 2D Contact Problem by Boundary Element Tearing and Interconnecting Method"@en . . . . . "Being concerned with a semicoercive 2D contact model problem, we firstly decompose the domain into disjunct subdomains and then we use the symmetric representation of the local Steklov - Poincar\u00E9 operator to get the weak formulation of our problem in the form of variational inequality. After a suitable approximation of the Steklov - Poincar\u00E9 operator, we use the Ritz method to obtain the quadratic programming problem with both equality and inequality constraints. We further switch to the dual problem and in order to improve the conditioning, we apply the so-called natural coarse grid. The resulting quadratic programming problem with bound and equality constraints is numerically solved by an algorithm based on semimonotonic augmented Lagrangians. Finally, we present experiments indicating the numerical scalability of the algorithm." . .