Change search
ReferencesLink to record
Permanent link

Direct link
Hierarchical Load–Balancing for Parallel Fast Legendre Transforms
KTH, School of Computer Science and Communication (CSC), Centres, Centre for High Performance Computing, PDC. (Parallelldatorcentrum)
1997 (English)Conference paper (Refereed)
Abstract [en]

We present a parallel Fast Legendre Transform (FLT) based on the Driscol--Healy algorithm with computation complexity O(N log 2 N ). The parallel FLT is load-- balanced in a hierarchical fashion. We use a load--balanced FFT to deduce a load-- balanced parallel fast cosine transform, which in turn serves as a building block for the Legendre transform engine, from which the parallel FLT is constructed. We demonstrate how the arithmetic, memory and communication complexities of the parallel FLT are hierarchically derived via the complexity of its modular blocks. 1 Introduction Legendre transforms are ubiquitous in many disciplines of applied sciences, particularly spectral methods for the solution of partial differential equations [3]. For applications of harmonic analysis on the 2--sphere S 2 , an efficient Legendre transform is as crucial to numeric computation as the fast Fourier transform (FFT) is to classical time--series analysis on R. This stems from the fact that harmonic ana...

Place, publisher, year, edition, pages
National Category
Computer and Information Science
URN: urn:nbn:se:kth:diva-64550OAI: diva2:483119
Proc. 8th SIAM Conf. on Parallel Processing for Scientific Computation
NR 20140805Available from: 2012-01-24 Created: 2012-01-24Bibliographically approved

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Johnsson, Lennart
By organisation
Centre for High Performance Computing, PDC
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 6 hits
ReferencesLink to record
Permanent link

Direct link