Spectral methods for problems in complex geometries

The properties of spectral methods are surveyed and their extension to solve problems in complex geometries is developed. A new iteration procedure is introduced to solve efficiently the full matrix equations resulting from spectral approximations to nonconstant coefficient boundary-value problems in complex geometries. It is shown that the work required to solve these spectral equations exceeds that of solving the lowest-order finite-difference approximation to the same problem by only O(N log N).