Fast computation of magnetostatic fields by Non-uniform Fast Fourier Transforms

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.
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00297240
Contributor : Olivier Fruchart <>
Submitted on : Tuesday, July 15, 2008 - 3:46:22 PM
Last modification on : Thursday, April 4, 2019 - 9:44:02 AM
Long-term archiving on: Friday, May 28, 2010 - 10:29:14 PM

Files

nfft-submit1.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Evaggelos Kritsikis, Jean-Christophe Toussaint, Olivier Fruchart, Helga Szambolics, L. D. Buda-Prejbeanu. Fast computation of magnetostatic fields by Non-uniform Fast Fourier Transforms. Applied Physics Letters, American Institute of Physics, 2008, 93 (13), pp.132508. ⟨10.1063/1.2995850⟩. ⟨hal-00297240⟩

Share

Metrics

Record views

411

Files downloads

342