Efficient Spectral-Galerkin Methods III: Polar and Cylindrical Geometries

  • Authors:
  • Jie Shen

  • Affiliations:
  • -

  • Venue:
  • SIAM Journal on Scientific Computing
  • Year:
  • 1997

Quantified Score

Hi-index 0.06

Visualization

Abstract

We present in this paper several extremely efficient and accurate spectral-Galerkin methods for second- and fourth-order equations in polar and cylindrical geometries. These methods are based on appropriate variational formulations which incorporate naturally the pole condition(s). In particular, the computational complexities of the Chebyshev--Galerkin method in a disk and the Chebyshev--Legendre--Galerkin method in a disk or a cylinder are quasi-optimal (optimal up to a logarithmic term). As an indication of efficiency, the CPU time for the Poisson solver on a disk by our Chebyshev--Galerkin method is only about 70% of the corresponding finite-difference code in FISHPACK.