Efficient spherical harmonic transforms aimed at pseudospectral numerical simulations

In this paper, we report on very efficient algorithms for the spherical harmonic transform (SHT). Explicitly vectorized variations of the algorithm based on the Gauss-Legendre quadrature are discussed and implemented in the SHTns library which includes scalar and vector transforms. The main breakthrough is to achieve very efficient on-the-fly computations of the Legendre associated functions, even for very high resolutions, by taking advantage of the specific properties of the SHT and the advanced capabilities of current and future computers. This allows us to simultaneously and significantly reduce memory usage and computation time of the SHT. We measure the performance and accuracy of our algorithms. Even though the complexity of the algorithms implemented in SHTns are in $O(N^3)$ (where N is the maximum harmonic degree of the transform), they perform much better than any third party implementation, including lower complexity algorithms, even for truncations as high as N=1023. SHTns is available at this https URL as open source software.

[1]  Gabriele Steidl,et al.  Fast algorithms for discrete polynomial transforms , 1998, Math. Comput..

[2]  Dominique Jault,et al.  On the reflection of Alfvén waves and its implication for Earth's core modelling , 2011, 1112.3879.

[3]  Mark Tygert,et al.  Fast algorithms for spherical harmonic expansions, II , 2008, J. Comput. Phys..

[4]  H. Nataf,et al.  Modes and instabilities in magnetized spherical Couette flow , 2012, Journal of Fluid Mechanics.

[5]  Pierre Augier,et al.  A New Formulation of the Spectral Energy Budget of the Atmosphere, with Application to Two High-Resolution General Circulation Models , 2013 .

[6]  J. Shebalin,et al.  Theory and Modeling of Planetary Dynamos , 2012 .

[7]  U. von Matt,et al.  Gauss quadrature , 1998 .

[8]  Mark Tygert,et al.  Fast Algorithms for Spherical Harmonic Expansions , 2006, SIAM J. Sci. Comput..

[9]  Firas Hamze,et al.  Importance of explicit vectorization for CPU and GPU software performance , 2010, J. Comput. Phys..

[10]  U. R. Christensena,et al.  A numerical dynamo benchmark , 2001 .

[11]  Gary A. Glatzmaier,et al.  Numerical Simulations of Stellar Convective Dynamos. I. The Model and Method , 1984 .

[12]  John Methven,et al.  Wave Activity for Large-Amplitude Disturbances Described by the Primitive Equations on the Sphere , 2013 .

[13]  D. Healy,et al.  Computing Fourier Transforms and Convolutions on the 2-Sphere , 1994 .

[14]  Ataru Sakuraba,et al.  Generation of a strong magnetic field using uniform heat flux at the surface of the core , 2009 .

[15]  Martin Reinecke,et al.  Libpsht – algorithms for efficient spherical harmonic transforms , 2010, 1010.2084.

[16]  Sean S. B. Moore,et al.  FFTs for the 2-Sphere-Improvements and Variations , 1996 .

[17]  Martin J. Mohlenkamp.  A fast transform for spherical harmonics , 1997 .

[18]  Masaru Kono,et al.  Effect of the inner core on the numerical solution of the magnetohydrodynamic dynamo , 1999 .

[19]  Steven G. Johnson,et al.  The Design and Implementation of FFTW3 , 2005, Proceedings of the IEEE.

[20]  Gary A. Glatzmaier,et al.  Numerical Simulations of Stellar Convective Dynamos , 1984 .

[21]  Matthias Rempel,et al.  Large Scale Flows in the Solar Convection Zone , 2009 .

[22]  Reiji Suda,et al.  A fast spherical harmonics transform algorithm , 2002, Math. Comput..