Updating and computing the geoid using two dimensional fast Hartley transform and fast T transform

In the analyses of 2D real arrays, fast Hartley (FHT), fast T (FTT) and real-valued fast Fourier transforms are generally preferred in lieu of a complex fast Fourier transform due to the advantages of the former with respect to disk storage and computation time. Although the FHT and the FTT in one dimension are identical, they are different in two or more dimensions. Therefore, first, definitions and some properties of both transforms and the related 2D FHT and FTT algorithms are stated. After reviewing the 2D FHT and FTT solutions of Stokes' formula in planar approximation, 2D FHT and FTT methods are developed for geoid updating to incorporate additional gravity anomalies. The methods are applied for a test area which includes a 64×64 grid of 3^′×3^′ point gravity anomalies and geoid heights calculated from point masses. The geoids computed by 2D FHT and FTT are found to be identical. However, the RMS value of the differences between the computed and test geoid is ±15 mm. The numerical simulations indicate that the new methods of geoid updating are practical and accurate with considerable savings on storage requirements. Received: 15 February 1996; Accepted: 22 January 1997