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.