Kim, Hwanho; Xu, Jinchao; Zikatanov, Ludmil Uniformly convergent multigrid methods for convection–diffusion problems without any constraint on coarse grids. (English) Zbl 1039.65090 Adv. Comput. Math. 20, No. 4, 385-399 (2004). Summary: We construct a class of multigrid methods for convection-diffusion problems. The proposed algorithms use first order stable monotone schemes to precondition the second order standard Galerkin finite element discretization. To speed up the solution process of the lower order schemes, cross-wind-block reordering of the unknowns is applied. A V-cycle iteration, based on these algorithms, is then used as a preconditioner in the generalized minimal residual method. The numerical examples show that this method is convergent without imposing any constraint on the coarsest grid and the convergence of the preconditioned method is uniform. Cited in 7 Documents MSC: 65N55 Multigrid methods; domain decomposition for boundary value problems involving PDEs 65N15 Error bounds for boundary value problems involving PDEs 35J25 Boundary value problems for second-order elliptic equations 65F10 Iterative numerical methods for linear systems 65F35 Numerical computation of matrix norms, conditioning, scaling 65N12 Stability and convergence of numerical methods for boundary value problems involving PDEs 65N30 Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs Keywords:nonsymmetric and indefinite problems; convection-diffusion equations; multigrid method; monotone finite element scheme; EAFE scheme; normal equation; GMRES; preconditioning; algorithms; Galerkin finite element discretization; V-cycle iteration; generalized minimal residual method; numerical examples; convergence PDFBibTeX XMLCite \textit{H. Kim} et al., Adv. Comput. Math. 20, No. 4, 385--399 (2004; Zbl 1039.65090) Full Text: DOI