Abstract
A fast Chebyshev–Fourier algorithm for Poisson-type equations in polar geometries is presented in this paper. The new algorithm improves upon the algorithm of Jie Shen (1997), by taking advantage of the odd–even parity of the Fourier expansion in the azimuthal direction, and it is shown to be more efficient in terms of CPU and memory.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
