Multigrid Methods for Anisotropic Edge Refinement

From MaRDI portal





The authors present a new multigrid algorithm on the base of the combination of the semicoarsening and line smoothers. This new scheme leads to a solver of optimal complexity for anisotropic meshes along the edges when finite element method is used for problems in nonsmooth three dimensional domains. The authors assume that the triangulations and the generated finite element spaces are nested. The computational domain studied can be presented as \(\Omega = G \times Z\), where \(\Omega\) is a polygonal domain in the plane (\(x\)-plane) and \(Z\) is a real interval. The proposed refinement strategy is to to perform firs refinement in the \(z\)-direction and then to generate the hierarchy of meshes by refinement in the \(x\)-plane. The smoother of the considered multigrid scheme is a line Jacobi or symmetric line Gauss-Seidel iteration along the mesh lines in the \(z\)-direction. The convergence of this scheme is analyzed using the multigrid framework of \textit{D. Braess} and \textit{W. Hackbush} [ibid. 20, 967--975 (1983; Zbl 0521.65079)]. Some numerical results are presented and discussed in order to demonstrate the performance of the proposed new algorithm. On the chosen three dimensional \(L\)-shaped domain the numerical tests have shown robust performance. Moreover, the number of iterations is independent of of the refinement depth (levels of refinement) and of the mesh in edge direction.











This page was built for publication: Multigrid Methods for Anisotropic Edge Refinement

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4785847)