Smoothed prolongation multigrid with rapid coarsening and massive smoothing. (Q415300): Difference between revisions

Assuming no regularity, it is impossible to improve the convergence of the multigrid method by adding more smoothing steps, i.e., rapid coarsening cannot be compensated by massive smoothing. The paper is concerned with a version of the algebraic multigrid method which consists in the rapid coarsening of the second grid as compared with the first, finest grid. As a consequence, the computation is very quickly moved to coarse grids and is very efficient. On the other hand, the price we have to pay for this advantage is a very massive smoothing of the prolongation operator. This idea was first published by the author (and his coauthors) for the two-grid method. In the present paper the author first formulates the algorithm of the multigrid method and then presents the convergence analysis. He employs simpler and more general tools. The method is analyzed for the V-cycle of the multigrid method and generalized. The principal statement of the paper is proven. The extension to W-cycle is apparent. A particular prolongation smoother is proposed. In conclusion, the author shows an application of the procedure presented to the regular multigrid method for a problem with an \(H_0^1\) equivalent norm.