{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/smoothers-based-on-nonoverlapping-domain","title":"Smoothers Based on Nonoverlapping Domain Decomposition Methods for $H(\\mathbf{curl})$ Problems: A Numerical Study","arxiv_id":"2209.01588","date":"2022-09-04","proceeding":null,"authors":["Duk-Soon Oh"],"abstract":"This paper presents a numerical study on multigrid algorithms of $V$-cycle type for problems posed in the Hilbert space $H(\\mathbf{curl})$ 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.","url_abs":"https://arxiv.org/abs/2209.01588v1","url_pdf":"https://arxiv.org/pdf/2209.01588v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"links_only","authors_date_abstract":"arXiv metadata, CC0 1.0 (https://info.arxiv.org/help/license), from the Kaggle arXiv metadata snapshot of 2026-09-12"},"code_links":[{"paper_slug":"smoothers-based-on-nonoverlapping-domain","repo_url":"https://github.com/duksoon-open/mg_nd","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers"},"arxiv_metadata":null,"syntology_extracted_results":null}