A Fast Hartley Transform Techniques of Computing Stokes Formula
-
Graphical Abstract
-
Abstract
This paper presents a new method for the computation of the Stokes formula using the Fast Hartley Transform(FHT) techniques. The algorithm is most suitable for the computation of real sequence transform, but the Fast Fourier Transform (FFT) techniques is more suitable for the computation of complex sequece transform. The solution of Stokes formula is, however, only associated with a real sequence problem. Therefore the computation of the Stokes formula using FHT techniques is more efficient than using FFT techniques. The procedures of the evaluation of the Stokes formula by FHT techniques are described in detail and correspondingly, some numerical tests are given. By the comparison with both FFT techniques and numerical integration method, the results show that the resulting values of geoidal undulations by FHT techniques are almost the same as by FFT techniques, and the computational speed of FHT technique is about two times faster than that FFT techniques.
-
-