Pith. Sign in

RECORD

Unified geometric multigrid algorithm for hybridized high-order finite element methods

Numerical Analysis · Submitted 24 Nov 2018

abstract compiled · 2026-09-23 · no language-model review

The authors' main claim Thanks to these operators, we completely avoid upscaling of parameters and no information regarding subgrid physics is explicitly required on coarse meshes.

how it is stated · asserted 1.00 read the record →

Comment (0) Read on arXiv ↗
Cite ▾
arXiv ID1811.09909 (version 1)
Pith IDUMLBQY4S, Pith's permanent record of this paper and its review
CitationSriramkrishnan Muralikrishnan, Tan Bui-Thanh, Tim Wildey. "Unified geometric multigrid algorithm for hybridized high-order finite element methods." arXiv:1811.09909 (2018). https://pith.science/paper/UMLBQY4S
Claim paper

The compiled record

The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.

Open the compiled record

Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-09-23: 1 request, 6,384 input tokens.

What the abstract itself states, as probabilities: claims first 0.04 · states limitation 0.43 · human participants 0.02 · controlled comparison 0.13 · randomized assignment 0.01 · states quantitative result 0.04 · compares with prior results 0.36 · mentions code or data availability 0.02.

The abstract, sentence by sentence

arXiv listing abstract v1. Results and the main claim are underlined; .

We consider a standard elliptic partial differential equation and propose a geometric multigrid algorithm based on Dirichlet-to-Neumann (DtN) maps for hybridized high-order finite element methods. The proposed unified approach is applicable to any locally conservative hybridized finite element method including multinumerics with different hybridized methods in different parts of the domain. For these methods, the linear system involves only the unknowns residing on the mesh skeleton, and constructing intergrid transfer operators is therefore not trivial. The key to our geometric multigrid algorithm is the physics-based energy-preserving intergrid transfer operators which depend only on the fine scale DtN maps. Thanks to these operators, we completely avoid upscaling of parameters and no information regarding subgrid physics is explicitly required on coarse meshes. Moreover, our algorithm is agglomeration-based and can straightforwardly handle unstructured meshes. We perform extensive numerical studies with hybridized mixed methods, hybridized discontinuous Galerkin method, weak Galerkin method, and a hybridized version of interior penalty discontinuous Galerkin methods on a range of elliptic problems including subsurface flow through highly heterogeneous porous media. We compare the performance of different smoothers and analyze the effect of stabilization parameters on the scalability of the multigrid algorithm.

background contribution method result interpretation main claim

What the classifier reports for each sentence. The number is the probability it gave the label.
#sentencerolethe authors' own workstates the main conclusionstrength
s0 We consider a standard elliptic partial differential equation and propose a geometric multigrid algorithm based on Dirichlet-to-Neumann (DtN) maps for hybridized high-order finite element methods. contribution 0.96 0.89 0.13 asserted 1.00
s1 The proposed unified approach is applicable to any locally conservative hybridized finite element method including multinumerics with different hybridized methods in different parts of the domain. contribution 0.91 0.42 0.11 asserted 1.00
s2 For these methods, the linear system involves only the unknowns residing on the mesh skeleton, and constructing intergrid transfer operators is therefore not trivial. background 0.84 0.23 0.03 asserted 1.00
s3 The key to our geometric multigrid algorithm is the physics-based energy-preserving intergrid transfer operators which depend only on the fine scale DtN maps. method 0.68 0.88 0.24 asserted 1.00
s4 Thanks to these operators, we completely avoid upscaling of parameters and no information regarding subgrid physics is explicitly required on coarse meshes. contribution 0.35 0.85 0.19 asserted 1.00
s5 Moreover, our algorithm is agglomeration-based and can straightforwardly handle unstructured meshes. method 0.62 0.68 0.06 asserted 0.97
s6 We perform extensive numerical studies with hybridized mixed methods, hybridized discontinuous Galerkin method, weak Galerkin method, and a hybridized version of interior penalty discontinuous Galerkin methods on a range of elliptic problems including subsurface flow through highly heterogeneous porous media. method 0.63 0.97 0.07 asserted 1.00
s7 We compare the performance of different smoothers and analyze the effect of stabilization parameters on the scalability of the multigrid algorithm. method 0.63 0.96 0.06 asserted 0.94

What kind of paper the classifier reports this is: method or tool 1.00 · evidence from simulation or computation 1.00.

What was examined, and what was not

sources read
  • arXiv listing abstract v1
not examined
  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers
levels run
  • P abstract
not run
  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. Every number in the measurements table is the authors', checked by code. Record as JSON

The paper
Original abstract

We consider a standard elliptic partial differential equation and propose a geometric multigrid algorithm based on Dirichlet-to-Neumann (DtN) maps for hybridized high-order finite element methods. The proposed unified approach is applicable to any locally conservative hybridized finite element method including multinumerics with different hybridized methods in different parts of the domain. For these methods, the linear system involves only the unknowns residing on the mesh skeleton, and constructing intergrid transfer operators is therefore not trivial. The key to our geometric multigrid algorithm is the physics-based energy-preserving intergrid transfer operators which depend only on the fine scale DtN maps. Thanks to these operators, we completely avoid upscaling of parameters and no information regarding subgrid physics is explicitly required on coarse meshes. Moreover, our algorithm is agglomeration-based and can straightforwardly handle unstructured meshes. We perform extensive numerical studies with hybridized mixed methods, hybridized discontinuous Galerkin method, weak Galerkin method, and a hybridized version of interior penalty discontinuous Galerkin methods on a range of elliptic problems including subsurface flow through highly heterogeneous porous media. We compare the performance of different smoothers and analyze the effect of stabilization parameters on the scalability of the multigrid algorithm.

Human review
How the literature uses it

3 arXiv papers cite this in 8 sentences

Each citing sentence is taken from the citing paper's LaTeX source and typed by Pith's classifier. A label appears at probability 0.8 or more (0.95 for support), a contest at 0.7 or more; the quoted words are the citing authors'. How each label was checked · JSON

Papers citing it · 2 sentences without a confident label

Compares with it 2 papers
Cites it as support 1 paper
  • This is also supported by our previous work on geometric multigrid methods [ref] for elliptic PDEs, where we compared few different smoothers and found block-Jacobi to be a competitive choice.

    A Multilevel Approach for Trace System in HDG Discretizations · Combining multilevel approaches with domain decomposition methods · 0.99

Cites it as background 2 papers

Discussion

Know something about this paper? Leave a comment, or highlight any passage above to comment on it.