Key points are not available for this paper at this time.
Enables fast uniform convergence for fourth-order elliptic PDEs via inexact solvers; leaves open validation across wider problem classes.
We discuss vertex patch smoothers as overlapping domain decomposition methods for fourth order elliptic partial differential equations. We show that they are numerically very efficient and yield high convergence rates. Furthermore, we discuss low rank tensor approximations for their efficient implementation. Our experiments demonstrate that the inexact local solver yields a method which converges fast and uniformly with respect to mesh refinement and polynomial degree. The multiplicative smoother shows superior performance in terms of solution efficiency, requiring fewer iterations in both two- and three-dimensional cases. Additionally, the solver infrastructure supports a mixed-precision approach, executing the multigrid preconditioner in single precision while performing the outer iteration in double precision, thereby increasing throughput by up to 70 %.
No takes yet. Share an insight, caveat, or question.
Witte et al. (2025) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: