A new wind turbine generation system based on matrix converter
Bibliographic record
Abstract
At a given wind velocity, the mechanical power available from a wind turbine is a function of its shaft speed. To maximize the power captured from the wind, the shaft speed has to be controlled. In low-cost wind energy conversion systems, the turbine shaft speed is not regulated and a squirrel-cage induction generator is used to convert the turbine mechanical power to electric power. Power electronic converters are used to interface the induction generator with the grid and maximize the power captured from the wind. In this paper, a wind energy conversion scheme based on the matrix converter topology is proposed. As the commutation problems in the conventional nine-bidirectional switch matrix converter topology impairs its performance in industrial applications, an improved topology which does not have any commutation problems, has been adopted for the system presented in this paper. Through matrix converter, the terminal voltage and frequency of the induction generator can be controlled in such a way that the wind turbine is operating at its maximum power point for all wind velocities. The power factor at the interface with the grid is also controlled by the matrix converter to ensure purely active power injection into the grid for optimal utilization of the installed wind turbine capacity. Furthermore, the reactive power requirements of the induction generator are satisfied by the matrix converter to avoid self-excitation capacitors. Theoretical analysis and simulation results are used to support the claims made on the advantages of the proposed scheme.
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.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.004 | 0.001 |
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".