Recursive algorithms for the computation of the potential harmonic coefficients of a constant density polyhedron

The gravitational potential of a constant density general polyhedron can be expressed both in terms of a closed analytical expression and as a series expansion involving the corresponding spherical harmonic coefficients. The latter can be obtained from two independent algorithms, which differ not only in their algorithmic architecture but in their efficiency and overall performance, especially when computing the coefficients of higher degree and order. In the present paper a comparative study of all these three approaches is carried out focusing on the numerical implementation of the recursive relations appearing in the two algorithms for the computation of the polyhedral potential harmonic coefficients. The performed numerical investigations show that the linear algorithm proposed by Jamet and Thomas (Proceedings of the second international GOCE user workshop, ‘GOCE, The Geoid and Oceanography’, ESA-ESRIN, Frascati, Italy, 8–10 March 2004, ESA SP-569, 2004), but so far not implemented, achieves a reasonable accuracy at a computational expense that opens to practical applications, for instance in the field of satellite gravimetry/gradiometry interpretation. The convergence behavior of the linear recursion algorithm is studied thoroughly and a computational procedure is proposed that enables the stable computation of potential harmonic coefficients up to degree 60 when referring to an arbitrarily shaped polyhedral body.