Electrical behavior of a simple helical flux compression generator for code benchmarking
A variety of basic magnetic flux compression (MFC) generator geometries have been tested during the last three decades. Though size and operating regimes differ widely, it is apparent that the helical flux compression generator is the most promising concept with respect to current amplification and...
Gespeichert in:
Veröffentlicht in: | IEEE transactions on plasma science 2001-08, Vol.29 (4), p.573-581 |
---|---|
Hauptverfasser: | , , , , , , , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | A variety of basic magnetic flux compression (MFC) generator geometries have been tested during the last three decades. Though size and operating regimes differ widely, it is apparent that the helical flux compression generator is the most promising concept with respect to current amplification and compactness. Though the geometry of the helical generator (dynamically expanding armature in the center of a current carrying helix) seems to be basic, it turns out that the understanding of all involved processes is rather difficult. This fact is apparent from the present lack of a computer model that is solely based on physical principles and manages without heuristic factors. A simple generator was designed to address flux and current losses of the helical generator. The generator's maximum current amplitude is given as a function of the seed current and the resulting "seed-current" spread is compared to the output of state-of-the-art computer models. Temporally resolved current and current time derivative signals are compared as well. The detailed generator geometry is introduced in order to facilitate future computer code bench marking or development. The impact of this research on the present understanding of magnetic flux losses in helical MFC generators is briefly discussed. |
---|---|
ISSN: | 0093-3813 1939-9375 |
DOI: | 10.1109/27.940950 |