Abstract <p>Integrated domain decomposition multigrid methods (DDM-MG) for solving large systems of linear algebraic equations (SLAEs) with sparse symmetric or asymmetric matrices are considered. Such systems are obtained as a result of grid approximations of multidimensional boundary value problems. The proposed algorithms are based on the construction of single-layer or two-layer macrogrids and a special ordering of nodes according to their belonging to various topological primitives of the macrogrid: macronodes, macroedges, macrofaces, and subdomains. With a consistent numbering of vector components, the SLAE matrix in the three-dimensional case takes a block-tridiagonal form of the fourth order. To solve it, an iterative preconditioned method in Krylov subspaces is used. In this case, the solution of auxiliary systems in subdomains is carried out by multigrid methods of block incomplete factorization based on a similar topologically oriented ordering of nodes but at the microlevel rather than at the macrolevel, as a result of which a single preconditioner of a recursively nested type is formed. The justification of the proposed methods is carried out for matrices of the Stieltjes type.</p>