Smoothers Based on Nonoverlapping Domain Decomposition Methods for H(\mathbf{curl}) Problems: A Numerical Study

DOI10.12941/JKSIAM.2022.26.323zbMATH Open1508.65173arXiv2209.01588MaRDI QIDQ6409685FDOQ6409685

Authors: Duk-Soon Oh 

Publication date: 4 September 2022

Abstract: This paper presents a numerical study on multigrid algorithms of $V$-cycle type for problems posed in the Hilbert space $H(mathbfcurl)$ in three dimensions. The multigrid methods are designed for discrete problems originated from the discretization using the hexahedral N'{e}d'{e}lec edge element of the lowest-order. Our suggested methods are associated with smoothers constructed by substructuring based on domain decomposition methods of nonoverlapping type. Numerical experiments to demonstrate the robustness and the effectiveness of the suggested algorithms are also provided.

Mathematics Subject Classification ID

Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Preconditioners for iterative methods (65F08) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30)

This page was built for publication: Smoothers Based on Nonoverlapping Domain Decomposition Methods for $H(\mathbf{curl})$ Problems: A Numerical Study

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