Tensor-product vertex patch smoothers for biharmonic problems
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866912439053844480 |
|---|---|
| author | Witte, Julius Cui, Cu Bonizzoni, Francesca Kanschat, Guido |
| author_facet | Witte, Julius Cui, Cu Bonizzoni, Francesca Kanschat, Guido |
| contents | 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. The multiplicative smoother shows superior performance in terms of solution efficiency, requiring fewer iterations. However, in three-dimensional cases, the additive smoother outperforms its multiplicative counterpart due to the latter's lower potential for parallelism. 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 percent. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2412_05082 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Tensor-product vertex patch smoothers for biharmonic problems Witte, Julius Cui, Cu Bonizzoni, Francesca Kanschat, Guido Numerical Analysis 65Y10, 65N55, 65N30, 74K20 G.1.8; D.1.3 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. The multiplicative smoother shows superior performance in terms of solution efficiency, requiring fewer iterations. However, in three-dimensional cases, the additive smoother outperforms its multiplicative counterpart due to the latter's lower potential for parallelism. 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 percent. |
| title | Tensor-product vertex patch smoothers for biharmonic problems |
| topic | Numerical Analysis 65Y10, 65N55, 65N30, 74K20 G.1.8; D.1.3 |
| url | https://arxiv.org/abs/2412.05082 |