Related papers: FFT-based solution of 2D and 3D magnetization prob…
A stack of coated conductors is a perspective configuration for various applications of high temperature superconductors. We present an efficient fast Fourier transform-based numerical method for magnetization problems for a stack of flat…
Fast-Fourier Transform (FFT) methods have been widely used in solid mechanics to address complex homogenization problems. However, current FFT-based methods face challenges that limit their applicability to intricate material models or…
Fast Fourier transform (FFT) based methods have turned out to be an effective computational approach for numerical homogenisation. In particular, Fourier-Galerkin methods are computational methods for partial differential equations that are…
Thin film magnetization problems in type-II superconductivity are usually formulated in terms of the magnetization function alone, which allows one to compute the sheet current density and the magnetic field but often inhibits computing the…
This paper is devoted to the efficient numerical solution of the Helmholtz equation in a two- or three-dimensional rectangular domain with an absorbing boundary condition (ABC). The Helmholtz problem is discretized by standard bilinear and…
We make progress towards a 3D finite-element model for the magnetization of a high temperature superconductor (HTS): We suggest a method that takes into account demagnetisation effects and flux creep, while it neglects the effects…
Computational micromechanics and homogenization require the solution of the mechanical equilibrium of a periodic cell that comprises a (generally complex) microstructure. Techniques that apply the Fast Fourier Transform have attracted much…
We derive a variational formulation for thin film magnetization problems in type-II superconductors written in terms of two variables, the electric field and the magnetization function. A numerical method, based on this formulation, makes…
Shielding sensitive scientific and medical devices from the magnetic field environment is one of the promising applications of superconductors. Magnetic field concentration by superconducting magnetic lenses is the opposite phenomenon…
This paper presents a novel formulation and consequently a new solution for two dimensional TM electromagnetic integral equations by the method of moments in polar coordination. The main idea is the reformulation of the 2-D problem…
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…
Numerical methods for modeling thin-film magnetization are primarily focused on computing the current density distribution. The highly nonlinear current-voltage characteristic of type-II superconductors significantly complicates the…
HTS are feasible for hight power applications because of the smaller consumption demand of the cooling system in comparison to the whole power device. Real industral devices contain superconductors with 2D and 3D geometry (coated conductors…
Fourier solvers have become efficient tools to establish structure-property relations in heterogeneous materials. Introduced as an alternative to the Finite Element (FE) method, they are based on fixed-point solutions of the…
Discrete transforms such as the discrete Fourier transform (DFT) and the discrete Hartley transform (DHT) are important tools in numerical analysis. The successful application of transform techniques relies on the existence of efficient…
The plane wave method is most widely used for solving the Kohn-Sham equations in first-principles materials science computations. In this procedure, the three-dimensional (3-dim) trial wave functions' fast Fourier transform (FFT) is a…
Although FFT-based methods are renowned for their numerical efficiency and stability, traditional discretizations fail to capture material interfaces that are not aligned with the grid, resulting in suboptimal accuracy. To address this…
The nonuniform discrete Fourier transform (NUDFT) and its inverse are widely used in various fields of scientific computing. In this article, we propose a novel superfast direct inversion method for type-III NUDFT. The proposed method…
Recently, a new polynomial basis over binary extension fields was proposed such that the fast Fourier transform (FFT) over such fields can be computed in the complexity of order $\mathcal{O}(n\lg(n))$, where $n$ is the number of points…
In this letter, a fast Fourier transform (FFT)-enhanced low-complexity super-resolution sensing algorithm for near-field source localization with both angle and range estimation is proposed. Most traditional near-field source localization…