Fast computation of magnetostatic fields by Non-uniform Fast Fourier Transforms
arXiv:0807.2387 · doi:10.1063/1.2995850
Abstract
The bottleneck of micromagnetic simulations is the computation of the long-ranged magnetostatic fields. This can be tackled on regular N-node grids with Fast Fourier Transforms in time N logN, whereas the geometrically more versatile finite element methods (FEM) are bounded to N^4/3 in the best case. We report the implementation of a Non-uniform Fast Fourier Transform algorithm which brings a N logN convergence to FEM, with no loss of accuracy in the results.
Cited by in corpus (6)
- Chiral nature of magnetic monopoles in artificial spin ice
- A convergent and precise finite element scheme for Landau-Lifschitz-Gilbert equation
- Non-uniform FFT for the finite element computation of the micromagnetic scalar potential
- Hybrid FFT algorithm for fast demagnetization field calculations on non-equidistant magnetic layers
- Energy levels of interacting curved nano-magnets in a frustrated geometry: increasing accuracy when using finite difference methods
- Theory of perturbation of the magnetostatic field by an anisotropic magnetic toroid