MétaCan
Menu
Back to cohort
Record W4391843605 · doi:10.3390/fractalfract8020116

Escape Criteria Using Hybrid Picard S-Iteration Leading to a Comparative Analysis of Fractal Mandelbrot Sets Generated with S-Iteration

2024· article· en· W4391843605 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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueFractal and Fractional · 2024
Typearticle
Languageen
FieldMathematics
TopicMathematical Dynamics and Fractals
Canadian institutionsUniversity of Victoria
FundersMajmaah University
KeywordsMandelbrot setJulia setFractalMathematicsNewton fractalFixed-point iterationSet (abstract data type)Fixed pointApplied mathematicsAlgorithmPure mathematicsIterative methodComputer scienceTopology (electrical circuits)Mathematical analysisCombinatorics

Abstract

fetched live from OpenAlex

Fractals are a common characteristic of many artificial and natural networks having topological patterns of a self-similar nature. For example, the Mandelbrot set has been investigated and extended in several ways since it was first introduced, whereas some authors characterized it using various complex functions or polynomials, others generalized it using iterations from fixed-point theory. In this paper, we generate Mandelbrot sets using the hybrid Picard S-iterations. Therefore, an escape criterion involving complex functions is proved and used to provide numerical and graphical examples. We produce a wide range of intriguing fractal patterns with the suggested method, and we compare our findings with the classical S-iteration. It became evident that the newly proposed iteration method produces novel images that are more spontaneous and fascinating than those produced by the S-iteration. Therefore, the generated sets behave differently based on the parameters involved in different iteration schemes.

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: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.963
Threshold uncertainty score0.894

Codex and Gemma teacher scores by category

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