Abstract
Various methods for constructing algebraic multigrid type methods for solving multidimensional boundary-value problems are considered. Two-level iterative algorithms in Krylov subspaces based on approximating the Schur complement obtained by eliminating the edge nodes of the coarse grid are described on the example of two-dimensional rectangular grids. Some aspects of extending the methods proposed to the multilevel case, to nested triangular grids, and also to three-dimensional grids are discussed. A comparison with the classical multigrid methods based on using smoothing, restriction (aggregation), coarse-grid correction, and prolongation is provided. The efficiency of the algorithms suggested is demonstrated by numerical results for some model problems.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
