Related papers: Hybrid FFT algorithm for fast demagnetization fiel…
As research into magnetic thin films and spintronics devices is moving from single to multiple magnetic layers, there is a need for micromagnetics modelling tools specifically designed to efficiently handle magnetic multilayers. Here we…
The long-range magnetic field is the most time-consuming part in micromagnetic simulations. Improvements both on a numerical and computational basis can relief problems related to this bottleneck. This work presents an efficient…
In the finite difference method which is commonly used in computational micromagnetics, the demagnetizing field is usually computed as a convolution of the magnetization vector field with the demagnetizing tensor that describes the…
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…
We present a quasi-linearly scaling, first order polynomial finite element method for the solution of the magnetostatic open boundary problem by splitting the magnetic scalar potential. The potential is determined by solving a Dirichlet…
The well-known discrete Fourier transform (DFT) can easily be generalized to arbitrary nodes in the spatial domain. The fast procedure for this generalization is referred to as nonequispaced fast Fourier transform (NFFT). Various…
We present a finite-difference method for the topology optimization of permanent magnets that is based on the FFT accelerated computation of the stray-field. The presented method employs the density approach for topology optimization and…
Present day electromagnetic field calculations have limitations that are due to techniques employing edge-based discretization methods. While these vector finite element methods solve the issues of tangential continuity of fields and the…
We developed fast direct solver for 3D Helmholtz and Maxwell equations in layered medium. The algorithm is based on the ideas of cyclic reduction for separable matrices. For the grids with major uniform part (within the survey domain in the…
Nonequispaced discrete Fourier transformation (NDFT) is widely applied in all aspects of computational science and engineering. The computational efficiency and accuracy of NDFT has always been a critical issue in hindering its…
The cylindrical Taylor Interpolation through FFT (TI-FFT) algorithm for computation of the near-field and far-field in the quasi-cylindrical geometry has been introduced. The modal expansion coefficient of the vector potentials ${\bf F}$…
A new transform over finite fields, the finite field Hartley transform (FFHT), was recently introduced and a number of promising applications on the design of efficient multiple access systems and multilevel spread spectrum sequences were…
Nonuniform Fourier data are routinely collected in applications such as magnetic resonance imaging, synthetic aperture radar, and synthetic imaging in radio astronomy. To acquire a fast reconstruction that does not require an online inverse…
Various applications such as MRI, solution of PDEs, etc. need to perform an inverse nonequispaced fast Fourier transform (NFFT), i. e., compute $M$ Fourier coefficients from given $N$ nonequispaced data. In the present paper we consider…
In the multi-cell multiuser multi-input multi-output (MU-MIMO) systems, fractional programming (FP) has demonstrated considerable effectiveness in optimizing beamforming vectors, yet it suffers from high computational complexity. Recent…
Tucker decomposition is proposed to reduce the memory requirement of the far-fields in the fast multipole method (FMM)-accelerated surface integral equation simulators. It is particularly used to compress the far-fields of FMM groups, which…
One of the most efficient ways to produce unconditional simulations is with the kernel convolution using fast Fourier transform (FFT) [1]. However, when data is located on a surface, this approach is not efficient because data needs to be…
Nonnegative Matrix Factorization (NMF) is the problem of approximating a nonnegative matrix with the product of two low-rank nonnegative matrices and has been shown to be particularly useful in many applications, e.g., in text mining, image…
The standard particle-in-cell algorithm suffers from grid heating. There exists a gridless alternative which bypasses the deposition step and calculates each Fourier mode of the charge density directly from the particle positions. We show…
We consider the Fast Fourier Transform (FFT) based numerical method for thin film magnetization problems [Vestg{\aa}rden and Johansen, SuST, 25 (2012) 104001], compare it with the finite element methods, and evaluate its accuracy. Proposed…