MétaCan
Menu
Back to cohort
Record W1965444722 · doi:10.1090/s0025-5718-06-01821-7

Optimal 𝐶² two-dimensional interpolatory ternary subdivision schemes with two-ring stencils

2006· article· en· W1965444722 on OpenAlexafffund
Bin Han, Rong-Qing Jia

Bibliographic record

VenueMathematics of Computation · 2006
Typearticle
Languageen
FieldEngineering
TopicAdvanced Numerical Analysis Techniques
Canadian institutionsUniversity of Alberta
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsMathematicsQuadrilateralExponentSmoothnessSubdivisionTernary operationCombinatoricsUniform normMathematical analysisGeometryFinite element method

Abstract

fetched live from OpenAlex

For any interpolatory ternary subdivision scheme with two-ring stencils for a regular triangular or quadrilateral mesh, we show that the critical Hölder smoothness exponent of its basis function cannot exceed log 3 ⁡ 11 ( ≈ 2.18266 ) \log _3 11 (\approx 2.18266) , where the critical Hölder smoothness exponent of a function f : R 2 ↦ R f : \mathbb {R}^2\mapsto \mathbb {R} is defined to be \[ ν ∞ ( f ) ≔ sup { ν : f ∈ Lip ⁡ ν } . \nu _\infty (f) \coloneq \sup \{ \nu : f\in \operatorname {Lip} \nu \}. \] On the other hand, for both regular triangular and quadrilateral meshes, we present several examples of interpolatory ternary subdivision schemes with two-ring stencils such that the critical Hölder smoothness exponents of their basis functions do achieve the optimal smoothness upper bound log 3 ⁡ 11 \log _3 11 . Consequently, we obtain optimal smoothest C 2 C^2 interpolatory ternary subdivision schemes with two-ring stencils for the regular triangular and quadrilateral meshes. Our computation and analysis of optimal multidimensional subdivision schemes are based on the projection method and the ℓ p \ell _p -norm joint spectral radius.

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.003
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: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.003
Threshold uncertainty score0.011

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.003
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.001
Scholarly communication0.0010.001
Open science0.0010.002
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0030.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.006
GPT teacher head0.242
Teacher spread0.235 · 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

Citations21
Published2006
Admission routes2
Has abstractyes

Explore more

Same venueMathematics of ComputationSame topicAdvanced Numerical Analysis TechniquesFrench-language works237,207