Review of recent developments in magnet computations

An attempt is made to classify the magnetic field problems according to their degree of difficulty, i.e. according to 1. their number of dimensions, 2. their linearity, 3. their time dependency. For the different classes of problems, approaches are presented which are believed to be best suited for the problem. Special emphasis is given to recent trends. This paper is mainly based on the proceedings of the first two COMPUMAG conferences (Oxford, 1976 [1], Grenoble, 1978 [2]).