Published in

Society for Industrial and Applied Mathematics, SIAM Journal on Scientific Computing, 1(23), p. 271-303

DOI: 10.1137/s1064827599355864

Links

Tools

Export citation

Search in Google Scholar

On the efficient parallel computation of Legendre transforms

Journal article published in 1999 by M. Alves de Inda, Márcia A. Inda ORCID, Rob H. Bisseling, David K. Maslen
This paper is available in a repository.
This paper is available in a repository.

Full text: Download

Green circle
Preprint: archiving allowed
Upload
Green circle
Postprint: archiving allowed
Upload
Green circle
Published version: archiving allowed
Upload
Policy details
Data provided by SHERPA/RoMEO

Abstract

In this article, we discuss a parallel implementation of efficient algorithms for computation of Legendre polynomial transforms and other orthogonal polynomial transforms. We develop an approach to the Driscoll-Healy algorithm using polynomial arithmetic and present experimental results on the accuracy, efficiency, and scalability of our implementation. The algorithms were implemented in ANSI C using the BSPlib communications library. We also present a new algorithm for computing the cosine transform of two vectors at the same time.