Related papers: Fast computation of magnetostatic fields by Non-un…
An inverse nonequispaced fast Fourier transform (iNFFT) is a fast algorithm to compute the Fourier coefficients of a trigonometric polynomial from nonequispaced sampling data. However, various applications such as magnetic resonance imaging…
The nonuniform fast Fourier transform (NUFFT) generalizes the FFT to off-grid data. Its many applications include image reconstruction, data analysis, and the numerical solution of differential equations. We present FINUFFT, an efficient…
Recent research in deep learning (DL) has investigated the use of the Fast Fourier Transform (FFT) to accelerate the computations involved in Convolutional Neural Networks (CNNs) by replacing spatial convolution with element-wise…
The Discrete Fourier Transform (DFT) is central to the analysis of uniformly sampled signals, yet many practical applications involve non-uniform sampling, requiring the Non-Uniform Discrete Fourier Transform (NUDFT). While quantum…
We present quantitative means for assessing the numerical accuracy of static magnetic field calculations in finite-element models. Our calculations use the three-dimensional Opera simulation software suite of Dassault Syst`emes. Our need to…
Machine learning force fields (MLFFs) have revolutionized molecular simulations by providing quantum mechanical accuracy at the speed of molecular mechanical computations. However, a fundamental reliance of these models on fixed-cutoff…
An extremely fast time-harmonic finite element solver developed for the transmission analysis of photonic crystals was applied to mask simulation problems. The applicability was proven by examining a set of typical problems and by a…
FEM simulations are a standard step in the design of accelerator magnets. It is custom for accelerator applications to characterize the field quality in terms of field expansion coefficients. With a commonly accepted approach, expansion…
Traditional NMF-based signal decomposition relies on the factorization of spectral data, which is typically computed by means of short-time frequency transform. In this paper we propose to relax the choice of a pre-fixed transform and learn…
One of the most efficient ways to produce unconditional simulations is with the spectral method using fast Fourier transform (FFT) [1]. But this approach is not applicable to arbitrary surfaces because no regular grid exists. However,…
In this article, we present a new unified finite element method (UFEM) for simulation of general Fluid-Structure interaction (FSI) which has the same generality and robustness as monolithic methods but is significantly more computationally…
The Fourier-Galerkin method (in short FFTH) has gained popularity in numerical homogenisation because it can treat problems with a huge number of degrees of freedom. Because the method incorporates the fast Fourier transform (FFT) in the…
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…
We present a machine-learning strategy for finite element analysis of solid mechanics wherein we replace complex portions of a computational domain with a data-driven surrogate. In the proposed strategy, we decompose a computational domain…
In this contribution we propose a data-driven surrogate model for the prediction of magnetic stray fields in two-dimensional random micro-heterogeneous materials. Since data driven models require thousands of training data sets, FEM…
The Quantum Fourier transform (QFT) is a key ingredient in most quantum algorithms. We have compared various spin-based quantum computing schemes to implement the QFT from the point of view of their actual time-costs and the accuracy of the…
Iterative Fast Fourier Transform methods are useful for calculating the fields in composite materials and their macroscopic response. By iterating back and forth until convergence, the differential constraints are satisfied in Fourier…
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…
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…
Non-line-of-Sight (NLOS) imaging systems collect light at a diffuse relay surface and input this measurement into computational algorithms that output a 3D volumetric reconstruction. These algorithms utilize the Fast Fourier Transform (FFT)…