Multigrid Algorithms for the Solution of Linear Complementarity Problems Arising from Free Boundary Problems

Citations Over TimeTop 10% of 1983 papers

Abstract

Several free boundary problems (including saturated-unsaturated flow through porous dams, elastic-plastic torsion and cavitating journal bearings) can be formulated as linear complementarity problems of the following type: Find a nonnegative function u which satisfies prescribed boundary conditions on a given domain and which, furthermore, satisfies a linear elliptic equation at each point of the domain where u is greater than zero. We show that the multigrid FAS algorithm, which was developed by Brandt to solve boundary value problems for elliptic partial differential equations, can easily be adapted to handle linear complementarity problems. For large problems, the resulting algorithm, PFAS (projected full approximation scheme) is significantly faster than previous single-grid algorithms, since the computation time is proportional to the number of grid points on the finest grid. We then introduce two further multigrid algorithms, PFASMD and PFMG. PFASMD is a modification of PFAS which is considerably faster than PFAS. Using PFMG (projected full multigrid) it is possible to solve a linear complementarity problem to within truncation error using less work than the equivalent of seven Gauss–Seidel sweeps on the finest grid.

Related Papers

• → The extended linear complementarity problem(1995)100 cited
• → The Reduced Order Method for Solving the Linear Complementarity Problem with an M-Matrix(2022)1 cited
• → On characterizing linear complementarity problems as linear programs(1989)5 cited
• → Bi-Linear Complementarity Problem(2013)
• The Existence of Solution for Lcp(M,q)(2008)