MétaCan
Menu
Back to cohort
Record W1973223598 · doi:10.1080/00207160701576103

A parallel adaptive finite-element package based on ALBERTA

2008· article· en· W1973223598 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.

aboutThe title or abstract carries a Canadian signal from the geographic lexicon.
no affNo Canadian affiliation: this work is invisible to an affiliation-only frame.
No Canadian affiliation. An affiliation-only frame, the usual design, would never have seen this work. It is one of the works that make the case for inverting the frame.

Bibliographic record

VenueInternational Journal of Computer Mathematics · 2008
Typearticle
Languageen
FieldEngineering
TopicAdvanced Numerical Methods in Computational Mathematics
Canadian institutionsnot available
Fundersnot available
KeywordsScalabilityFinite element methodComputer scienceComputational scienceParallel computingComputationToolboxKey (lock)Adaptive mesh refinementDistributed memoryComputer engineeringAlgorithmShared memoryProgramming languageEngineering

Abstract

fetched live from OpenAlex

ALBERTA, a sequential adaptive finite-element toolbox, is being used widely in the fields of scientific and engineering computation, especially in the numerical simulation of electromagnetics. But the nature of sequentiality has become the bottle-neck while solving large scale problems. So we develop a parallel adaptive finite-element package based on ALBERTA, using ParMETIS and PETSc. The package is able to deal with any problem that ALBERT solved. Furthermore, it is suitable for distributed memory parallel computers including PC clusters. In this paper, we present the implementation of the package in detail, and address several key algorithms and strategies of parallelization. Finally, some numerical experiments are given to show the performance and scalability of our package.

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.191
Threshold uncertainty score0.745

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.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.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.037
GPT teacher head0.296
Teacher spread0.259 · 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