A multilevel method with overcorrection by aggregation for solving discrete elliptic problems (Q1115160)

The multilevel algorithm with correction by aggregation for the solution of systems of linear equations arising from the discretization of partial differential equations is a special case of multigrid methods, where subspaces are generated rather by identification of unknowns then by some coarse grids. The algorithm is easy to implement, but the reduction of ``smooth'' error may be not very efficient. The author shows that the performance of the algorithm may be considerably improved if the correction is multiple by appropriate scalar factor. He gives the proof of convergence and Fourier analysis of asymptotic behaviour of the algorithm. The paper is supplied with numerical experiments and their discussion.