Towards robust, fast solutions of elliptic equations on complex domains through hybrid high‐order discretizations and non‐nested multigrid methods. (19th August 2021)

• Record Type: Journal Article
• Authors: Di Pietro, Daniele A.; Hülsemann, Frank; Matalon, Pierre; Mycek, Paul; Rüde, Ulrich; Ruiz, Daniel
• Is Part Of: International journal for numerical methods in engineering. Volume 122:Number 22(2021)
• Page Start: 6576
• Page End: 6595
• Publication Date: 2021-08-19
• Subjects: hybrid high‐order -- L2‐orthogonal projection -- multigrid -- non‐nested meshes -- partial differential equations; Numerical analysis -- Periodicals; Engineering mathematics -- Periodicals; 620.001518
• DOI: 10.1002/nme.6803
• Languages: English
• ISSNs: 0029-5981

Abstract

Abstract: The use of modern discretization technologies such as hybrid high‐order (HHO) methods, coupled with appropriate linear solvers, allow for the robust and fast solution of partial differential equations (PDEs). Although efficient linear solvers have recently been made available for simpler cases, complex geometries remain a challenge for large scale problems. To address this problem, we propose in this work a geometric multigrid algorithm for unstructured non‐nested meshes. The non‐nestedness is handled in the prolongation operator through the use of the L 2 ‐orthogonal projection from the coarse elements onto the fine ones. However, as the exact evaluation of this projection can be computationally expensive, we develop a cheaper approximate implementation that globally preserves the approximation properties of the L 2 ‐orthogonal projection. Additionally, as the multigrid method requires not only the coarsening of the elements, but also that of the faces, we leverage the geometric flexibility of polytopal elements to define an abstract non‐nested coarsening strategy based on element agglomeration and face collapsing. Finally, the multigrid method is tested on homogeneous and heterogeneous diffusion problems in two and three space dimensions. The solver exhibits near‐perfect asymptotic optimality for moderate degrees of approximation.