MétaCan
Menu
Back to cohort

Convergence improvement in finite difference solution using MC and DC methods for magnetic field analysis

2016· article· en· W2528563906 on OpenAlex
Hossein Torkaman, Mehdi Salehi, Ali Safdari

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

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicElectromagnetic Simulation and Numerical Methods
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsConvergence (economics)Gauss–Seidel methodIterative methodPartial differential equationAlgorithmGaussApplied mathematicsFinite difference methodMathematicsDifferential equationLocal convergenceMathematical optimizationComputer scienceMathematical analysis

Abstract

fetched live from OpenAlex

Among the numerical methods used in the electromagnetic modeling and simulation of electrical systems, the iterative method is included. In this paper, different techniques are employed to a classical Gauss-Seidel Algorithm. It used to improve accuracy and convergence of the solutions for a common partial differential equation in finite difference method. The first method is named Double Convergence Method in which combinations of two Iteration Methods with different initial points are utilized. The second method is called Multi-level Convergence Method where, a mixture of multi Iteration Method with initial values obtained from previous processes using first, second, third order polynomial for the next round of iteration. The convergence time and accuracy of both methods are evaluated and compared using classical Gauss-Seidel Algorithm by solving various one dimensional partial differential equations. The aim of this paper is to reduce the number of iterations of this method in order to reduce the computing time and to improve the convergence speed.

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

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.0000.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.028
GPT teacher head0.338
Teacher spread0.311 · 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