MétaCan
Menu
Back to cohort
Record W1772727535

Time-evolving interfaces in a Stokes flow

2001· book· en· W1772727535 on OpenAlexaff
Mary Catherine A. Kropinski

Bibliographic record

VenueNova Science Publishers, Inc. eBooks · 2001
Typebook
Languageen
FieldPhysics and Astronomy
TopicElectromagnetic Scattering and Analysis
Canadian institutionsSimon Fraser University
Fundersnot available
KeywordsBiharmonic equationDiscretizationStability (learning theory)Flow (mathematics)MathematicsStokes flowConstraint (computer-aided design)Interface (matter)Fast Fourier transformMathematical analysisFourier transformApplied mathematicsComputer scienceAlgorithmGeometryPhysicsMechanicsBoundary value problem
DOInot available

Abstract

fetched live from OpenAlex

We present new methods for computing the motion of two dimensional closed interfaces in a slow viscous flow. The interfacial velocity is found through the solution to an integral equation whose analytic formulation is based on complex-variable theory for the biharmonic equation. The numerical methods for solving the integral equations are spectrally accurate and employ a fast multipole-based iterative solution procedure, which requires only O(N) operations where N is the number of nodes in the discretisation of the interface. The interface is described spectrally, and we use evolution equations that preserve equal spacing in arclength of the marker points. A small-scale decomposition is performed to extract the dominant term in the evolution of the interface and we show that this dominant term leads to a CFL-type stability constraint. When in an equal arclength frame, this term is linear and we show that implicit time-integration schemes that are explicit in Fourier space can be formulated. We verify this analysis through several numerical examples.

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.000
metaresearch head score (Gemma)0.000
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.002
Threshold uncertainty score0.006

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.000
Science and technology studies0.0000.001
Scholarly communication0.0010.001
Open science0.0000.001
Research integrity0.0000.001
Insufficient payload (model declined to judge)0.0020.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.012
GPT teacher head0.239
Teacher spread0.227 · 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 designTheoretical or conceptual
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

Citations0
Published2001
Admission routes1
Has abstractyes

Explore more

Same venueNova Science Publishers, Inc. eBooksSame topicElectromagnetic Scattering and AnalysisFrench-language works237,207