A fast FFT-based discrete Legendre transform

被引：10
|
作者：
Hale, Nicholas [1 ]
Townsend, Alex [2 ]
机构：
[1] Univ Stellenbosch, Dept Math Sci Appl Math, ZA-7600 Stellenbosch, South Africa
[2] MIT, Dept Math, 77 Massachusetts Ave, Cambridge, MA 02139 USA
来源：
IMA JOURNAL OF NUMERICAL ANALYSIS | 2016年 / 36卷 / 04期
基金：
美国国家科学基金会;
关键词：
discrete Legendre transform; Legendre polynomials; Chebyshev polynomials; fast Fourier transform; FAST FOURIER-TRANSFORMS; GEGENBAUER POLYNOMIALS; NONEQUISPACED DATA; FAST ALGORITHMS; COMPUTATION; EXPANSIONS; QUADRATURE; NODES;
D O I：
10.1093/imanum/drv060
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
An O(N(log N)(2)/log log N) algorithm for the computation of the discrete Legendre transform and its inverse is described. The algorithm combines a recently developed fast transform for converting between Legendre and Chebyshev coefficients with a Taylor series expansion for Chebyshev polynomials about equally spaced points in the frequency domain. Both components are based on the fast Fourier transform, and as an intermediate step we obtain an O(N log N) algorithm for evaluating a degree-(N - 1) Chebyshev expansion on an N-point Legendre grid. Numerical results are given to demonstrate performance and accuracy.
引用
收藏
页码：1670 / 1684
页数：15
相关论文
共 50 条
  • [1] FFT-based fast polynomial rooting
    Hoteit, L
    [J]. ELECTRONICS LETTERS, 1999, 35 (12) : 965 - 966
  • [2] FFT-based fast polynomial rooting
    Hoteit, L
    [J]. 2000 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, PROCEEDINGS, VOLS I-VI, 2000, : 3315 - 3318
  • [3] A modified FFT-based algorithm for real-time computation of Discrete Wavelet Transform
    Kumar, VPD
    Thomas, T
    [J]. IEEE TENCON 2003: CONFERENCE ON CONVERGENT TECHNOLOGIES FOR THE ASIA-PACIFIC REGION, VOLS 1-4, 2003, : 1030 - 1034
  • [4] IMPROVED FFT-BASED NUMERICAL INVERSION OF LAPLACE TRANSFORMS VIA FAST HARTLEY TRANSFORM ALGORITHM
    HWANG, C
    LU, MJ
    SHIEH, LS
    [J]. COMPUTERS & MATHEMATICS WITH APPLICATIONS, 1991, 22 (01) : 13 - 24
  • [5] Fast FFT-based bioheat transfer equation computation
    Dillenseger, Jean-Louis
    Esneault, Simon
    [J]. COMPUTERS IN BIOLOGY AND MEDICINE, 2010, 40 (02) : 119 - 123
  • [6] An FFT-based technique for fast fractal image compression
    Ramkumar, M
    Anand, GV
    [J]. SIGNAL PROCESSING, 1997, 63 (03) : 263 - 268
  • [7] FFT-based computation of shift invariant analytic wavelet transform
    Olkkonen, Hannu
    Olkkonen, Juuso T.
    Pesola, Peitsa
    [J]. IEEE SIGNAL PROCESSING LETTERS, 2007, 14 (03) : 177 - 180
  • [8] A FFT-based formulation for discrete dislocation dynamics in heterogeneous media
    Bertin, N.
    Capolungo, L.
    [J]. JOURNAL OF COMPUTATIONAL PHYSICS, 2018, 355 : 366 - 384
  • [9] A FAST ALGORITHM FOR THE COMPUTATION OF THE DISCRETE LEGENDRE-FENCHEL TRANSFORM
    BRENIER, Y
    [J]. COMPTES RENDUS DE L ACADEMIE DES SCIENCES SERIE I-MATHEMATIQUE, 1989, 308 (20): : 587 - 589
  • [10] FAST FFT-BASED ALGORITHM FOR PHASE ESTIMATION IN SPECKLE IMAGING
    FROST, RL
    RUSHFORTH, CK
    BAXTER, BS
    [J]. APPLIED OPTICS, 1979, 18 (12): : 2056 - 2061
12345