The fast Hankel transform (FHT) is introduced in this paper. Hankel transform is fast calculated using convolution property of FFT by variable transform. The sampling points problem is studied. The end correction of F...The fast Hankel transform (FHT) is introduced in this paper. Hankel transform is fast calculated using convolution property of FFT by variable transform. The sampling points problem is studied. The end correction of FHT is analysed in detail, and the results show that the accuracy is increased with end correction. So, FHT with end correction is a fast, right and efficient algorithm. FHT is applied to three-dimensional polar coordinate wave equations. It is confirmed that FHT is a fast and efficient numerical solution method to wave equations.展开更多
文摘The fast Hankel transform (FHT) is introduced in this paper. Hankel transform is fast calculated using convolution property of FFT by variable transform. The sampling points problem is studied. The end correction of FHT is analysed in detail, and the results show that the accuracy is increased with end correction. So, FHT with end correction is a fast, right and efficient algorithm. FHT is applied to three-dimensional polar coordinate wave equations. It is confirmed that FHT is a fast and efficient numerical solution method to wave equations.