Numerical stability of nonequispaced fast Fourier transforms

被引：14
|
作者：
Potts, Daniel [1 ]
Tasche, Manfred [2 ]
机构：
[1] Tech Univ Chemnitz, Dept Math, D-09107 Chemnitz, Germany
[2] Univ Rostock, Inst Math, D-18051 Rostock, Germany
来源：
JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS | 2008年 / 222卷 / 02期
关键词：
Fast Fourier transform; Nonequispaced data; Nonequispaced FFT; Numerical stability; Roundoff error; Approximation error; Sampling of trigonometric polynomials;
D O I：
10.1016/j.cam.2007.12.025
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
This paper presents some new results Oil numerical stability for multivariate fast Fourier transform of no nonequispaced data (NFFT). In contrast to last Fourier transform (of equispaced data), the NFFT is all approximate algorithm. In a worst case study, we show that both approximation error and roundoff error have I strong influence Oil the numerical stability of NFFT. Numerical tests confirm the theoretical estimates of numerical stability. (C) 2007 Elsevier B.V All rights reserved.
引用
收藏
页码：655 / 674
页数：20
相关论文
共 50 条
  • [1] A note on fast Fourier transforms for nonequispaced grids
    Steidl, G
    ADVANCES IN COMPUTATIONAL MATHEMATICS, 1998, 9 (3-4) : 337 - 352
  • [2] A note on fast Fourier transforms for nonequispaced grids
    Gabriele Steidl
    Advances in Computational Mathematics, 1998, 9 : 337 - 352
  • [3] FAST FOURIER-TRANSFORMS FOR NONEQUISPACED DATA
    DUTT, A
    ROKHLIN, V
    SIAM JOURNAL ON SCIENTIFIC COMPUTING, 1993, 14 (06): : 1368 - 1393
  • [4] Numerical stability of fast Fourier transforms
    Baszenski, G
    Rao, XF
    Tasche, M
    ADVANCES IN MULTIVARIATE APPROXIMATION, 1999, 107 : 57 - 72
  • [5] Uniform error estimates for nonequispaced fast Fourier transforms
    Potts, Daniel
    Tasche, Manfred
    SAMPLING THEORY SIGNAL PROCESSING AND DATA ANALYSIS, 2021, 19 (02):
  • [6] A fast algorithm for nonequispaced Fourier transforms on the rotation group
    Daniel Potts
    Jürgen Prestin
    Antje Vollrath
    Numerical Algorithms, 2009, 52 : 355 - 384
  • [7] A fast algorithm for nonequispaced Fourier transforms on the rotation group
    Potts, Daniel
    Prestin, Juergen
    Vollrath, Antje
    NUMERICAL ALGORITHMS, 2009, 52 (03) : 355 - 384
  • [8] Nonuniform fast Fourier transforms with nonequispaced spatial and frequency data and fast sinc transforms
    Kircheis, Melanie
    Potts, Daniel
    Tasche, Manfred
    NUMERICAL ALGORITHMS, 2023, 92 (04) : 2307 - 2339
  • [9] Nonuniform fast Fourier transforms with nonequispaced spatial and frequency data and fast sinc transforms
    Melanie Kircheis
    Daniel Potts
    Manfred Tasche
    Numerical Algorithms, 2023, 92 : 2307 - 2339
  • [10] FAST FOURIER-TRANSFORMS FOR NONEQUISPACED DATA .2.
    DUTT, A
    ROKHLIN, V
    APPLIED AND COMPUTATIONAL HARMONIC ANALYSIS, 1995, 2 (01) : 85 - 100
12345