An h-multigrid method for Hybrid High-Order discretizations - Archive ouverte HAL Access content directly
Journal Articles SIAM Journal on Scientific Computing Year : 2021

An h-multigrid method for Hybrid High-Order discretizations

Abstract

We consider a second order elliptic PDE discretized by the Hybrid High-Order method, for which globally coupled unknowns are located at faces. To efficiently solve the resulting linear system, we propose a geometric multigrid algorithm that keeps the degrees of freedom on the faces at every grid level. The core of the algorithm lies in the design of the prolongation operator that passes information from coarse to fine faces through the reconstruction of an intermediary polynomial of higher degree on the cells. High orders are natively handled by the use of the same polynomial degree at every grid level. The proposed algorithm requires a hierarchy of meshes, non necessarily nested, such that the faces (and not only the elements) are successively coarsened. Numerical tests on homogeneous and heterogeneous diffusion problems show fast convergence, scalability in the mesh size and polynomial order, and robustness with respect to heterogeneity of the diffusion coefficient.
Fichier principal
Vignette du fichier
Multigrid_for_HHO.pdf (723.4 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02434411 , version 1 (10-01-2020)
hal-02434411 , version 2 (11-06-2020)
hal-02434411 , version 3 (18-05-2021)

Identifiers

Cite

Daniele Antonio Di Pietro, Frank Hülsemann, Pierre Matalon, Paul Mycek, Ulrich Rüde, et al.. An h-multigrid method for Hybrid High-Order discretizations. SIAM Journal on Scientific Computing, 2021, pp.S839-S861. ⟨10.1137/20M1342471⟩. ⟨hal-02434411v3⟩
434 View
257 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More