A Comprehensive Review of Solving Selective Harmonic Elimination Problem With Algebraic Algorithms

Selective harmonic elimination pulsewidth modulation (SHEPWM) is an effective way to eliminate low-order harmonics in high-power applications. However, one of the biggest challenges of SHEPWM is to solve the selective harmonic elimination (SHE) equations, which are composed of some nonlinear transce...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on power electronics Jg. 39; H. 1; S. 850 - 868
Hauptverfasser: Wang, Chenxu, Zhang, Qi, Yu, Wensheng, Yang, Kehu
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York IEEE 01.01.2024
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
Algebra
Algebraic algorithms
Algorithms
Biological system modeling
Classification algorithms
dc–ac conversion
Exact solutions
Harmonic analysis
Harmonics
high-power applications
Identities
inverters
Mathematical models
Polynomials
Power system harmonics
Pulse duration
Pulse width modulation
renewable energy system
selective harmonic elimination (SHE)
Voltage
ISSN:0885-8993, 1941-0107
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Selective harmonic elimination pulsewidth modulation (SHEPWM) is an effective way to eliminate low-order harmonics in high-power applications. However, one of the biggest challenges of SHEPWM is to solve the selective harmonic elimination (SHE) equations, which are composed of some nonlinear transcendental equations. Over the past few decades, algebraic algorithms have shown a considerable ability to solve SHE equations, specifically for obtaining all exact solutions. Much research has been published about algebraic algorithms, struggling to solve more switching angles, solving different mathematic models of SHEPWM, and so on. This article comprehensively reviews existing algebraic algorithms, including elementary symmetric polynomials, power sums, Newton's identities, resultant elimination method, Wu's method, Gröbner-basis-based method, Chudnovsky algorithm, polynomial homotopy continuation algorithm, and real-time implementation by algebraic algorithms. The principle operation of these methods is summarized, and their performance is analyzed in terms of execution time, solving ability, and applicability for different mathematical models.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0885-8993
1941-0107
DOI:10.1109/TPEL.2023.3327280