Papers โบ Smoothers Based on Nonoverlapping Domain Decomposition Methods for H(๐๐ฎ๐ซ๐ฅ) Problems: A...
Smoothers Based on Nonoverlapping Domain Decomposition Methods for H(๐๐ฎ๐ซ๐ฅ) Problems: A Numerical Study
Duk-Soon Oh
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
This paper presents a numerical study on multigrid algorithms of V-cycle type for problems posed in the Hilbert space H(๐๐ฎ๐ซ๐ฅ) 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.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change ยท a person checks every report against the paper or source before anything changes; decisions are listed on /corrections