Related papers: FFT-based solution of 2D and 3D magnetization prob…
The convolution potential arises in a wide variety of application areas, and its efficient and accurate evaluation encounters three challenges: singularity, nonlocality and anisotropy. We introduce a fast algorithm based on a far-field…
A new method of quantum state tomography for quantum information processing is described. The method based on two-dimensional Fourier transform technique involves detection of all the off-diagonal elements of the density matrix in a…
In this paper, we propose a simple numerical algorithm based on the weak Galerkin (WG) finite element method for a class of fourth-order problems in fluorescence tomography (FT), eliminating the need for stabilizer terms required in…
We have developed an algorithm for transferring radiation in three-dimensional space. The algorithm computes radiation source and sink terms using the Fast Fourier Transform (FFT) method, based on a formulation in which the integral of any…
Two-Dimensional (2D) Discrete Fourier Transform (DFT) is a basic and computationally intensive algorithm, with a vast variety of applications. 2D images are, in general, non-periodic, but are assumed to be periodic while calculating their…
We extend the foil winding homogenization method to magnetic field conforming formulations. We first propose a full magnetic field foil winding formulation by analogy with magnetic flux density conforming formulations. We then introduce the…
The discrete Fourier transform (DFT) is widely employed for multi-beam digital beamforming. The DFT can be efficiently implemented through the use of fast Fourier transform (FFT) algorithms, thus reducing chip area, power consumption,…
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…
Non-uniform fast Fourier Transform (NUFFT) and inverse NUFFT (INUFFT) algorithms, based on the Fast Multipole Method (FMM) are developed and tested. Our algorithms are based on a novel factorization of the FFT kernel, and are implemented…
A new method is presented for solving Poisson's equation inside an open-ended rectangular pipe. The method uses Fast Fourier Transforms (FFTs) to perform mixed convolutions and correlations of the charge density with the Green function.…
Efficient numerical characterization is a key problem in composite material analysis. To follow accuracy improvement in image tomography, memory efficient methods of numerical characterization have been developed. Among them, an FFT based…
Computing the electric eddy currents in non-linear materials, such as superconductors, is \E{not straightforward}. The design of superconducting magnets and power applications needs electromagnetic computer modeling, being in many cases a…
The performance of multivariate kernel density estimation (KDE) depends strongly on the choice of bandwidth matrix. The high computational cost required for its estimation provides a big motivation to develop fast and accurate methods. One…
To achieve efficient and accurate long-time integration, we propose a fast, accurate, and stable high-order numerical method for solving fractional-in-space reaction-diffusion equations. The proposed method is explicit in nature and…
Available super-resolution techniques for 3D images are either computationally inefficient prior-knowledge-based iterative techniques or deep learning methods which require a large database of known low- and high-resolution image pairs. A…
We examine the response of a soft ferromagnetic film to an in-plane applied magnetic field. Our theory, based on asymptotic analysis of the micromagnetic energy in the thin-film limit, proceeds in two steps: first we determine the magnetic…
In micromagnetic simulations, the demagnetization field is by far the computationally most expensive field component and often a limiting factor in large multilayer systems. We present an exact method to calculate the demagnetization field…
A simplified density functional theory (DFT) method for charged adsorbates on an ultrathin, insulating film supported by a metal substrate is developed and presented. This new method is based on a previous DFT development that uses a…
Fast Fourier Transform (FFT) is an efficient algorithm to compute the Discrete Fourier Transform (DFT) and its inverse. In this paper, we pay special attention to the description of complex-data FFT. We analyze two common descriptions of…
The finite element method is one of the widely employed numerical techniques in electrical engineering for the study of electric and magnetic fields. When applied to the moving conductor problems, the finite element method is known to have…