Numerical efficiency of modified modulus-based multigrid cycles with application to free boundary problems (Q2022270)

The author considers a free boundary problem which is formulated as a linear complementarity problem. This problem is discretized by means of a finite difference method. For solving the resulting discrete linear complementarity problem, the modified modulus-based multigrid method is used. The author proposes a modified V-cycle which is a combination of the W-cycle on the finer grids and a V-cycle on the coarser grids. The computational work of the V-cycle, the modified V-cycle, the W-cycle, and the F-cycle are analysed. It is shown by two numerical examples that the modified V-cycle, the F-cycle, and the W-cycle have a convergence rate which is grid-independent, whereas the convergence rate of the V-cycle depends on the number of grids. Furthermore, the CPU time of the modified V-cycle and the F-cycle, needed for solving the discrete problem with a prescribed accuracy, is less than that of the W-cycle.