Strategies to Accelerate Harmonic Minimization in Multilevel Inverters Using a Parallel Genetic Algorithm on Graphical Processing Unit
Bibliographic record
Abstract
Multilevel inverters form a popular class of high-power inverters due to their high-voltage operation, high efficiency, low switching losses, and low electromagnetic interference. Metaheuristics, such as the genetic algorithm (GA), have been used with success to compute optimal switching angles for multilevel inverters with many dc sources while minimizing several harmonics. However, these methods are computationally demanding and cannot easily be used for real-time control. In this letter, a parallel implementation of the GA on graphical processing unit (GPU) is proposed in order to accelerate the computation of the optimal switching angles for multilevel inverters with varying dc sources. Four approaches to parallelize and speed up the computation of the total harmonic distortion are presented and compared. By exploiting the massively parallel architecture of GPUs, the computation of optimal angles is accelerated by a factor of 469× compared to a sequential execution on CPU. The proposed solution optimizes multilevel inverters with 100 variable dc sources while minimizing the first 100 harmonics in 164 ms.
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.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.002 | 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".