MétaCan
Menu
Back to cohort
Record W2597583775

Parallel fully coupled Schwarz preconditioners for saddle point problems.

2006· article· en· W2597583775 on OpenAlexaff
Feng‐Nan Hwang, Xiao Chuan Cai

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicMatrix Theory and Algorithms
Canadian institutionsToronto Metropolitan University
Fundersnot available
KeywordsSchwarz alternating methodAdditive Schwarz methodSaddle pointMathematicsSaddleApplied mathematicsMathematical optimizationGeometryDomain decomposition methodsFinite element methodEngineeringStructural engineering
DOInot available

Abstract

fetched live from OpenAlex

We study some parallel overlapping Schwarz preconditioners for solving Stokeslike problems arising from finite element discretization of incompressible flow problems. Most of the existing methods are based on the splitting of the velocity and pressure variables. With the splitting, fast solution methods are often constructed using various fast Poisson solvers for one of the variables. More recently, several papers have investigated the so-called fully coupled approaches in which the variables are not separated. The fully coupled approach has some advantages over the variable splitting method when solving Stokes-like equations with many variables, where a good splitting may be hard to obtain. In this paper we systematically study the parallel scalability of several versions of the fully coupled Schwarz method for both symmetric and nonsymmetric Stokeslike problems. We show numerically that the performance of a two-level method with a multiplicative iterative coarse solver is superior to the other variants of Schwarz preconditioners.

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.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.002
Version: metacan-v3-hybrid-931329e0061cValidation 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: Empirical · Consensus signal: none
Teacher disagreement score0.002
Threshold uncertainty score0.008

Distilled classifier scores by category (both heads)

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

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.011
GPT teacher head0.222
Teacher spread0.211 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations12
Published2006
Admission routes1
Has abstractyes

Explore more

Same topicMatrix Theory and AlgorithmsFrench-language works237,207