Related papers: FFT-based solution of 2D and 3D magnetization prob…
Zernike moments can be used to generate invariant features that are applied in various machine vision applications. They, however, suffer from slow implementation and numerical stability problems. We propose a novel method for computing…
We introduce an efficient finite-element approach for large-scale real-space pseudopotential density functional theory (DFT) calculations incorporating noncollinear magnetism and spin-orbit coupling. The approach, implemented within the…
The special unitary group SU(2) plays a fundamental role in the description of symmetries in quantum mechanics, theoretical physics, and spherical signal processing. In this paper, we address the computational challenges of performing…
We present numerical methods based on the fast Fourier transform (FFT) to solve convolution integral equations on a semi-infinite interval (Wiener-Hopf equation) or on a finite interval (Fredholm equation). We extend and improve a FFT-based…
An FFT-based algorithm is developed to simulate the propagation of elastic waves in heterogeneous $d$-dimensional rectangular shape domains. The method allows one to prescribe the displacement as a function of time in a subregion of the…
Fast Fourier Transforms (FFT) are widely used to reduce memory and computational costs in deep learning. However, existing implementations, including standard FFT and real FFT (rFFT), cannot achieve true in-place computation. In particular,…
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…
Ferromagnetic substrate influences the electromagnetic response of a type-II superconducting film to the applied magnetic field. We present a two-dimensional integrodifferential model for the magnetization of a flat…
This work illustrates the possibility to apply the Fast Fourier Transformation to obtain the integrals of the Boundary Element Method (BEM) on arbitrary shapes. The procedure is inspired by the technique used with great success within the…
Fourier transform methods are used to analyze functions and data sets to provide frequencies, amplitudes, and phases of underlying oscillatory components. Fast Fourier transform (FFT) methods offer speed advantages over evaluation of…
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…
Ultrafast electronic dynamics in solids lies at the core of modern condensed matter and materials physics. To build up a practical ab initio method for studying solids under photoexcitation, we develop a momentum-resolved real-time time…
To deal with the multi-scale nature of the quench propagation problem in superconducting magnets, this work presents a quasi-three-dimensional (Q3D) approach combining a two-dimensional finite-element method (FEM) in the transversal…
Many interesting and fundamentally practical optimization problems, ranging from optics, to signal processing, to radar and acoustics, involve constraints on the Fourier transform of a function. It is well-known that the {\em fast Fourier…
Homogenization is a fundamental technique for estimating the macroscopic properties of materials with microscale heterogeneity. Among Homogenization methods, the FFT-based Homogenization algorithm has become widely used due to its…
We develop an advanced analytical model for calculating the broadband stripline ferromagnetic resonance (FMR) response for metallic ferromagnetic films, taking into account the exchange interaction as well as the exchange boundary…
In this work, we present the \emph{twiddless fast Fourier transform (TFFT)}, a novel algorithm for computing the $N$-point discrete Fourier transform (DFT). The TFFT's divide strategy builds on recent results that decimate an $N$-point…
Recent advancements have illuminated the efficacy of some tensorization-decomposition Parameter-Efficient Fine-Tuning methods like LoRA and FacT in the context of Vision Transformers (ViT). However, these methods grapple with the challenges…
Recently, there has been a lot of research into tensor singular value decomposition (t-SVD) by using discrete Fourier transform (DFT) matrix. The main aims of this paper are to propose and study tensor singular value decomposition based on…
This research work focuses on the design of a high-resolution fast Fourier transform (FFT) /inverse fast Fourier transform (IFFT) processors for constraints analysis purpose. Amongst the major setbacks associated with such high resolution,…