Iterative algorithm for magnetostatic problems with saturable media

Iterative algorithm for magnetostatic problems with saturable media

This paper presents an iterative algorithm for computing a static magnetic field in an unbounded region in which the medium is saturable. An analysis is presented that shows the algorithm converges to the correct answer for all starting conditions.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on magnetics 1982-03, Vol.18 (2), p.393-396
1. Verfasser: Steele, C.
Format: Artikel
Sprache:eng
Schlagworte:
Grid computing
Iterative algorithms
Iterative methods
Magnetic cores
Magnetic fields
Magnetic flux
Magnetic heads
Magnetostatics
Permanent magnets
Permeability
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:This paper presents an iterative algorithm for computing a static magnetic field in an unbounded region in which the medium is saturable. An analysis is presented that shows the algorithm converges to the correct answer for all starting conditions.
ISSN:0018-9464
1941-0069
DOI:10.1109/TMAG.1982.1061867