Nodal Coarsening and Sparse Ideal Interpolation for H(curl) Problems in Algebraic Multigrid
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2026
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866915821515702272 |
|---|---|
| author | Shen, Taoli Brannick, James Falgout, Robert Kahl, Karsten Schroder, Jacob |
| author_facet | Shen, Taoli Brannick, James Falgout, Robert Kahl, Karsten Schroder, Jacob |
| contents | We propose a sparse interpolation construction and a practical coarsening algorithm for the algebraic multigrid (AMG) method, tailored towards H(curl). Building on the generalized AMG framework, we introduce an interior/exterior splitting that yields both a refinement-based and a fully algebraic construction of the interpolation. The refinement-based approach follows geometric hierarchy, while the purely algebraic interpolation is constructed through a coarsening process that first coarsens a nodal dual problem and then builds coarse and fine variables using a matching algorithm. We establish the weak approximation property and the commuting relation under certain assumptions. Combined with matching block smoothers, the proposed interpolation yields an effective algebraic multilevel method. Numerical experiments show robustness under strong coefficient jumps, where the proposed methods substantially outperform standard geometric multigrid. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2602_23613 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Nodal Coarsening and Sparse Ideal Interpolation for H(curl) Problems in Algebraic Multigrid Shen, Taoli Brannick, James Falgout, Robert Kahl, Karsten Schroder, Jacob Numerical Analysis We propose a sparse interpolation construction and a practical coarsening algorithm for the algebraic multigrid (AMG) method, tailored towards H(curl). Building on the generalized AMG framework, we introduce an interior/exterior splitting that yields both a refinement-based and a fully algebraic construction of the interpolation. The refinement-based approach follows geometric hierarchy, while the purely algebraic interpolation is constructed through a coarsening process that first coarsens a nodal dual problem and then builds coarse and fine variables using a matching algorithm. We establish the weak approximation property and the commuting relation under certain assumptions. Combined with matching block smoothers, the proposed interpolation yields an effective algebraic multilevel method. Numerical experiments show robustness under strong coefficient jumps, where the proposed methods substantially outperform standard geometric multigrid. |
| title | Nodal Coarsening and Sparse Ideal Interpolation for H(curl) Problems in Algebraic Multigrid |
| topic | Numerical Analysis |
| url | https://arxiv.org/abs/2602.23613 |