The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
An efficient non-overlapping domain decomposition algorithm of Neumann-Neumann type for solving variational inequalities arising from the elliptic boundary value problems with inequality boundary conditions has been presented. The discretized problem is first turned by the duality theory of convex programming into a quadratic programming problem with bound and equality constraints and the latter is further modified by means of orthogonal projectors to the natural coarse space introduced recently by Farhat and Roux. The resulting problem is then solved by an augmented Lagrangian type algorithm with an outer loop for the Lagrange multipliers for the equality constraints and an inner loop for the solution of the bound constrained quadratic programming problems. The projectors are shown to guarantee an optimal rate of convergence of iterative solution of auxiliary linear problems. Reported theoretical results and numerical experiments indicate high numerical and parallel scalability of the algorithm.