Applications of nonuniform fast transform algorithms in numerical solutions of differential and integral equations


Journal Article

We review our recent efforts to apply the nonuniform fast Fourier transform (NUFFT) and related fast transform algorithms to numerical solutions of Maxwell's equations in time and frequency domains. The NUFFT is a fast algorithm to perform the discrete Fourier transform of data sampled nonuniformly (NUDFT). Through oversampling and fast interpolation, the forward and inverse NUFFT's can be achieved with O(N log 2 N) arithmetic operations, asymptotically the same as the regular fast Fourier transform (FFT) algorithms. Using the NUFFT scheme, we develop nonuniform fast cosine transform (NUFCT) and fast Hankel transform (NUFHT) algorithms. These algorithms provide an efficient tool for numerical differentiation and integration, the key in the solutions to differential equations and volume integral equations. We present sample applications of these nonuniform fast transform algorithms in the numerical solution to Maxwell's equations.

Full Text

Duke Authors

Cited Authors

  • Liu, QH; Xu, XM; Tian, B; Zhang, ZQ

Published Date

  • July 1, 2000

Published In

Volume / Issue

  • 38 / 4 I

Start / End Page

  • 1551 - 1560

International Standard Serial Number (ISSN)

  • 0196-2892

Digital Object Identifier (DOI)

  • 10.1109/36.851955

Citation Source

  • Scopus