betaFeedback

WorksMathematics

Geometric Multigrid Preconditioners for conforming Finite Element Methods on Arbitrarily Agglomerated Meshes

Abstract

Geometric multigrid methods for conforming finite element discretisations classically require a nested mesh hierarchy, forcing coarse meshes to be conforming, which is unsuitable for general domains. In order to eliminate this geometric constraint, we introduce and analyse a family of multilevel auxiliary space preconditioners. At the first level, a conforming Lagrangian discretisation on a fine simplicial mesh is preconditioned by a non-conforming polytopal discretisation posed on an arbitrarily agglomerated coarse mesh. At the subsequent levels, the coarse problem is solved by a geometric multigrid method for that polytopal discretisation on further agglomerated meshes, so that the whole hierarchy is generated from the fine mesh by agglomeration alone. We consider two polytopal discretisations, a symmetric interior penalty discontinuous Galerkin method and a hybrid high-order method. The prolongation operator at the first level is an element-wise interpolation onto the fine mesh followed by nodal averaging, preceded in the hybrid high-order case by a local potential reconstruction. For point-Jacobi and vertex-star patch additive Schwarz smoothers, we prove that the condition number of the preconditioned system is bounded by O((H/h)3)O((H/h)^3), where H/hH/h is the coarsening ratio, and by O((H/h)2)O((H/h)^2) for the DG variant with penalty proportional to H/hH/h. Numerical experiments in two and three dimensions, on structured and unstructured meshes with agglomerates generated by automatic clustering algorithms, confirm the robustness of the preconditioners.

Introduction

Geometric multigrid (GMG) methods are among the most efficient solvers for the large, sparse linear systems arising from the discretisation of partial differential equations (PDEs) [7, 24]. By exploiting a hierarchy of discretisations defined on progressively coarser meshes, they achieve optimal computational complexity, solving the system in a number of operations that scales linearly with the number of unknowns.

For classical finite element methods (FEMs), this efficiency comes at the price of a rigid geometric requirement. Classical GMG hierarchies consist of nested simplicial or cuboidal meshes, every level being a conforming mesh of the same element type. Such a hierarchy cannot in general be obtained by coarsening a given fine mesh; the union of a few simplices or cuboids is not a simplex or a cuboid. It has to be generated the other way round, by successive refinement of a coarse mesh. The fine mesh then inherits the geometry of its coarsest ancestor, and the domain boundary is resolved only to the accuracy of the coarsest mesh, which is impractical for general domains. Lifting this restriction requires non-nested hierarchies, which are not automatic either, since they involve unstructured mesh generation at every level, and which in turn demand the construction of intricate inter-level transfer operators [8]. Since the coarse and fine spaces are no longer nested, the transfer operators are L2L^2-projections between spaces defined on unrelated meshes. Evaluating them requires locating the fine cells overlapped by each coarse cell and integrating over their intersections, which amounts to building an auxiliary supermesh, a delicate and expensive task, especially in parallel.

Polytopal methods, that is methods supporting meshes whose cells are general polytopes with an arbitrary number of faces, do not have this difficulty. Since most agglomerations of a fine mesh yield an admissible coarser one, the hierarchy can be built from a single fine mesh by successive agglomeration. Multilevel solvers of this kind have been developed for Discontinuous Galerkin (DG) methods [3, 4], Virtual Element Method (VEM) [1] and Hybrid High-Order (HHO) methods [5]. Polytopal methods are, however, more expensive than their simplicial counterparts, whether because of a larger number of degrees of freedom (DOFs), as in DG methods, or because of a more involved formulation and assembly, as in VEM and HHO methods.

In this work we introduce a family of multilevel preconditioners. At the first level, a standard conforming Lagrangian finite element (FE) discretisation on the fine mesh is preconditioned by a non-conforming polytopal discretisation posed on an arbitrarily agglomerated coarse mesh. At the subsequent levels, the coarse problem is solved by an agglomeration-based GMG method for that polytopal discretisation, for DG the one of [3, 4] and for HHO the one of [5], so that the whole hierarchy is generated from the fine mesh by agglomeration alone. The convergence of these GMG solvers has already been analysed in the cited works, so only the first level needs to be analysed here. This is where the difficulty of transferring between a conforming and a non-conforming space lies. We analyse the two-level method for an arbitrary coarse solver, whose accuracy enters through two constants, and the bounds of the cited works then supply these constants for the GMG coarse solver. The fine mesh can thus be produced by a standard mesher, such as Gmsh [23], and discretised with a conforming method, which is the cheapest option on the finest and most expensive level, while the coarse mesh can be generated by any agglomeration strategy. The analysis uses the auxiliary space preconditioning theory [36, 37], and covers two polytopal coarse discretisations, a symmetric interior penalty Galerkin (SIPG) DG method and a statically condensed HHO method. The HHO results extend directly to the closely related Hybridizable Discontinuous Galerkin (HDG) [16] method, and vice versa. In all cases we prove that the preconditioned system has a condition number bounded independently of the mesh size for a fixed coarsening ratio H/hH/h, and we corroborate the theory with numerical experiments spanning a range of meshes and agglomeration levels.

Auxiliary space methods have classically been used in the opposite direction to the one proposed here, i.e. a non-conforming fine discretisation is preconditioned by a conforming auxiliary space defined on the same mesh. This is the setting of the seminal works on two-level additive Schwarz preconditioners for non-conforming FEMs [9, 30], later extended to C0C^0 interior penalty discretisations [11]. In these works, the transfer between the non-conforming and conforming spaces is provided by nodal averaging operators. Most solvers for non-conforming hybridised discretisations follow the same direction. Early multigrid methods for HDG problems recast the skeleton unknowns into bulk functions, so that a standard conforming piecewise-linear multigrid solver could be used [17]. The more recent homogeneous multigrid methods keep the hybrid discretisation at every level [18], but conformity is still needed. Their analysis rests on a compatibility condition between the hybrid discretisation and the space of continuous piecewise linear functions, which restricts the method to nested, geometrically conforming simplicial meshes and leaves the agglomerated case open. Such solvers give up the freedom in meshing that motivates hybridised and polytopal methods, and the same holds for the DG solvers built on conforming auxiliary spaces mentioned above. Here the fine problem is conforming, and it is the non-conformity of the auxiliary space that allows arbitrary agglomeration.

The closest relatives of our approach are the auxiliary space preconditioners of Kalchev and Vassilevski [26, 27], in which a conforming FE problem is preconditioned via non-conforming reformulations. Our construction differs in that the auxiliary problem is a standard polytopal discretisation, either SIPG or statically condensed HHO, equipped, in the HHO case, with high-order face spaces supported on non-planar agglomerate interfaces [38], and in that we prove condition number bounds that explicitly track the coarsening ratio H/hH/h. Our method can also be read as a geometric, high-order analogue of smoothed aggregation algebraic multigrid (SA-AMG) [12, 35], where the tentative prolongator and the algebraic prolongator-smoothing step are replaced by an exact polytopal reconstruction on geometric agglomerates followed by Oswald averaging.

The paper is organised as follows. Sect. 2 fixes the model problem and the conforming discretisation. Sect. 3 recalls the auxiliary space framework and reduces the condition number of the two-level preconditioner to three assumptions. Sect. 4 collects the analysis tools on polytopal elements and Sect. 5 the additive Schwarz smoothers. Sect. 6 and Sect. 7 verify the three assumptions for the DG and HHO coarse spaces, which gives the bound O((H/h)3)O((H/h)^3), and O((H/h)2)O((H/h)^2) for DG with penalty proportional to H/hH/h. Sect. 8 discusses the remaining ingredient, the coarse solver itself, for which agglomeration-based GMG methods are available in the literature. Sect. 9 reports the numerical experiments and Sect. 10 concludes.

Model problem and conforming discretisation

Let Ω⊂Rd\Omega\subset\mathbb{R}^{d}, d∈{2,3}d \in\{2,3\}, be a bounded Lipschitz polytopal domain with boundary ∂Ω\partial\Omega. Without loss of generality, we assume diam⁡(Ω)=1\operatorname{diam}(\Omega)=1. All hidden constants below are stated under this normalisation. We consider the Poisson problem with homogeneous Dirichlet boundary conditions:

−Δu=fin Ω,u=0on ∂Ω,-\Delta u = f \quad\text{in }\Omega,\qquad u=0 \quad\text{on }\partial\Omega,

where f∈L2(Ω)f \in L^{2}(\Omega) is a given source term.1 The weak formulation reads: find u∈H01(Ω)u \in H_{0}^{1}(\Omega) such that

a(u,v):=(∇u,∇v)Ω,ℓ(v):=(f,v)Ω,a(u,v)=ℓ(v)∀v∈H01(Ω).(1)a(u,v) := (\nabla u,\nabla v)_{\Omega},\qquad\ell(v) := (f,v)_{\Omega},\qquad a(u,v)=\ell(v)\quad\forall v \in H_{0}^{1}(\Omega). \tag*{(1)}

By the Lax-Milgram lemma, problem (1) admits a unique solution. Let Th\mathcal{T}_{h} be a conforming simplicial mesh of Ω\Omega, consisting of a set of disjoint open simplices tt with diameters ht=diam⁡(t)h_{t}=\operatorname{diam}(t), and let h=max⁡t∈Thhth=\max_{t\in\mathcal{T}_{h}}h_{t} denote the mesh size of the mesh Th\mathcal{T}_{h}. We assume that Th\mathcal{T}_{h} is shape-regular and quasi-uniform in the usual sense. We restrict the presentation to simplicial meshes and Lagrangian elements for simplicity. All results below extend to tensor-product (quadrilateral/hexahedral) meshes equipped with Qp\mathbb{Q}^{p} Lagrange elements, for which the nodal and trace arguments used in the analysis hold verbatim.

We denote by Fh\mathcal{F}_{h} the set of faces of the mesh Th\mathcal{T}_{h}, and by Fh(t)\mathcal{F}_{h}(t) the set of faces of an element t∈Tht\in\mathcal{T}_{h}. We also introduce the sets of interior and boundary faces as Fhi={f∈Fh:f⊂⊂Ω}\mathcal{F}_{h}^{\mathrm{i}}=\{f\in\mathcal{F}_{h}: f\subset\subset\Omega\} and Fhbd={f∈Fh:f⊂∂Ω}\mathcal{F}_{h}^{\mathrm{bd}}=\{f\in\mathcal{F}_{h}: f\subset\partial\Omega\}, respectively.

Given a geometric entity XX, e.g. tt or a planar face ff, let Pk(X)\mathbb{P}^{k}(X) denote the space of polynomials of total degree at most kk on XX. Similarly, given Xh\mathcal{X}_{h} a collection of geometrical entities, e.g. Th\mathcal{T}_{h}, Fh\mathcal{F}_{h}, we define Pk(Xh)=×X∈XhPk(X)\mathbb{P}^{k}(\mathcal{X}_{h})=\times_{X\in\mathcal{X}_{h}}\mathbb{P}^{k}(X) the broken polynomial space on each entity. For any measurable set XX, (⋅,⋅)X(\cdot,\cdot)_{X} represents the L2(X)L^{2}(X) inner product and ∥⋅∥X\|\cdot\|_{X} the associated norm. For a collection Xh\mathcal{X}_{h}, these are extended element-wise, (u,v)Xh=∑X∈Xh(u,v)X(u,v)_{\mathcal{X}_{h}}=\sum_{X\in\mathcal{X}_{h}}(u,v)_{X}. Given r≥0r\geq0 and a partition Xh\mathcal{X}_{h} of Ω\Omega (in this work, Th\mathcal{T}_{h} or TH\mathcal{T}_{H}), we use the broken norms and seminorms

∥v∥Hr(Xh)2:=∑X∈Xh∥v∥Hr(X)2,∣v∣Hr(Xh)2:=∑X∈Xh∣v∣Hr(X)2,\|v\|_{H^{r}(\mathcal{X}_{h})}^{2}:=\sum_{X\in\mathcal{X}_{h}}\|v\|_{H^{r}(X)}^{2},\qquad|v|_{H^{r}(\mathcal{X}_{h})}^{2}:=\sum_{X\in\mathcal{X}_{h}}|v|_{H^{r}(X)}^{2},

defined for functions that are only piecewise HrH^{r}-regular over Xh\mathcal{X}_{h}, with the convention ∣v∣H0(X)=∥v∥L2(X)|v|_{H^{0}(X)}=\|v\|_{L^{2}(X)}. We abbreviate ∣u∣1,X:=∣u∣H1(X)|u|_{1,X}:=|u|_{H^{1}(X)} and ∣u∣1,Xh:=∣u∣H1(Xh)|u|_{1,\mathcal{X}_{h}}:=|u|_{H^{1}(\mathcal{X}_{h})}.

Given a polynomial degree p≥1p\geq1, we consider the standard Lagrangian conforming space VhV_{h}, that is

Vh={vh∈H01(Ω):vh∣t∈Pp(t) for all t∈Th}.V_{h}=\{v_{h}\in H_{0}^{1}(\Omega):v_{h}|_{t}\in\mathbb{P}^{p}(t)\text{ for all }t\in\mathcal{T}_{h}\}.

The conforming finite element discretisation of (1) reads: find uh∈Vhu_{h}\in V_{h} such that

a(uh,vh)=ℓ(vh)∀vh∈Vh.a(u_{h},v_{h})=\ell(v_{h})\quad\forall v_{h}\in V_{h}.

We denote by Ah:Vh→VhA_{h}:V_{h}\to V_{h} the associated operator, characterised by a(uh,vh)=(Ahuh,vh)Ωa(u_{h},v_{h})=(A_{h}u_{h},v_{h})_{\Omega} for all uh,vh∈Vhu_{h},v_{h}\in V_{h}.

Auxiliary space preconditioners: abstract framework

For a given mesh Th\mathcal{T}_{h}, we define a coarse partition TH\mathcal{T}_{H}, given by non-overlapping agglomeration of elements of Th\mathcal{T}_{h}. That is, TH={T}\mathcal{T}_{H}=\{T\} is such that each T∈THT\in\mathcal{T}_{H} is a union of elements from Th\mathcal{T}_{h}. Here HT=diam⁡(T)H_{T}=\operatorname{diam}(T) denotes the diameter of each agglomerated element and H=max⁡T∈THHTH=\max_{T\in\mathcal{T}_{H}}H_{T} the mesh size of the partition.

Throughout this work, we make the following regularity assumptions on the coarse partition.

Assumption 3.1 (Coarse mesh regularity). There exists a constant cR>0c_{R}>0, independent of hh and HH, such that the coarse partition TH\mathcal{T}_{H} satisfies:

(i) Quasi-uniformity: cRH≤HT≤Hc_{R}H\leq H_{T}\leq H for all T∈THT\in\mathcal{T}_{H};

(ii) Star-shapedness: every T∈THT\in\mathcal{T}_{H} is star-shaped with respect to a ball of radius ρT≥cRHT\rho_{T}\geq c_{R}H_{T};

(iii) Simplicial covering: *there exists a covering TH#={K#}\mathcal{T}_{H}^{\#}=\{K^{\#}\} of TH\mathcal{T}_{H} by shape-regular dd-simplices such that, for every T∈THT\in\mathcal{T}_{H}, there is K#∈TH#K^{\#}\in\mathcal{T}_{H}^{\#} with T⊂K#T\subset K^{\#} and diam⁡(K#)≤cR−1HT\operatorname{diam}(K^{\#})\leq c_{R}^{-1}H_{T}.

Conditions (ii)–(iii) are the standard shape-regularity requirements for polytopal meshes [14]. Condition (ii) guarantees that the trace and Poincaré inequalities of Sect. 4 hold on the agglomerated elements with constants depending only on cRc_R, and that each agglomerate is connected. Conditions (ii) and (iii) together yield the inverse inequalities for polynomials on polytopal elements required by the coarse bilinear forms introduced in Sect. 6 and Sect. 7. The inverse inequality holds on the shape-regular simplex K♯K^{\sharp} supplied by condition (iii) and is transferred to TT using T⊂K♯T \subset K^{\sharp}, while condition (ii) is what allows the resulting L2(K♯)L^2(K^{\sharp}) norm to be brought back to TT.

Remark 3.2 (Mesh assumptions in practice). The agglomerates generated by the automatic clustering strategies used in Sect. 9 are not guaranteed to satisfy Assumption 3.1 uniformly. Star-shapedness, for instance, may fail for complicated agglomerate shapes. The numerical experiments therein indicate that the proposed preconditioners remain effective well beyond the setting covered by the analysis.

References

  1. [1]P. F. Antonietti, S. Berrone, M. Busetto and M. Verani. ‘Agglomeration-Based Geometric Multigrid Schemes for the Virtual Element Method’. In: SIAM Journal on Numerical Analysis 61.1 (2023), pp. 223–249. DOI: 10.1137/21M1466864.DOI
  2. [2]P. F. Antonietti, M. Corti and G. Martinelli. ‘Polytopal mesh agglomeration via geometrical deep learning for three-dimensional heterogeneous domains’. In: Mathematics and Computers in Simulation 241 (2026), pp. 335–353. DOI: 10.1016/j.matcom.2025.10.019.DOI
  3. [3]P. F. Antonietti, P. Houston, X. Hu, M. Sarti and M. Verani. ‘Multigrid algorithms for hp-version interior penalty discontinuous Galerkin methods on polygonal and polyhedral meshes’. In: Calcolo 54.4 (2017), pp. 1169–1198. DOI: 10.1007/s10092-017-0223-6.DOI
  4. [4]P. F. Antonietti, M. Sarti and M. Verani. ‘Multigrid Algorithms for hp-Discontinuous Galerkin Discretizations of Elliptic Problems’. In: SIAM Journal on Numerical Analysis 53.1 (2015), pp. 598–618. DOI: 10.1137/130947015.DOI
  5. [5]S. Badia and J. Manyer. Geometric Multigrid solvers for Hybrid High-Order methods on polytopal meshes. 2026. arXiv: 2603.00860 [math.NA].arxiv.org/abs/2603.00860
  6. [6]Z. Bar-Joseph, D. K. Gifford and T. S. Jaakkola. ‘Fast optimal leaf ordering for hierarchical clustering’. In: Bioinformatics 17.Suppl. 1 (2001), S22–S29. DOI: 10.1093/bioinformatics/17.suppl_1.s22.
  7. [7]J. H. Bramble and J. E. Pasciak. ‘New convergence estimates for multigrid algorithms’. In: Mathematics of Computation 49.180 (1987), pp. 311–329. DOI: 10.1090/S0025-5718-1987-0906174-X.DOI
  8. [8]J. H. Bramble, J. E. Pasciak and J. Xu. ‘The analysis of multigrid algorithms with nonnested spaces or noninherited quadratic forms’. In: Mathematics of Computation 56 (1991), pp. 1–34. DOI: 10.1090/S0025-5718-1991-1052086-4.DOI
  9. [9]S. C. Brenner. ‘Two-Level Additive Schwarz Preconditioners for Nonconforming Finite Element Methods’. In: Mathematics of Computation 65.215 (1996), pp. 897–921.DOI
  10. [10]S. C. Brenner and L. R. Scott. The Mathematical Theory of Finite Element Methods. 3rd ed. Vol. 15. Texts in Applied Mathematics. New York: Springer, 2008. DOI: 10.1007/978-0-387-75934-0.DOI
  11. [11]S. C. Brenner and K. Wang. ‘Two-level additive Schwarz preconditioners for C0 interior penalty methods’. In: Numer. Math. 102.2 (Dec. 2005), pp. 231–255. DOI: 10.1007/s00211-005-0641-2.DOI
  12. [12]M. Brezina and P. S. Vassilevski. ‘Smoothed aggregation spectral element agglomeration AMG: SA-ρAMGe’. In: Proceedings of the 8th International Conference on Large-Scale Scientific Computing. LSSC’11. Sozopol, Bulgaria: Springer-Verlag, 2011, pp. 3–15. DOI: 10.1007/978-3-642-29843-1_1.DOI
  13. [13]E. Burman and A. Ern. ‘Continuous Interior Penalty hp-Finite Element Methods for Advection and Advection-Diffusion Equations’. In: Mathematics of Computation 76.259 (2007), pp. 1119–1140.DOI
  14. [14]A. Cangiani, Z. Dong, E. H. Georgoulis and P. Houston. hp-Version Discontinuous Galerkin Methods on Polygonal and Polyhedral Meshes. SpringerBriefs in Mathematics. Springer International Publishing, 2017. DOI: 10.1007/978-3-319-67673-9.DOI
  15. [15]T. F. Chan and J. Zou. ‘Additive Schwarz domain decomposition methods for elliptic problems on unstructured meshes’. In: Numerical Algorithms 8 (1994), pp. 329–346. DOI: 10.1007/bf02142697.DOI
  16. [16]B. Cockburn, D. A. Di Pietro and A. Ern. ‘Bridging the Hybrid High-Order and Hybridizable Discontinuous Galerkin methods’. In: ESAIM: Math. Model. Numer. Anal. 50.3 (2016), pp. 635–650. DOI: 10.1051/m2an/2015051.DOI
  17. [17]B. Cockburn, O. Dubois, J. Gopalakrishnan and S. Tan. ‘Multigrid for an HDG method’. In: IMA Journal of Numerical Analysis 34.4 (2014), pp. 1386–1425. DOI: 10.1093/imanum/drt024.DOI
  18. [18]D. A. Di Pietro, Z. Dong, G. Kanschat, P. Matalon and A. Rupp. ‘Homogeneous multigrid for hybrid discretizations: application to HHO methods’. In: Numer. Methods Partial Differential Equations 41.5 (2025), e70023. DOI: 10.1002/num.70023.DOI
  19. [19]D. A. Di Pietro et al. ‘An H-Multigrid Method for Hybrid High-Order Discretizations’. In: SIAM Journal on Scientific Computing 43.5 (2021), S839–S861. DOI: 10.1137/20M1342471.DOI
  20. [20]D. A. Di Pietro and A. Ern. Mathematical Aspects of Discontinuous Galerkin Methods. Vol. 69. Mathematics et Applications. Heidelberg, Germany: Springer, 2012. DOI: 10.1007/978-3-642-22980-0.DOI
  21. [21]M. Dryja and P. Krzyżanowski. ‘A massively parallel nonoverlapping additive Schwarz method for discontinuous Galerkin discretization of elliptic problems’. In: Numerische Mathematik 132.2 (2016), pp. 347–367. DOI: 10.1007/s00211-015-0718-5.DOI
  22. [22]M. Feder, A. Cangiani and L. Heltai. ‘R3MG: R-tree based agglomeration of polytopal grids with applications to multilevel methods’. In: Journal of Computational Physics 526 (2025), p. 113773. DOI: 10.1016/j.jcp.2025.113773.DOI
  23. [23]C. Geuzaine and J.-F. Remacle. ‘Gmsh: A 3-D finite element mesh generator with built-in pre- and post-processing facilities’. In: International Journal for Numerical Methods in Engineering 79.11 (2009), pp. 1309–1331. DOI: 10.1002/nme.2579. eprint: https://onlinelibrary.wiley.com/doi/pdf/10.1002/nme.2579.DOI
  24. [24]W. Hackbusch. Multi-Grid Methods and Applications. Springer Series in Computational Mathematics. Springer Berlin, Heidelberg, 1985. DOI: 10.1007/978-3-662-02427-0.DOI
  25. [25]JuliaStats and Contributors. Clustering.jl: A Julia package for data clustering. https://github.com/JuliaStats/Clustering.jl. 2024.
  26. [26]D. Z. Kalchev and P. Vassilevski. ‘A Condensed Constrained Nonconforming Mortar-Based Approach for Preconditioning Finite Element Discretization Problems’. In: SIAM Journal on Scientific Computing 42.5 (2020), A3136–A3156. DOI: 10.1137/19M1305690. eprint: https://doi.org/10.1137/19M1305690.
  27. [27]D. Z. Kalchev and P. S. Vassilevski. ‘Auxiliary Space Preconditioning of Finite Element Equations Using a Nonconforming Interior Penalty Reformulation and Static Condensation’. In: SIAM Journal on Scientific Computing 42.3 (2020), A1741–A1764. DOI: 10.1137/19M1286815. eprint: https://doi.org/10.1137/19M1286815.
  28. [28]O. A. Karakashian and F. Pascal. ‘A Posteriori Error Estimates for a Discontinuous Galerkin Approximation of Second-Order Elliptic Problems’. In: SIAM Journal on Numerical Analysis 41.6 (2003), pp. 2374–2399. DOI: 10.1137/S0036142902405217. eprint: https://doi.org/10.1137/S0036142902405217.
  29. [29]P. Lu, A. Rupp and G. Kanschat. ‘Analysis of Injection Operators in Geometric Multigrid Solvers for HDG Methods’. In: SIAM Journal on Numerical Analysis 60.4 (2022), pp. 2293–2317. DOI: 10.1137/21M1400110.DOI
  30. [30]P. Oswald. ‘Preconditioners for nonconforming discretizations’. In: Math. Comput. 65.215 (July 1996), pp. 923–941. DOI: 10.1090/S0025-5718-96-00717-X.DOI
  31. [31]L. F. Pavarino. ‘Additive Schwarz methods for the p-version finite element method’. In: Numerische Mathematik 66.1 (1993), pp. 493–515. DOI: 10.1007/BF01385709.
  32. [32]D. A. D. Pietro and J. Droniou. The Hybrid High-Order Method for Polytopal Meshes: Design, Analysis, and Applications. Vol. 19. MS&A. Springer, 2020. DOI: 10.1007/978-3-030-37203-3.DOI
  33. [33]J. Schöberl, J. M. Melenk, C. Pechstein and S. Zaglmayr. ‘Additive Schwarz preconditioning for p-version triangular and tetrahedral finite elements’. In: IMA Journal of Numerical Analysis 28.1 (Jan. 2008), pp. 1–24. DOI: 10.1093/imanum/drm046. eprint: https://academic.oup.com/imanum/article-pdf/28/1/1/1964240/drm046.pdf.
  34. [34]A. Toselli and O. Widlund. Domain decomposition methods—algorithms and theory. Vol. 34. Springer Series in Computational Mathematics. Springer-Verlag, Berlin, 2005, pp. xvi+450. DOI: 10.1007/b137868.DOI
  35. [35]P. Vaněk, J. Mandel and M. Brezina. ‘Algebraic multigrid by smoothed aggregation for second and fourth order elliptic problems’. In: Computing 56.3 (1996), pp. 179–196. DOI: 10.1007/BF02238511.
  36. [36]J. Xu. ‘Iterative Methods by Space Decomposition and Subspace Correction’. In: SIAM Review 34.4 (1992), pp. 581–613. DOI: 10.1137/1034116.DOI
  37. [37]J. Xu. ‘The auxiliary space method and optimal multigrid preconditioning techniques for unstructured grids’. In: Computing 56.3 (1996), pp. 215–235. DOI: 10.1007/BF02238513.DOI
  38. [38]L. Yemm. ‘A New Approach to Handle Curved Meshes in the Hybrid High-Order Method’. In: Foundations of Computational Mathematics 24.3 (2024), pp. 1049–1076. DOI: 10.1007/s10208-023-09615-w.DOI

Paper details

vlnc:W_3eut3nek
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…
Contents