|
| Publications [#63753] of Lawrence Carin
Papers Published
- Kovvali, N. and Wenbin Lin and Zhiqin Zhao and Couchman, L. and Carin, L., The FMM-accelerated fast prolate pseudospectral method,
2006 IEEE Antennas and Propagation Society International Symposium (IEEE Cat. No. 06CH37758C)
(2006),
pp. 674 -, Albuquerque, NM, USA
(last updated on 2007/04/14)
Abstract: Summary form only given. The pseudospectral method utilizing prolate spheroidal wave functions (PSWFs) as basis functions has been shown to possess strong advantages over the conventional pseudospectral methods based on trigonometric and orthogonal polynomials and related functions. These include higher accuracy using smaller number of unknowns for problems involving bandlimited functions; the PSWFs are a better tool as compared to the orthogonal polynomials for representing bandlimited functions, which are ubiquitous with wave-phenomena encountered in many real-world physics and engineering applications. The prolate pseudospectral method also affords a more uniform spatial collocation grid, which not only provides better resolution near the domain center but also leads to larger stable time-steps in the explicit solution of time-dependent problems. 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 are presented to demonstrate the speed and accuracy of the resulting fast prolate pseudospectral solver
Keywords: computational complexity;computational electromagnetics;matrix algebra;vectors;wave functions;
|