• Home
  • Search
  • Magnetostatic field computation in thin films based on k-space fast convolution with truncated Green's function
  • https://doi.org/10.48448/a577-jq37Copy DOI Icon

Magnetostatic field computation in thin films based on k-space fast convolution with truncated Green's function

Show More
  • Abstract
  • Literature Map
  • Similar Papers
Abstract

The numerical studies of magnetization dynamics in micromagnetic systems with spatially distributed magnetization crucially rely on the computation of magnetostatic fields generated by the ferromagnet. The solution of the magnetostatic problem can be written as convolution of an appropriate Green’s function with the magnetization vector field. Since the Green’s function is long-range, after discretization of the problem in N cells, the direct numerical computation of the convolution integral has a computational cost scaling as N2.In this work, we use, as it is often done in micromagnetics, the Fast Fourier Transform (FFT) method to reduce the computational cost scaling to N logN. We consider micromagnetic systems with thin-film geometry where the magnetization can be considered constant across the thickness of the magnet. In these situations, only the field averaged across the thickness is relevant to the magnetostatic interactions and both the magnetization and the averaged field inside the magnet depend only on two spatial variables. The usual approach to deal with this type of problem is to use FFT to compute the discretized version of the convolution integral relating the field and the magnetization [1]. The dual approach to the usual one, is based on the discretization of the integral relation between the field (averaged across the thickness) and the magnetization in the reciprocal space (k-space). The connection in the k-space is given by the Fourier transform of Green function of the magnetostatic problem which, in case of infinite thin-films, can be written in a special form taking into account the thin-film geometry [2]. The analysis in the k-space has been extensively used in connection with linear spin wave dynamics in thin films working as magnonic waveguide, where all the relation of practical use (e.g dispersion relations), are easily obtained by algebraic manipulations. When the dimensions of the thin film are finite, the reconstruction of the magnetostatic field with the infinite film Green's function, is altered by the presence of replicas of the thin film in the ordinary space due to the sampling operation in the k-space. This effect is usually smoothed by using zero-padding, which increases the distance between two interacting replicas weakening their coupling.In this work, a fast convolution algorithm in the k-space able to remove the influence of replicas in the reconstruction of the magnetostatic field in thin films of finite size, is proposed and applied to study linear spin wave dynamics. It is based on the use of the Fourier transform of truncated Green function, which has been recently used to compute volume potentials defined on free-space in a finite (truncated) domain [3]. Such method, guarantees a regularization of the Green function by cutting off the interaction in physical space beyond the domain of interest and this in turn produces spectral accuracy [5] for the Fourier transform evaluation by FFT algorithm. The accuracy of the proposed method is studied by comparing the results with analytical calculations and with those obtained by fast convolution with the infinite thin film Green's function as a function of mesh size. For example, in the figure, the computation of the demagnetizing factor along the x direction for a thin film of dimensions Lx = 300nm, Ly = 100nm and Lz = 3nm as a function of the mesh dimension (kxmax = kymax = kmax) and discretization step-size (Δkx = Δky = Δk) in the k-space is considered. With solid lines, the curves in the infinite film approximation (infin.) are indicated, while curves with symbols results from the proposed approach (trunc.). The horizontal dotted line, represents the analytical value of the demagnetizing factor evaluated with Newell’s formula [6]. Computation with Δk< π/300 nm-1, for the duality property of the Fourier transform, are equivalent to use zero padding in the ordinary space. This produces a substantial improving of estimation accuracy with respect to the analytical value, in case of infinite film approximation. As a benchmark of the proposed approach, it results that the curves computed with the truncated Green function, show a weak dependence from Δk for Δk>π/R and collapse into the same one for Δk<π/R, where R is the radius of a disk region which defines the compact support of the truncated Green function. This, as a confirmation of the fact, that when the region that exceeds the support of the truncated Green's function is zero padded, there is no effect on the computation of the magnetostatic field. Moreover, for sufficient value of kmax the asymptotic value tends towards analytical one, since when Δk<π/R the influence of replicas on the magnetostatic field computation is removed. **

Similar Papers
  • Conference Article
  • Citations4

Brute-force search of fast convolution algorithms

  • May 01, 2013
  • Steve Haynal +1
  • Research Article
  • Citations10

Implementation of FFT Algorithm using DSP TMS320F28335 for Shunt Active Power Filter

  • Jul 25, 2016
  • Journal of The Institution of Engineers (India): Series B
  • Pinkal Jashvantbhai Patel +2
  • Research Article
  • Citations21

Scaled Radix-2/8 Algorithm for Efficient Computation of Length-$N=2^{m}$ DFTs

  • May 01, 2014
  • IEEE Transactions on Signal Processing
  • Weihua Zheng +2
  • Conference Article
  • Citations12

4k-point FFT algorithms based on optimized twiddle factor multiplication for FPGAs

  • Sep 01, 2010
  • Fahad Qureshi +2
  • Book Chapter
  • Citations8

Chapter 6 - Fast Fourier transform methods

  • Jan 01, 1989
  • Basic Digital Signal Processing
  • Gordon B. Lockhart +1
  • Research Article

Simulation of 32-Point Split-Radix Multipath Delay Commutator (SRMDC) based FFT Architecture

  • Aug 25, 2016
  • Indian Journal of Science and Technology
  • V Mangaiyarkarasi +1
  • Research Article
  • Citations1

PFFTC: An improved fast Fourier transform for the IBM cell broadband engine

  • May 01, 2010
  • Procedia Computer Science
  • Andrew Shaffer +2
  • Book Chapter
  • Citations14

A Methodology for the Formal Verification of FFT Algorithms in HOL

  • Jan 01, 2004
  • Behzad Akbarpour +1
  • PDF
  • Research Article

A fast convolution method for the fractional Laplacian in R

  • Jun 21, 2025
  • Revista de la Real Academia de Ciencias Exactas, Físicas y Naturales. Serie A. Matemáticas
  • Jorge Cayama +3
  • Conference Article
  • Citations6

An efficient sparse FFT algorithm with application to signal source separation and 2D virtual image feature extraction

  • Nov 01, 2016
  • Corey D Cooke +4
  • Conference Article
  • Citations2

Twiddle factor transformation for pipelined FFT processing

  • Oct 01, 2007
  • In-Cheol Park +2
  • Research Article
  • Citations4

A new multidimensional FFT based on one-dimensional decompositions

  • Jan 01, 2000
  • IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing
  • R Bernardini
  • Conference Article

Research on Optimization Technology of Radix-4 FFT in FPGA Implementation

  • Nov 06, 2020
  • Ying Liang +3
  • Research Article
  • Citations19

GPU-Based FFT Computation for Multi-Gigabit WirelessHD Baseband Processing

  • Jul 18, 2010
  • EURASIP Journal on Wireless Communications and Networking
  • Nicholas Hinitt +1
  • Conference Article
  • Citations10

Parallel and Pipelined VLSI Implementation of the New Radix-2 DIT FFT Algorithm

  • Dec 01, 2018
  • Harsha Keerthan Samudrala +3
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.