MétaCan
Menu
Back to cohort
Record W4410907582 · doi:10.1002/nla.70023

Achieving h‐ and p‐Robust Monolithic Multigrid Solvers for the Stokes Equations

2025· article· en· W4410907582 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.
fundA Canadian funder is recorded on the work.

Bibliographic record

VenueNumerical Linear Algebra with Applications · 2025
Typearticle
Languageen
FieldEngineering
TopicAdvanced Numerical Methods in Computational Mathematics
Canadian institutionsMemorial University of Newfoundland
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsMultigrid methodMathematicsApplied mathematicsComputational scienceMathematical analysisPartial differential equation

Abstract

fetched live from OpenAlex

ABSTRACT The numerical analysis of higher order mixed finite‐element discretizations for saddle‐point problems, such as the Stokes equations, has been well‐studied in recent years. While the theory and practice of such discretizations is now well‐understood, the same cannot be said for efficient preconditioners for solving the resulting linear (or linearized) systems of equations. In this work, we propose and study variants of the well‐known Vanka relaxation scheme that lead to effective geometric multigrid preconditioners for both the conforming Taylor‐Hood discretizations and nonconforming ‐ discretizations of the Stokes equations. Numerical results demonstrate robust performance with respect to FGMRES iteration counts for increasing polynomial order for some of the considered discretizations and expose open questions about stopping tolerances for effectively preconditioned iterations at high polynomial order.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.190
Threshold uncertainty score0.479

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.023
GPT teacher head0.295
Teacher spread0.272 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it