MétaCan
Menu
Back to cohort
Record W2097594141 · doi:10.1002/fld.662

Development of a fully coupled control‐volume finite element method for the incompressible Navier–Stokes equations

2004· article· en· W2097594141 on OpenAlexafffund
Idriss Ammara, Christian Masson

Bibliographic record

VenueInternational Journal for Numerical Methods in Fluids · 2004
Typearticle
Languageen
FieldEngineering
TopicAdvanced Numerical Methods in Computational Mathematics
Canadian institutionsÉcole de Technologie Supérieure
FundersNatural Sciences and Engineering Research Council of CanadaCanada Research ChairsCanadian Natural Resources Limited
KeywordsFinite element methodDiscretizationMathematicsLinearizationApplied mathematicsFinite volume methodCompressibilityLinear systemPressure-correction methodRobustness (evolution)System of linear equationsMathematical optimizationNonlinear systemMathematical analysisMechanicsPhysics

Abstract

fetched live from OpenAlex

Abstract This paper proposes and investigates fully coupled control‐volume finite element method (CVFEM) for solving the two‐dimensional incompressible Navier–Stokes equations. The proposed method borrows many of its features from the segregated CVFEM described by Baliga et al. Thus finite‐volume discretization is employed on a colocated grid using either the MAW or the FLO schemes and an element‐by‐element assembling procedure is applied for the construction of the discretizations equations. In this paper, and unlike the case for most fully coupled formulations available in the literature, the Poisson pressure equation has been retained from the segregated approach. The use of a pressure equation leads to an unfavourable size increase of the fully coupled linear system, but significantly improves the system's conditioning. The fully coupled system obtained is solved using an ILUT preconditioned GMRES algorithm. The other important element in this paper is the proposal of a Newton linearization of the convection terms in lieu of the common Picard iteration procedure. A systematic comparison between two segregated and four fully coupled fomulations has been presented which has allowed for an evaluation of the individual benefits and strengths of the coupling and linearization procedure by studying lid‐driven cavity problems and flows past a circular cylinder. All coupled formulations have proven to be significantly superior both in robustness and efficiency, as compared with the segregated formulation. In some circumstances, the coupled methods yield a converged solution of the system of discretized equations constructed using the FLO scheme, while the segregated formulations diverge. Compared to Picard's linearization, Newton's linearization is more efficient at reducing the number of iterations needed to converge, but requires more computational effort per iteration from the linear equation solver. Furthermore, the Jacobian matrix should include contributions from the nonlinearity appearing at both the governing‐equation level and the interpolation‐scheme level to ensure Newton's method convergence. The key element in guaranteeing successful, fully coupled solutions lies in the use of an efficient linear equation solver and preconditioner. Copyright © 2004 John Wiley & Sons, Ltd.

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.001
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: Methods · Consensus signal: Methods
Teacher disagreement score0.004
Threshold uncertainty score0.008

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.001
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0000.000
Science and technology studies0.0000.001
Scholarly communication0.0010.001
Open science0.0020.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.053
GPT teacher head0.430
Teacher spread0.377 · 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
GenreMethods

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

Citations30
Published2004
Admission routes2
Has abstractyes

Explore more

Same venueInternational Journal for Numerical Methods in FluidsSame topicAdvanced Numerical Methods in Computational MathematicsFrench-language works237,207