Rapid prolate pseudospectral differentiation and interpolation with the fast multipole method

Published

Journal Article

Pseudospectral methods utilizing prolate spheroidal wave functions as basis functions have been shown to possess advantages over the conventional pseudospectral methods based on trigonometric and orthogonal polynomials. However, the spectral differentiation and interpolation steps of the prolate pseudospectral method involve matrix-vector products, which, if evaluated directly, entail O(N2) memory requirement and computational complexity (where N is the number of unknowns utilized for discretization and interpolation). In this work we show that the fast multipole method (FMM) can be used to reduce the memory requirement and computational complexity of the prolate pseudospectral method to O(N). Example simulation results demonstrate the speed and accuracy of the resulting fast prolate pseudospectral solver. © 2006 Society for Industrial and Applied Mathematics.

Full Text

Duke Authors

Cited Authors

  • Kovvali, N; Wenbin, L; Zhiqin, Z; Couchman, L; Carin, L

Published Date

  • December 1, 2006

Published In

Volume / Issue

  • 28 / 2

Start / End Page

  • 485 - 497

International Standard Serial Number (ISSN)

  • 1064-8275

Digital Object Identifier (DOI)

  • 10.1137/050635961

Citation Source

  • Scopus