English
Related papers

Related papers: FFT-based solution of 2D and 3D magnetization prob…

200 papers

We introduce a new numerical method for solving time-harmonic acoustic scattering problems. The main focus is on plane waves scattered by smoothly varying material inhomogeneities. The proposed method works for any frequency $\omega$, but…

Numerical Analysis · Mathematics 2022-01-14 Anton Arnold , Sjoerd Geevers , Ilaria Perugia , Dmitry Ponomarev

In this work we apply effective field theory (EFT) to observables in quarkonium production and decay that are sensitive to soft gluon radiation, in particular measurements that are sensitive to small transverse momentum. Within the EFT…

High Energy Physics - Phenomenology · Physics 2020-05-20 Sean Fleming , Yiannis Makris , Thomas Mehen

Hadron production at low transverse momenta in semi-inclusive deep inelastic scattering can be described by transverse momentum dependent (TMD) factorization. This formalism has also been widely used to study the Drell-Yan process and…

High Energy Physics - Phenomenology · Physics 2021-01-01 Zhong-Bo Kang , Alexei Prokudin , Nobuo Sato , John Terry

The Fast Fourier Transform (FFT) is a computationally intensive digital signal processing (DSP) function widely used in applications such as imaging, software-defined radio, wireless communication, instrumentation. In this paper, a…

Other Computer Science · Computer Science 2010-06-15 Ashish Raman , Anvesh Kumar , R. K. Sarin

We propose an efficient algorithm for the evaluation of the potential and its gradient of gravitational/electrostatic $N$-body systems, which we call particle mesh multipole method (PMMM or PM$^3$). PMMM can be understood both as an…

Instrumentation and Methods for Astrophysics · Physics 2014-10-20 Keigo Nitadori

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…

Computer Vision and Pattern Recognition · Computer Science 2024-06-05 Eduardo Reis , Thangarajah Akilan , Mohammed Khalid

The Fast Fourier Transform is extended to functions on finite graphs whose edges are identified with intervals of finite length. Spectral and pseudospectral methods are developed to solve a wide variety of time dependent partial…

Numerical Analysis · Mathematics 2025-07-11 Robert Carlson

This work proposes a new precoded filter bank (FB) system via a two-dimensional (2D) fast Fourier transform (2D-FFT). Its structure is similar to Orthogonal Time Frequency Space (OTFS) systems, where the OFDM transmitter is changed to a…

Information Theory · Computer Science 2022-06-14 R. Pereira Junior , C. A. F. da Rocha , B. S. Chang , D. Le Ruyet

In the paper, we utilize the fractional differential transformation (FDT) to solving singular initial value problem of fractional Emden-Fowler type differential equations. The solutions of our model equations are calculated in the form of…

Numerical Analysis · Mathematics 2024-12-20 Josef Rebenda , Zdeněk Šmarda

Modern radio interferometers enable high-resolution polarization imaging, offering insights into cosmic magnetism through Rotation Measure (RM) synthesis. Traditional 2+1D RM synthesis treats the 2D spatial and 1D spectral transforms…

Instrumentation and Methods for Astrophysics · Physics 2025-08-27 Victor Gustafsson , Marcus Brüggen , Cyril Tasse , Torsten Enßlin , Shane O'Sullivan , Francesco de Gasperin

We present an efficient method for propagating the time-dependent Kohn-Sham equations in free space, based on the recently introduced Fourier contour deformation (FCD) approach. For potentials which are constant outside a bounded domain,…

Chemical Physics · Physics 2023-07-10 Jason Kaye , Alex Barnett , Leslie Greengard , Umberto De Giovannini , Angel Rubio

The Fast Fourier Transform (FFT) is one of the most widely used algorithms in high performance computing, with critical applications in spectral analysis for both signal processing and the numerical solution of partial differential…

Numerical Analysis · Mathematics 2025-05-01 Laslo Hunhold , John Gustafson

Although Fourier series approximation is ubiquitous in computational physics owing to the Fast Fourier Transform (FFT) algorithm, efficient techniques for the fast evaluation of a three-dimensional truncated Fourier series at a set of…

Numerical Analysis · Mathematics 2017-03-08 Marco Caliari , Simone Zuccher

The Fourier transform method can be applied to obtain electromagnetic knots, which are solutions of Maxwell equations in vacuum with non-trivial topology of the field lines and especial properties. The program followed in this work allows…

Mathematical Physics · Physics 2019-01-04 M. Arrayás , J. L. Trueba

We present a novel algorithm, named the 2D-FFAST, to compute a sparse 2D-Discrete Fourier Transform (2D-DFT) featuring both low sample complexity and low computational complexity. The proposed algorithm is based on mixed concepts from…

Information Theory · Computer Science 2015-09-22 Frank Ong , Sameer Pawar , Kannan Ramchandran

We propose a parametric finite element method (PFEM) for efficiently solving the morphological evolution of solid-state dewetting of thin films on a flat rigid substrate in three dimensions (3D). The interface evolution of the dewetting…

Computational Physics · Physics 2020-03-03 Quan Zhao , Wei Jiang , Weizhu Bao

A brief introduction to conventional DFT of 3D freezing is given and some recent results are reviewed. The conventional DFT, however, can not be used in the 2D case, particularly, because it can not describe the hexatic phase --…

Statistical Mechanics · Physics 2007-05-23 Elena Tareyeva , Valentin Ryzhov

The computational efficiency and rapid convergence of fast Fourier transform (FFT)-based solvers render them a powerful numerical tool for periodic cell problems in multiscale modeling. On regular grids, they tend to outperform traditional…

Numerical Analysis · Mathematics 2026-02-18 Martin Ladecký , Ivana Pultarová , François Bignonnet , Indre Jödicke , Jan Zeman , Lars Pastewka

A fast and stable numerical method is formulated to compute the time evolution of a wave function in a magnetic field by solving the time-dependent Schroedinger equation. This computational method is based on the finite element method in…

Computational Physics · Physics 2009-11-06 Naoki Watanabe , Masaru Tsukada

The inverse problem of Kohn-Sham density functional theory (DFT) is often solved in an effort to benchmark and design approximate exchange-correlation potentials. The forward and inverse problems of DFT rely on the same equations but the…

Chemical Physics · Physics 2017-08-02 Daniel Jensen , Adam Wasserman
‹ Prev 1 4 5 6 7 8 10 Next ›