Fast and direct inversion methods for the multivariate nonequispaced fast Fourier transform
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 applications such as MRI and solution of PDEs are interested in the in...
Main Authors: | Melanie Kircheis, Daniel Potts |
---|---|
Format: | Article |
Language: | English |
Published: |
Frontiers Media S.A.
2023-06-01
|
Series: | Frontiers in Applied Mathematics and Statistics |
Subjects: | |
Online Access: | https://www.frontiersin.org/articles/10.3389/fams.2023.1155484/full |
Similar Items
-
Parameter tuning for the NFFT based fast Ewald summation
by: Franziska Nestler
Published: (2016-07-01) -
Design and Simulation of a Low-Power and High-Speed Fast Fourier Transform for Medical Image Compression
by: Ernest Ravindran Ramaswami Sachidanandan, et al.
Published: (2023-03-01) -
Fast Linear Canonical Transform for Nonequispaced Data
by: Yannan Sun, et al.
Published: (2023-04-01) -
Generator Sinyal Electromyographic Dengan Menggunakan Metode Fast Fourier Transform
by: Nur Kholis
Published: (2016-03-01) -
One-Dimensional Quaternion Discrete Fourier Transform and an Approach to Its Fast Computation
by: Dorota Majorkowska-Mech, et al.
Published: (2023-12-01)