MétaCan
Menu
Back to cohort
Record W2083701551 · doi:10.1115/imece2010-38256

Low Cost Particle Swarm Algorithm Using Surrogate Model Based Pre-Evaluation for Inverse Heat Conduction Analysis

2010· article· en· W2083701551 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

Venuenot available
Typearticle
Languageen
FieldMathematics
TopicNumerical methods in inverse problems
Canadian institutionsUniversity of British Columbia
Fundersnot available
KeywordsMathematical optimizationParticle swarm optimizationSolverAlgorithmComputer scienceInverse problemSensitivity (control systems)Mathematics

Abstract

fetched live from OpenAlex

Using internal temperature measurements from inside a solid to determine the initial or boundary conditions or material properties is a common inverse heat conduction problem. These problems are ill-posed in nature and a robust mathematical solution is not available for them. Stochastical search algorithms like Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) have been found to be very effective in dealing with some of the challenges in solving inverse problems, such as time step size limit and sensitivity to the measurement errors. However, these methods normally require large population size and do not use the gradient information and, therefore, their computational costs are generally higher than their gradient based alternatives. This is especially true when using a computationally expensive high-fidelity method like finite element analysis as the direct solver in the core of the inverse algorithm. The inherent inefficiency of this procedure is even more obvious when we notice that an algorithm like PSO is rank-based, i.e. the actual magnitude of cost function is not important, and only their relative ordering is used. In a typical implementation of PSO, most of the objective function evaluations are discarded, unless when it is improving the local memory of the particle. A computationally cheaper substitute for full analysis methods is using metamodels also known as surrogate models. They construct an approximation to the direct problem using a set of available data and the underlying physics of the problem. In this research, an inexact pre-evaluation of the boundary heat flux components using a simplified physics and data fitting is used to find the more promising solutions, and then an accurate but computationally expensive three-dimensional finite element discretization of the heat conduction problem is applied only to these elite members of the population. The result is an inverse heat conduction analysis method that has the stability and effectiveness of PSO, and at the same time has a much lower computational cost. In this research, we use a sequential implementation of PSO in dealing with the transient boundary heat flux, and a future time step regularization method is used to create a more stable algorithm. The focus of the test cases in this research paper will be the inverse heat conduction problem in the controlled cooling of steel strips on a run-out table, but the algorithm is readily applicable to other applications of inverse heat conduction analysis.

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.003
metaresearch head score (Gemma)0.001
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.073
Threshold uncertainty score0.751

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0030.001
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
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.216
GPT teacher head0.439
Teacher spread0.223 · 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

Quick stats

Citations0
Published2010
Admission routes1
Has abstractyes

Explore more

Same topicNumerical methods in inverse problemsFrench-language works237,207