Lumped Parameter Thermal Network Modelling of Power Transformers
Bibliographic record
Abstract
The trend of increasing power densities of modern day power converters is pushing components like power transformers to their thermal limits, furthering the need for accurate thermal modelling. Numerical methods like Computational Fluid Dynamics (CFD) and Finite Element Analysis (FEA) are commonly used for the thermal characterization of electronic components like power transformers. Although, such numerical methods provide accurate thermal results they possess the drawback of having a large computational head. The present paper aims to address this issue by investigating a low cost Lumped Parameter Thermal Network (LPTN) model that can provide reasonably accurate results with greatly reduced computational effort. Further, the thermal network modelling methodology employed can be easily automated with a simple and intuitive method for thermal resistance calculation. In order to compare the accuracy of the proposed thermal network model to conventional numerical models, a coupled electromagnetic and CFD (multiphysics) analysis is conducted. Finally, the proposed thermal network model and the multiphysics model are experimentally validated on a PQ 40/30 transformer operating in a 3.3 kW Switch Mode Power Supply (SMPS). The proposed thermal network model is able to predict transformer operating temperatures within 10 % of the experimental results, with only a fraction of the computational time of the detailed multiphysics numerical model, providing a means of quick estimation of transformer thermal management requirements in the initial design phase.
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 imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.000 |
| Insufficient payload (model declined to judge) | 0.003 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".