Cargando…
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...
| Autor principal: | |
|---|---|
| Lenguaje: | eng |
| Publicado: |
1981
|
| Materias: | |
| Acceso en línea: | https://dx.doi.org/10.1109/TMAG.1981.1061370 http://cds.cern.ch/record/134438 |
| Sumario: | 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. (46 refs). |
|---|