Calculation of demagnetizing field distribution based on fast Fourier transform of convolution

被引:52
|
作者
Hayashi, N
Saito, K
Nakatani, Y
机构
来源
JAPANESE JOURNAL OF APPLIED PHYSICS PART 1-REGULAR PAPERS SHORT NOTES & REVIEW PAPERS | 1996年 / 35卷 / 12A期
关键词
micromagnetic calculation; demagnetizing field; fast Fourier transform; cyclic convolution; crosstie wall; magnetization curling;
D O I
10.1143/JJAP.35.6065
中图分类号
O59 [应用物理学];
学科分类号
摘要
It is confirmed that the calculation of the demagnetizing field in micromagnetic simulations can be accelerated significantly by using the discrete convolution theorem and the fast Fourier transform (FFT). When the magnetization distribution is periodic, application of the theorem to the demagnetizing field calculation is straightforward. Unlike the previously reported FFT method which is based on the continuous Fourier transform of the demagnetizing held, the method can also be used in the case of non-periodic magnetization structures. It is also confirmed that the result obtained using the new FFT method coincides with that of the conventional direct method, as expected. The principle of calculation and the results of one- and two-dimensional calculations which show the validity and effectiveness of the developed method are presented.
引用
收藏
页码:6065 / 6073
页数:9
相关论文
共 50 条
  • [1] AN ALGOL CONVOLUTION PROCEDURE BASED ON FAST FOURIER TRANSFORM
    SINGLETON, RC
    COMMUNICATIONS OF THE ACM, 1969, 12 (03) : 179 - +
  • [2] Application of the fast Fourier transform to calculating pruned convolution
    Mikheev, P. A.
    DOKLADY MATHEMATICS, 2015, 92 (02) : 630 - 633
  • [3] Application of the fast Fourier transform to calculating pruned convolution
    P. A. Mikheev
    Doklady Mathematics, 2015, 92 : 630 - 633
  • [4] Fractional-Fourier-transform calculation through the fast-Fourier-transform algorithm
    Garcia, J
    Mas, D
    Dorsch, RG
    APPLIED OPTICS, 1996, 35 (35): : 7013 - 7018
  • [5] Solving singular convolution equations using the inverse Fast Fourier Transform
    Eduard Krajník
    Vincente Montesinos
    Peter Zizler
    Václav Zizler
    Applications of Mathematics, 2012, 57 : 543 - 550
  • [6] Solving singular convolution equations using the inverse Fast Fourier Transform
    Krajnik, Eduard
    Montesinos, Vincente
    Zizler, Peter
    Zizler, Vaclav
    APPLICATIONS OF MATHEMATICS, 2012, 57 (05) : 543 - 550
  • [7] Enhancing Convolution Computing: An Overlap-Add Fast Fourier Transform Approach
    Hung Tran
    Duc Pham
    Trang Hoang
    INTELLIGENCE OF THINGS: TECHNOLOGIES AND APPLICATIONS, ICIT 2024, VOL 1, 2024, 229 : 85 - 94
  • [8] Fast reduction a module polynomial and fast Vandermonde transform based on fast Fourier transform algorithms
    Krot, AM
    SIGNAL PROCESSING, SENSOR FUSION, AND TARGET RECOGNITION VII, 1998, 3374 : 505 - 514
  • [9] The Fast Fourier transform
    Oberst, Ulrich
    SIAM JOURNAL ON CONTROL AND OPTIMIZATION, 2007, 46 (02) : 496 - 540
  • [10] Fast algorithm for modular exponentiation based on fast fourier transform
    Fuguo D.
    Yuxin T.
    Lin D.
    Journal of Convergence Information Technology, 2011, 6 (06) : 500 - 506